The pebbling comonad in Finite Model Theory.

Samson Abramsky Anuj Dawar Pengming Wang

Published in: LICS (2017)

Keyphrases

finite model theory
clause learning
database theory
sat solvers
satisfiability problem
open problems
databases
propositional satisfiability
sat problem
international conference
finitely representable
database
search space
answer sets