scientific article; zbMATH DE number 7104931
From MaRDI portal
Publication:5232905
Frank Wolter, İnanç Seylan, Carsten Lutz
Publication date: 13 September 2019
Full work available at URL: https://arxiv.org/abs/1809.00134
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Related Items (5)
A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ Fragments of Bag Relational Algebra: Expressiveness and Certain Answers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Games for query inseparability of description logic knowledge bases
- Data complexity of query answering in description logics
- The complexity of surjective homomorphism problems-a survey
- An algebraic hardness criterion for surjective constraint satisfaction.
- Data exchange and schema mappings in open and closed worlds
- Deciding expressive description logics in the framework of resolution
- Data complexity of query answering in expressive description logics via tableaux
- Deciding inseparability and conservative extensions in the description logic
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Query Answering with DBoxes is Hard
- Beth Definability in Expressive Description Logics
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- An Introduction to Description Logic
- Relational and XML Data Exchange
- Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Reconciling description logics and rules
- Tree Dualities for Constraint Satisfaction
- The DL-Lite Family and Relations
- What should a database know?
- Querying Visible and Invisible Information
- Ontology-Based Data Access
- Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
- Monotone monadic SNP and constraint satisfaction
- Classifying the Complexity of Constraints Using Finite Algebras
- Linking Data to Ontologies
- Description logics of minimal knowledge and negation as failure
This page was built for publication:
