A Decidable Temporal DL-Lite Logic with Undecidable First-Order and Datalog-rewritability of Ontology-Mediated Atomic Queries (Extended Abstract).
Alessandro ArtaleAnton R. GnatenkoVladislav RyzhikovMichael ZakharyaschevPublished in: Description Logics (2023)
Keyphrases
- extended abstract
- unions of conjunctive queries
- dl lite
- description logics
- ontology based data access
- conjunctive queries
- query answering
- owl dl ontology
- guarded fragment
- computational properties
- knowledge base
- data complexity
- semantic web
- knowledge representation
- expressive power
- owl ontologies
- query rewriting
- integrity constraints
- query language
- data exchange
- model theoretic
- first order logic
- exptime complete
- query evaluation
- np complete
- query containment
- reasoning tasks
- answering queries
- probabilistic databases
- logic programming
- modal logic
- ontology languages
- polynomial hierarchy
- incomplete information
- combined complexity
- relational queries
- temporal reasoning
- computational complexity
- decision procedures
- conceptual modeling
- transitive closure
- data integration
- automated reasoning
- database