Data complexity of query answering in description logics
From MaRDI portal
Recommendations
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Rewriting Conjunctive Queries over Description Logic Knowledge Bases
- Query answering over description logic ontologies
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Tractable query answering and rewriting under description logic constraints
Cited in
(59)- Effective query answering with ontologies and DBoxes
- Conjunctive query answering for the description logic SHIQ
- On the scalability of description logic instance retrieval
- Foundations of Temporal Conceptual Data Models
- DL-Lite ontology revision based on an alternative semantic characterization
- Data complexity of query answering in expressive description logics via tableaux
- Linking Data to Ontologies
- Forgetting for knowledge bases in DL-lite
- Rewriting Conjunctive Queries over Description Logic Knowledge Bases
- Ontologies and Databases: The DL-Lite Approach
- Querying best paths in graph databases
- Tractable approximate deduction for OWL
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- Formal Properties of Modularisation
- Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
- A false sense of security
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
- DL-Lite with temporalised concepts, rigid axioms and roles
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- Regular path queries in lightweight description logics: complexity and algorithms
- The data complexity of ontology-mediated queries with closed predicates
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- View-based query answering in description logics: semantics and complexity
- Tractable query answering and rewriting under description logic constraints
- Query answering in circumscribed OWL2 profiles
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Query answering with DBoxes is hard
- Towards more expressive ontology languages: the query answering problem
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Instance-level update in DL-Lite ontologies through first-order rewriting
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
- Tree-like queries in OWL 2 QL: succinctness and complexity results
- Tractable reasoning in description logics with functionality constraints
- Games for query inseparability of description logic knowledge bases
- Query Answering in Description Logics: The Knots Approach
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Top-\(k\) retrieval for ontology mediated access to relational databases
- On the complexity of queries in the logical data model
- Tractability and intractability of controlled languages for data access
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Conceptual Modeling for Data Integration
- The data complexity of description logic ontologies
- Reasoning on anonymity in Datalog
- Reasoning in description logics by a reduction to disjunctive datalog
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Query rewriting under linear \(\mathcal {EL}\) knowledge bases
- Querying the unary negation fragment with regular path expressions
- Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
- Inseparability and conservative extensions of description logic ontologies: a survey
- Recent advances in Datalog\(^\pm \)
- Query answering over description logic ontologies
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Controlled query evaluation in description logics through consistent query answering
- Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures
- Temporal Minimal-World Query Answering over Sparse ABoxes
- Designing efficient controlled languages for ontologies
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
This page was built for publication: Data complexity of query answering in description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360130)
