Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Technical Report).
Christian AlrabbaaStefan BorgwardtPatrick KoopmannAlisa KovtunovaPublished in: CoRR (2022)
Keyphrases
- lightweight
- conjunctive queries
- technical report
- dl lite
- decision procedures
- query answering
- query evaluation
- queries using views
- integrity constraints
- np complete
- data complexity
- query language
- query rewriting
- special case
- description logics
- complexity of query answering
- data exchange
- query answers
- boolean expressions
- probabilistic databases
- query containment
- bounded treewidth
- semantic web
- ontology languages
- wireless sensor networks
- unions of conjunctive queries
- containment of conjunctive queries
- knowledge base
- conjunctive query containment
- theorem proving
- xml data
- data model
- data mining
- regular path queries
- deductive databases
- incomplete information
- conp complete
- data management
- query processing
- conjunctive regular path queries