A tetrachotomy of ontology-mediated queries with a covering axiom
From MaRDI portal
Publication:2152500
Cites work
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1142327 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- A Characterisation of First-Order Constraint Satisfaction Problems
- Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs
- An introduction to description logic
- Asking the Metaquestions in Constraint Tractability
- Checking the data complexity of ontology-mediated queries: a case study with non-uniform CSPs and Polyanna
- Classifying the Complexity of Constraints Using Finite Algebras
- Colouring, constraint satisfaction, and complexity
- Computational Complexity
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
- Homomorphism preservation theorems
- Implementing a test for tractability
- Linearisability on Datalog programs
- Linking Data to Ontologies
- Many-dimensional modal logics: theory and applications
- Minimizing function-free recursive inference rules
- Mutilated chessboard problem is exponentially hard for resolution
- On rules with existential variables: walking the decidability line
- On the complexity of single-rule datalog queries.
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
- PAGOdA: Pay-As-You-Go Ontology Query Answering Using a Datalog Reasoner
- PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE
- Parallel complexity of logical query programs
- Query Rewriting and Optimization for Ontological Databases
- Reasoning in description logics by a reduction to disjunctive datalog
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The DL-Lite Family and Relations
- The Description Logic Handbook
- The complexity of boundedness for guarded logics
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The complexity of satisfiability problems
- The parallel complexity of simple logic programs
- The polynomial-time hierarchy
- The price of query rewriting in ontology-based data access
- Towards more expressive ontology languages: the query answering problem
- Tractable query answering and rewriting under description logic constraints
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Undecidable boundedness problems for datalog programs
- Undecidable optimization problems for database logic programs
- \(\mathcal{EL}\)-ifying ontologies
Cited in
(2)
This page was built for publication: A tetrachotomy of ontology-mediated queries with a covering axiom
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152500)
