Ontology-Mediated Query Answering with Data-Tractable Description Logics
From MaRDI portal
(Redirected from Publication:2970310)
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
Cites work
- scientific article; zbMATH DE number 3557223 (Why is no real title available?)
- scientific article; zbMATH DE number 1249651 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 2207163 (Why is no real title available?)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- A propositional modal logic of time intervals
- A unified framework for non-standard reasoning services in description logics
- Answering regular path queries in expressive description logics via alternating tree-automata
- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
- Combining Horn rules and description logics in CARIN
- Complexities of Horn description logics
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- Computational Complexity
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Conjunctive query answering for the description logic SHIQ
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- Conjunctive query containment and answering under description logic constraints
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Data complexity of query answering in description logics
- Data complexity of query answering in expressive description logics via tableaux
- Datalog and Its Extensions for Semantic Web Databases
- Deciding inseparability and conservative extensions in the description logic
- Elements of finite model theory.
- Exponential lower bounds and separation for query rewriting
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Incomplete Information in Relational Databases
- Linking Data to Ontologies
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Many-dimensional modal logics: theory and applications
- Modular ontologies. Concepts, theories and techniques for knowledge modularization
- Modular reuse of ontologies: theory and practice
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
- On the succinctness of query rewriting over shallow ontologies
- Ontologies and Databases: The DL-Lite Approach
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Optimized query rewriting for OWL 2 QL
- Query Answering in Description Logics: The Knots Approach
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Query Rewriting and Optimization for Ontological Databases
- Query and predicate emptiness in ontology-based data access
- Query answering with DBoxes is hard
- Reasoning about explanations for negative query answers in \textit{DL-Lite}
- Reasoning and query answering in description logics
- Regular path queries in lightweight description logics: complexity and algorithms
- Regular queries on graph databases
- Relational and XML Data Exchange
- Relational queries computable in polynomial time
- Temporal query answering in the description logic DL-Lite
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- The DL-Lite Family and Relations
- The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
- The data complexity of ontology-mediated queries with closed predicates
- The price of query rewriting in ontology-based data access
- Tractable query answering and rewriting under description logic constraints
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Tree-like queries in OWL 2 QL: succinctness and complexity results
- \(\mathcal{EL}\)-ifying ontologies
Cited in
(33)- 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
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- The data complexity of ontology-mediated queries with closed predicates
- 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}\)
- Reasoning with ontologies
- Querying incomplete data: complexity and tractability via Datalog and first-order rewritings
- Exact learning of lightweight description logic ontologies
- Answer counting under guarded TGDs
- Temporal Minimal-World Query Answering over Sparse ABoxes
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
- scientific article; zbMATH DE number 7368419 (Why is no real title available?)
- SHACL validation in the presence of ontologies: semantics and rewriting techniques
- 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 semantics based on (preferred) repairs (invited paper)
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Propositional and predicate logics of incomplete information
- Pac learning of concept inclusions for ontology-mediated query answering
- 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
- Query answering in lattice-based description logic
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)
