Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies.
Christian AlrabbaaStefan BorgwardtPatrick KoopmannAlisa KovtunovaPublished in: Description Logics (2022)
Keyphrases
- lightweight
- conjunctive queries
- dl lite
- decision procedures
- query answering
- queries using views
- integrity constraints
- query evaluation
- data complexity
- np complete
- query language
- data exchange
- query rewriting
- knowledge base
- unions of conjunctive queries
- probabilistic databases
- semantic web
- special case
- complexity of query answering
- containment of conjunctive queries
- boolean expressions
- description logics
- conjunctive regular path queries
- query containment
- query answers
- ontology languages
- np hard
- wireless sensor networks
- expressive power
- datalog programs
- knowledge representation
- xml data
- schema mappings
- answering queries using views
- bounded treewidth
- theorem proving
- natural language
- conp complete
- databases
- domain ontology