Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
From MaRDI portal
Publication:2856474
DOI10.1613/jair.3873zbMath1361.68221arXiv1212.3357MaRDI 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
Related Items
Finite model reasoning over existential rules, Datalog and Its Extensions for Semantic Web Databases, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Characterizing Boundedness in Chase Variants, Guarded Ontology-Mediated Queries, Unnamed Item, Adding Metalogic Features to Knowledge Representation Languages*, The Impact of Active Domain Predicates on Guarded Existential Rules, On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules, Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data, On the data complexity of consistent query answering, On the finite controllability of conjunctive query answering in databases under open-world assumption, A more general theory of static approximations for conjunctive queries, Representing ontologies using description logics, description graphs, and rules, Tractable query answering and rewriting under description logic constraints, Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin, Semi-oblivious chase termination: the sticky case, Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment, Inconsistency-tolerant query answering for existential rules, A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\), Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies, Foundations of ontology-based data access under bag semantics, On the data complexity of consistent query answering over graph databases, Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints, On the Interaction of Existential Rules and Equality Constraints in Ontology Querying, Recent Advances in Datalog$$^\pm $$, Unnamed Item, Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$, Combining Description Logics, Description Graphs, and Rules
