Tractability Beyond β-Acyclicity for Conjunctive Queries with Negation.
Matthias LanzingerPublished in: CoRR (2020)
Keyphrases
- conjunctive queries
- containment of conjunctive queries
- np complete
- query answering
- bounded treewidth
- datalog programs
- data exchange
- query containment
- null values
- data complexity
- integrity constraints
- query rewriting
- data integration
- logic programming
- decision procedures
- query language
- computational complexity
- deductive databases
- query evaluation
- incomplete information
- constraint satisfaction
- np hard
- special case
- satisfiability problem
- probabilistic databases
- logic programs
- answering queries
- unions of conjunctive queries
- constraint satisfaction problems
- boolean expressions
- queries using views
- relational algebra
- databases
- data management
- tuple generating dependencies
- normal form
- dl lite
- schema mappings
- data model
- knowledge base