Ontology-Mediated Query Answering with Data-Tractable Description Logics
From MaRDI portal
Publication:2970310
DOI10.1007/978-3-319-21768-0_9zbMath1358.68086OpenAlexW2099367286MaRDI QIDQ2970310
Meghyn Bienvenu, Magdalena Ortiz
Publication date: 30 March 2017
Published in: Reasoning Web. Web Logic Rules (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21768-0_9
Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Related Items (16)
A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ Unnamed Item ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ Temporal Minimal-World Query Answering over Sparse ABoxes ⋮ Answer Counting under Guarded TGDs ⋮ Inconsistency-Tolerant Querying of Description Logic Knowledge Bases ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ Unnamed Item ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ Unnamed Item ⋮ Fragments of Bag Relational Algebra: Expressiveness and Certain Answers ⋮ Propositional and predicate logics of incomplete information ⋮ Enhancing probabilistic model checking with ontologies ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries ⋮ On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
Uses Software
Cites Work
- Data complexity of query answering in description logics
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Elements of finite model theory.
- Data complexity of query answering in expressive description logics via tableaux
- Tractable query answering and rewriting under description logic constraints
- Modular ontologies. Concepts, theories and techniques for knowledge modularization
- Deciding inseparability and conservative extensions in the description logic
- Combining Horn rules and description logics in CARIN
- Many-dimensional modal logics: theory and applications
- Answering regular path queries in expressive description logics via alternating tree-automata
- The price of query rewriting in ontology-based data access
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Query and Predicate Emptiness in Ontology-Based Data Access
- Query Answering with DBoxes is Hard
- Temporal Query Answering in the Description Logic DL-Lite
- Reasoning about Explanations for Negative Query Answers in DL-Lite
- The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases
- Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms
- Complexities of Horn Description Logics
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- A Unified Framework for Non-standard Reasoning Services in Description Logics
- Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend!
- Relational and XML Data Exchange
- Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases
- Exponential Lower Bounds and Separation for Query Rewriting
- $\mathcal{EL}$ -ifying Ontologies
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Query Answering in Description Logics: The Knots Approach
- Ontologies and Databases: The DL-Lite Approach
- The DL-Lite Family and Relations
- Relational queries computable in polynomial time
- Incomplete Information in Relational Databases
- A propositional modal logic of time intervals
- On the succinctness of query rewriting over shallow ontologies
- Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results
- Reasoning and Query Answering in Description Logics
- Datalog and Its Extensions for Semantic Web Databases
- Query Rewriting and Optimization for Ontological Databases
- Ontology-Based Data Access
- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
- Optimized Query Rewriting for OWL 2 QL
- Conjunctive query containment and answering under description logic constraints
- Computational Complexity
- Linking Data to Ontologies
- Regular Queries on Graph Databases.
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ontology-Mediated Query Answering with Data-Tractable Description Logics
