On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width.
Pascal KoiranKlaus MeerPublished in: WG (2008)
Keyphrases
- expressive power
- cnf formula
- data complexity
- first order logic
- query language
- monadic second order logic
- computational properties
- relational algebra
- transitive closure
- maximum weight
- np complete
- relational calculus
- database
- constraint satisfaction
- information extraction
- max sat
- data model
- relational databases
- tree matching
- databases