On rules with existential variables: walking the decidability line
From MaRDI portal
Publication:646515
DOI10.1016/J.ARTINT.2011.03.002zbMATH Open1225.68247OpenAlexW2040566369MaRDI QIDQ646515FDOQ646515
Authors: Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat 
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
Recommendations
- Combining decidability paradigms for existential rules
- Characterizing boundedness in chase variants
- Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
- Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
- Fast query answering over existential rules
Cites Work
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Title not available (Why is that?)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- Testing containment of conjunctive queries under functional and inclusion dependencies
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- Title not available (Why is that?)
- Data exchange: semantics and query answering
- A Proof Procedure for Data Dependencies
- Title not available (Why is that?)
- Title not available (Why is that?)
- The implication and finite implication problems for typed template dependencies
- A top-down proof procedure for generalized data dependencies
- Title not available (Why is that?)
- Rules Dependencies in Backward Chaining of Conceptual Graphs Rules
- Graph-based knowledge representation. Computational foundations of conceptual graphs
Cited In (45)
- Preserving constraints with the stable chase
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- 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
- On the k-Boundedness for Existential Rules
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Recent advances in Datalog\(^\pm \)
- On combining ontologies and rules
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
- Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
- Reasoning with ontologies
- Semantic web
- Knowledge base exchange: the case of OWL 2 QL
- Querying the unary negation fragment with regular path expressions
- Combining decidability paradigms for existential rules
- Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
- The pragmatic proof: hypermedia API composition and execution
- 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
- Restricted chase termination for existential rules: a hierarchical approach and experimentation
- Characterizing boundedness in chase variants
- A tetrachotomy of ontology-mediated queries with a covering axiom
- Answer Counting under Guarded TGDs
- Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
- An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies
- Corrigendum: ``Combining decidability paradigms for existential rules
- Logic-based argumentation with existential rules
- Guarded Ontology-Mediated Queries
- \(\exists \)-ASP for computing repairs with existential ontologies
- Query rewriting under linear \(\mathcal {EL}\) knowledge bases
- The impact of active domain predicates on guarded existential rules
- Title not available (Why is that?)
- Rules Dependencies in Backward Chaining of Conceptual Graphs Rules
- 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
- Provenance circuits for trees and treelike instances
- Finite model reasoning over existential rules
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)
