On rules with existential variables: walking the decidability line

DOI10.1016/J.ARTINT.2011.03.002MaRDI QIDQ646515zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

rulesdecidabilitychasebackward chainingforward chainingrule dependencyTGD

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

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

• scientific article; zbMATH DE number 3852463 (Why is no real title available?)
• scientific article; zbMATH DE number 3723857 (Why is no real title available?)
• scientific article; zbMATH DE number 1946846 (Why is no real title available?)
• scientific article; zbMATH DE number 1953133 (Why is no real title available?)
• scientific article; zbMATH DE number 1953134 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• A Proof Procedure for Data Dependencies
• A top-down proof procedure for generalized data dependencies
• Data exchange: semantics and query answering
• Graph-based knowledge representation. Computational foundations of conceptual graphs
• Rules Dependencies in Backward Chaining of Conceptual Graphs Rules
• Testing containment of conjunctive queries under functional and inclusion dependencies
• The Implication Problem for Functional and Inclusion Dependencies is Undecidable
• The implication and finite implication problems for typed template dependencies
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family

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
• scientific article; zbMATH DE number 7561463 (Why is no real title available?)
• scientific article; zbMATH DE number 7561477 (Why is no real title available?)
• Datalog: Bag Semantics via Set Semantics
• The price of query rewriting in ontology-based data access
• First-order rewritability of ontology-mediated queries in linear temporal logic
• On the k-Boundedness for Existential Rules
• Recent advances in Datalog\(^\pm \)
• On combining ontologies and rules
• Knowledge base exchange: the case of OWL 2 QL
• Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
• Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
• Querying the unary negation fragment with regular path expressions
• Reasoning with ontologies
• Semantic web
• 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
• An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies
• Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
• 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
• scientific article; zbMATH DE number 7566070 (Why is no real title available?)
• Towards more expressive ontology languages: the query answering problem
• Rules Dependencies in Backward Chaining of Conceptual Graphs Rules
• A First Order Logic Benchmark for Defeasible Reasoning Tool Profiling
• On Horn Conjunctive Queries
• Reasoning on anonymity in Datalog
• Uniform Restricted Chase Termination
• Datalog and Its Extensions for Semantic Web Databases
• Polynomial combined first-order rewritings for linear and guarded existential rules
• Provenance circuits for trees and treelike instances
• Finite model reasoning over existential rules

Describes a project that uses

Uses Software

• Datalog

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)