On rules with existential variables: walking the decidability line
From MaRDI portal
Publication:646515
DOI10.1016/J.ARTINT.2011.03.002zbMATH Open1225.68247OpenAlexW2040566369MaRDI QIDQ646515FDOQ646515
Marie-Laure Mugnier, Michel Leclère, Eric Salvat, Jean-François Baget
Publication date: 17 November 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2011.03.002
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Testing containment of conjunctive queries under functional and inclusion dependencies
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- Data exchange: semantics and query answering
- A Proof Procedure for Data Dependencies
- The implication and finite implication problems for typed template dependencies
- A top-down proof procedure for generalized data dependencies
- Rules Dependencies in Backward Chaining of Conceptual Graphs Rules
- Graph-based knowledge representation. Computational foundations of conceptual graphs
Cited In (41)
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Characterizing Boundedness in Chase Variants
- Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Datalog: Bag Semantics via Set Semantics
- The price of query rewriting in ontology-based data access
- The Impact of Active Domain Predicates on Guarded Existential Rules
- Provenance Circuits for Trees and Treelike Instances
- On the k-Boundedness for Existential Rules
- First-order rewritability of ontology-mediated queries in linear temporal logic
- On combining ontologies and rules
- Preserving Constraints with the Stable Chase
- $$\exists $$ -ASP for Computing Repairs with Existential Ontologies
- Query Rewriting under Linear $$\mathcal {EL}$$ Knowledge Bases
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
- Reasoning with ontologies
- Semantic web
- Knowledge base exchange: the case of OWL 2 QL
- Combining decidability paradigms for existential rules
- Semi-oblivious chase termination: the sticky case
- Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin
- A tetrachotomy of ontology-mediated queries with a covering axiom
- Answer Counting under Guarded TGDs
- Recent Advances in Datalog$$^\pm $$
- An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies
- Logic-based argumentation with existential rules
- Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis
- Guarded Ontology-Mediated Queries
- Querying the Unary Negation Fragment with Regular Path Expressions.
- Title not available (Why is that?)
- Towards more expressive ontology languages: the query answering problem
- A First Order Logic Benchmark for Defeasible Reasoning Tool Profiling
- On Horn Conjunctive Queries
- Reasoning on anonymity in Datalog
- Uniform Restricted Chase Termination
- Polynomial combined first-order rewritings for linear and guarded existential rules
- Datalog and Its Extensions for Semantic Web Databases
- Finite model reasoning over existential rules
- The pragmatic proof: Hypermedia API composition and execution
Uses Software
This page was built for publication: On rules with existential variables: walking the decidability line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646515)
