Towards more expressive ontology languages: the query answering problem
From MaRDI portal
Publication:359987
DOI10.1016/j.artint.2012.08.002zbMath1270.68293OpenAlexW2001399171WikidataQ59259506 ScholiaQ59259506MaRDI QIDQ359987
Andrea Calì, Georg Gottlob, Andreas Pieris
Publication date: 23 August 2013
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0004370212001026
Related Items
Inconsistency-tolerant query answering for existential rules, A tetrachotomy of ontology-mediated queries with a covering axiom, Circuit Complexity Meets Ontology-Based Data Access, Preserving Constraints with the Stable Chase, Bounds in ontology-based data access via circuit complexity, Finite model reasoning over existential rules, Answer Counting under Guarded TGDs, Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic, 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, The price of query rewriting in ontology-based data access, Disjunctive logic programs with existential quantification in rule heads, Combining decidability paradigms for existential rules, Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data, Unnamed Item, Semi-oblivious chase termination: the sticky case, Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints, Datalog: Bag Semantics via Set Semantics, Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis, Query answering over inconsistent knowledge bases: a probabilistic approach, Preference-based inconsistency-tolerant query answering under existential rules, Guarded Ontology-Mediated Queries, First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data complexity of query answering in description logics
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Data exchange: semantics and query answering
- On rules with existential variables: walking the decidability line
- Tractable query answering and rewriting under description logic constraints
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Modal languages and bounded fragments of predicate logic
- The expressive power of stratified logic programs with value invention
- Reasoning on UML class diagrams
- Open constraint programming
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- FDNC
- Efficient core computation in data exchange
- Data exchange: getting to the core
- The DL-Lite Family and Relations
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- Alternation
- Logical foundations of object-oriented and frame-based languages
- Querying the Guarded Fragment
- Linking Data to Ontologies
