Taming the Infinite Chase: Query Answering under Expressive Relational Constraints

From MaRDI portal
Publication:2856474

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




Related Items (41)

On the data complexity of consistent query answeringOn the data complexity of consistent query answering over graph databasesInconsistency-tolerant query answering for existential rulesMV-Datalog+-: Effective Rule-based Reasoning with Uncertain ObservationsOn the Interaction of Existential Rules and Equality Constraints in Ontology QueryingRepresenting ontologies using description logics, description graphs, and rulesUnnamed ItemA 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 coinFinite model reasoning over existential rulesAnswer Counting under Guarded TGDsThe notion of abstraction in ontology-based data managementPolynomial combined first-order rewritings for linear and guarded existential rulesSaturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragmentsUniform Restricted Chase TerminationA Tutorial on Query Answering and Reasoning over Probabilistic Knowledge BasesRecent Advances in Datalog$$^\pm $$Reasoning on anonymity in DatalogQuery Answering in the Description Logic Horn- $\mathcal{SHIQ}$Unnamed ItemAdding Metalogic Features to Knowledge Representation Languages*Datalog and Its Extensions for Semantic Web DatabasesQuery answering under probabilistic uncertainty in Datalog\(+/-\) ontologiesOn the finite controllability of conjunctive query answering in databases under open-world assumptionLogic, Languages, and Rules for Web Data Extraction and Reasoning over DataTractable query answering and rewriting under description logic constraintsUnnamed ItemUnnamed ItemUnnamed ItemSemi-oblivious chase termination: the sticky caseCharacterizing Boundedness in Chase VariantsExploiting forwardness: satisfiability and query-entailment in forward guarded fragmentSemantic Acyclicity for Conjunctive Queries: Approximations and ConstraintsDatalog: Bag Semantics via Set SemanticsFoundations of ontology-based data access under bag semanticsCombining Description Logics, Description Graphs, and RulesA more general theory of static approximations for conjunctive queriesThe Impact of Active Domain Predicates on Guarded Existential RulesPreference-based inconsistency-tolerant query answering under existential rulesGuarded Ontology-Mediated QueriesOn 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