Towards more expressive ontology languages: the query answering problem
From MaRDI portal
Publication:359987
Recommendations
- On the complexity of ontological reasoning under disjunctive existential rules
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Ontology querying: Datalog strikes back
- Query answering over description logic ontologies
- Data complexity of query answering in description logics
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3723857 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Alternation
- Data complexity of query answering in description logics
- Data exchange: getting to the core
- Data exchange: semantics and query answering
- Efficient core computation in data exchange
- FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
- Linking Data to Ontologies
- Logical foundations of object-oriented and frame-based languages
- Modal languages and bounded fragments of predicate logic
- On rules with existential variables: walking the decidability line
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Open constraint programming
- Querying the Guarded Fragment
- Reasoning on UML class diagrams
- Testing containment of conjunctive queries under functional and inclusion dependencies
- The DL-Lite Family and Relations
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- The expressive power of stratified logic programs with value invention
- Tractable query answering and rewriting under description logic constraints
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
Cited in
(38)- Preserving constraints with the stable chase
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- scientific article; zbMATH DE number 7561477 (Why is no real title available?)
- Datalog: Bag Semantics via Set Semantics
- Ontology querying: Datalog strikes back
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- The price of query rewriting in ontology-based data access
- Circuit complexity meets ontology-based data access
- Efficiently Querying RDF(S) Ontologies with Answer Set Programming
- scientific article; zbMATH DE number 6378879 (Why is no real title available?)
- scientific article; zbMATH DE number 912319 (Why is no real title available?)
- Disjunctive logic programs with existential quantification in rule heads
- Recent advances in Datalog\(^\pm \)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
- Combining decidability paradigms for existential rules
- Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
- Fast query answering over existential rules
- Semi-oblivious chase termination: the sticky case
- A tetrachotomy of ontology-mediated queries with a covering axiom
- On the complexity of ontological reasoning under disjunctive existential rules
- Answer Counting under Guarded TGDs
- Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
- Loop restricted existential rules and first-order rewritability for query answering
- Guarded Ontology-Mediated Queries
- Mixing materialization and query rewriting for existential rules
- PAGOdA: Pay-As-You-Go Ontology Query Answering Using a Datalog Reasoner
- Bounds in ontology-based data access via circuit complexity
- Reasoning on anonymity in Datalog
- Uniform Restricted Chase Termination
- On the interaction of existential rules and equality constraints in ontology querying
- Query answering over inconsistent knowledge bases: a probabilistic approach
- Explanation-friendly query answering under uncertainty
- Preference-based inconsistency-tolerant query answering under existential rules
- Semantic acyclicity for conjunctive queries: approximations and constraints
- Inconsistency-tolerant query answering for existential rules
- Logic, languages, and rules for web data extraction and reasoning over data
- Finite model reasoning over existential rules
- Tractable reasoning in description logics with functionality constraints
This page was built for publication: Towards more expressive ontology languages: the query answering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359987)
