Complexity of Default Logic on Generalized Conjunctive Queries.
Philippe ChapdelaineMiki HermannIlka SchnoorPublished in: LPNMR (2007)
Keyphrases
- conjunctive queries
- default logic
- conjunctive query containment
- query answering
- np complete
- default theories
- query evaluation
- conjunctive regular path queries
- conp complete
- nonmonotonic reasoning
- data complexity
- logic programming
- nonmonotonic logics
- query language
- integrity constraints
- default reasoning
- modal logic
- bounded treewidth
- decision procedures
- data exchange
- default rules
- query rewriting
- autoepistemic logic
- special case
- query containment
- fixed point
- programming language
- computational complexity
- hypertree decomposition
- np hard