Trees and finite satisfiability: proof of a conjecture of Burgess.
George BoolosPublished in: Notre Dame J. Formal Log. (1984)
Keyphrases
- decision procedures
- decision trees
- satisfiability problem
- presburger arithmetic
- complete axiomatization
- computational complexity
- finite number
- phase transition
- theorem proving
- np complete
- propositional logic
- tree structure
- tree models
- labeled trees
- modal logic
- tree automata
- tree nodes
- constraint satisfaction problems