Ontology-Mediated Query Answering with Data-Tractable Description Logics
From MaRDI portal
Publication:2970310
DOI10.1007/978-3-319-21768-0_9zbMATH Open1358.68086OpenAlexW2099367286MaRDI QIDQ2970310FDOQ2970310
Authors: 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
Recommendations
- Query answering over description logic ontologies
- scientific article; zbMATH DE number 7368419
- Ontological Query Answering over Semantic Data
- Ontology querying: Datalog strikes back
- Tractable query answering and rewriting under description logic constraints
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Reasoning and query answering in description logics
- The data complexity of ontology-mediated queries with closed predicates
Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Database theory (68P15) Logic in artificial intelligence (68T27)
Cites Work
- Modular ontologies. Concepts, theories and techniques for knowledge modularization
- Deciding inseparability and conservative extensions in the description logic
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Complexities of Horn description logics
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Modular reuse of ontologies: theory and practice
- The DL-Lite Family and Relations
- Incomplete Information in Relational Databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational Complexity
- Linking Data to Ontologies
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Many-dimensional modal logics: theory and applications
- A propositional modal logic of time intervals
- Title not available (Why is that?)
- Elements of finite model theory.
- \(\mathcal{EL}\)-ifying ontologies
- Data complexity of query answering in description logics
- Relational and XML Data Exchange
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Tractable query answering and rewriting under description logic constraints
- Title not available (Why is that?)
- Reasoning about explanations for negative query answers in \textit{DL-Lite}
- Ontologies and Databases: The DL-Lite Approach
- Conjunctive query containment and answering under description logic constraints
- Relational queries computable in polynomial time
- Combining Horn rules and description logics in CARIN
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Conjunctive query answering for the description logic SHIQ
- Query Answering in Description Logics: The Knots Approach
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- Data complexity of query answering in expressive description logics via tableaux
- Title not available (Why is that?)
- Title not available (Why is that?)
- Query answering with DBoxes is hard
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Query and predicate emptiness in ontology-based data access
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
- The price of query rewriting in ontology-based data access
- On the succinctness of query rewriting over shallow ontologies
- Query Rewriting and Optimization for Ontological Databases
- Answering regular path queries in expressive description logics via alternating tree-automata
- Reasoning and query answering in description logics
- The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
- Regular queries on graph databases
- The data complexity of ontology-mediated queries with closed predicates
- Temporal query answering in the description logic DL-Lite
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Regular path queries in lightweight description logics: complexity and algorithms
- Exponential lower bounds and separation for query rewriting
- Tree-like queries in OWL 2 QL: succinctness and complexity results
- Optimized query rewriting for OWL 2 QL
- A unified framework for non-standard reasoning services in description logics
- Datalog and Its Extensions for Semantic Web Databases
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
Cited In (27)
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Ontological query answering under many-valued group preferences in Datalog\(+/-\)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Fragments of Bag Relational Algebra: Expressiveness and Certain Answers
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- The data complexity of ontology-mediated queries with closed predicates
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Reasoning with ontologies
- Querying the unary negation fragment with regular path expressions
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- Exact learning of lightweight description logic ontologies
- Temporal Minimal-World Query Answering over Sparse ABoxes
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
- Title not available (Why is that?)
- Complexity and expressive power of ontology-mediated queries (invited talk)
- Answer Counting under Guarded TGDs
- Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Inconsistency- and error-tolerant reasoning w.r.t. optimal repairs of \(\mathcal{EL}^\bot\) ontologies
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Propositional and predicate logics of incomplete information
- Enhancing probabilistic model checking with ontologies
- When is ontology-mediated querying efficient?
- PAGOdA: Pay-As-You-Go Ontology Query Answering Using a Datalog Reasoner
- Classical algorithms for reasoning and explanation in description logics
- Ontology-mediated probabilistic model checking
Uses Software
This page was built for publication: Ontology-Mediated Query Answering with Data-Tractable Description Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970310)
