-acyclicity for conjunctive queries with negation and SAT.
Matthias LanzingerPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- conjunctive queries
- query answering
- containment of conjunctive queries
- datalog programs
- bounded treewidth
- data exchange
- np complete
- satisfiability problem
- null values
- data complexity
- sat problem
- integrity constraints
- query containment
- query evaluation
- sat solvers
- special case
- query rewriting
- incomplete information
- query language
- phase transition
- search algorithm
- deductive databases
- schema mappings
- decision procedures
- probabilistic databases
- data integration
- answering queries
- logic programs
- data management
- databases
- constraint satisfaction
- predicate logic
- boolean expressions
- conp complete
- relational databases
- conjunctive regular path queries