The following pages link to (Q4864249):
Displaying 45 items.
- Refinements of complexity results on type consistency for object-oriented databases (Q5946054) (← links)
- Using acceptors as transducers (Q5958726) (← links)
- Incremental reasoning on monadic second-order logics with logic programming (Q5963088) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- Orbital concept lattices (Q6045083) (← links)
- Metafinite model theory (Q6064289) (← links)
- Logics capturing relativized complexity classes uniformly (Q6064295) (← links)
- Answer Counting under Guarded TGDs (Q6076172) (← links)
- The notion of abstraction in ontology-based data management (Q6080649) (← links)
- DNAQL: a query language for DNA sticker complexes (Q6095484) (← links)
- On the k-Boundedness for Existential Rules (Q6104757) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- Efficient Evaluation of Arbitrary Relational Calculus Queries (Q6137874) (← links)
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments (Q6149592) (← links)
- Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests (Q6151565) (← links)
- Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions (Q6152662) (← links)
- A simple logic of concepts (Q6156201) (← links)
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases (Q6163648) (← links)
- Early detection of temporal constraint violations (Q6178450) (← links)
- Rewriting with Acyclic Queries: Mind Your Head (Q6178695) (← links)
- Correctness Notions for Petri Nets with Identifiers (Q6189321) (← links)
- Efficient edit rule implication for nominal and ordinal data (Q6199490) (← links)
- POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND (Q6204145) (← links)
- The Choice Construct in the Soufflé Language (Q6488150) (← links)
- On acceptance conditions in abstract argumentation frameworks (Q6494661) (← links)
- Verified first-order monitoring with recursive rules (Q6535617) (← links)
- Provenance in databases: principles and applications (Q6535982) (← links)
- Rethinking static analysis by combining discrete and continuous reasoning (Q6536275) (← links)
- Range-restricted and Horn interpolation through clausal tableaux (Q6541142) (← links)
- Generative Datalog with continuous distributions (Q6551262) (← links)
- The expressive power of revised Datalog on problems with closure properties (Q6562535) (← links)
- Executable first-order queries in the logic of information flows (Q6563053) (← links)
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates (Q6566618) (← links)
- Merging relational database technology with constraint technology (Q6570939) (← links)
- Revisiting analogical proportions and analogical inference (Q6577679) (← links)
- Provenance calculus and possibilistic logic: a parallel and a discussion (Q6587941) (← links)
- Consistency, acyclicity, and positive Semirings (Q6612793) (← links)
- Towards declarative comparabilities: application to functional dependencies (Q6615314) (← links)
- Relational schemas with multiplicity bounds, diversity bounds and functional dependencies (Q6630185) (← links)
- Computationally hard problems for logic programs under answer set semantics (Q6636616) (← links)
- Predictive mining of multi-temporal relations (Q6647763) (← links)
- Multiteam semantics for interventionist counterfactuals: probabilities and causation (Q6655115) (← links)
- Extracting attribute implications from a formal context: unifying the basic approaches (Q6658951) (← links)
- Languages generated by conjunctive query fragments of FC[REG] (Q6661764) (← links)
