On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators (Extended Abstract).
Alessandro ArtaleAnton R. GnatenkoVladislav RyzhikovMichael ZakharyaschevPublished in: Description Logics (2024)
Keyphrases
- extended abstract
- datalog queries
- data complexity
- query answering
- datalog programs
- conjunctive queries
- transitive closure
- expressive power
- query evaluation
- unions of conjunctive queries
- regular path queries
- data exchange
- answering queries
- query containment
- recursive queries
- integrity constraints
- np complete
- data integration
- temporal logic
- query language
- incomplete information
- cardinality constraints
- query rewriting
- decision procedures
- first order logic
- dl lite
- ontology languages
- model checking
- special case
- schema mappings
- knowledge representation
- database
- normal form
- data model