The pebbling comonad in finite model theory.
Samson AbramskyAnuj DawarPengming WangPublished in: CoRR (2017)
Keyphrases
- finite model theory
- clause learning
- database theory
- sat solvers
- satisfiability problem
- open problems
- propositional satisfiability
- databases
- sat problem
- orders of magnitude
- normal form
- answer sets
- np complete
- conjunctive queries
- phase transition
- constraint satisfaction
- data management
- knowledge representation
- search space
- information retrieval
- database