Taming the Infinite Chase: Query Answering under Expressive Relational Constraints

DOI10.1613/JAIR.3873zbMath1361.68221arXiv1212.3357OpenAlexW1824207140WikidataQ129489739 ScholiaQ129489739MaRDI QIDQ2856474

Georg Gottlob, Michael Kifer, Andrea Calì

Publication date: 29 October 2013

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.3357

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (41)

On the data complexity of consistent query answering ⋮ On the data complexity of consistent query answering over graph databases ⋮ Inconsistency-tolerant query answering for existential rules ⋮ MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations ⋮ On the Interaction of Existential Rules and Equality Constraints in Ontology Querying ⋮ Representing ontologies using description logics, description graphs, and rules ⋮ Unnamed Item ⋮ A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin ⋮ Finite model reasoning over existential rules ⋮ Answer Counting under Guarded TGDs ⋮ The notion of abstraction in ontology-based data management ⋮ Polynomial combined first-order rewritings for linear and guarded existential rules ⋮ Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments ⋮ Uniform Restricted Chase Termination ⋮ A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases ⋮ Recent Advances in Datalog$$^\pm $$ ⋮ Reasoning on anonymity in Datalog ⋮ Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ ⋮ Unnamed Item ⋮ Adding Metalogic Features to Knowledge Representation Languages* ⋮ Datalog and Its Extensions for Semantic Web Databases ⋮ Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies ⋮ On the finite controllability of conjunctive query answering in databases under open-world assumption ⋮ Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data ⋮ Tractable query answering and rewriting under description logic constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Semi-oblivious chase termination: the sticky case ⋮ Characterizing Boundedness in Chase Variants ⋮ Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment ⋮ Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints ⋮ Datalog: Bag Semantics via Set Semantics ⋮ Foundations of ontology-based data access under bag semantics ⋮ Combining Description Logics, Description Graphs, and Rules ⋮ A more general theory of static approximations for conjunctive queries ⋮ The Impact of Active Domain Predicates on Guarded Existential Rules ⋮ Preference-based inconsistency-tolerant query answering under existential rules ⋮ Guarded Ontology-Mediated Queries ⋮ On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules

This page was built for publication: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints