Scalable formula decomposition for propositional satisfiability.
Anthony MonnetRoger VillemairePublished in: C3S2E (2010)
Keyphrases
- propositional satisfiability
- propositional formulas
- sat solvers
- conjunctive normal form
- propositional logic
- constraint programming
- solving hard
- automated reasoning
- sat problem
- industrial applications
- davis putnam
- sat instances
- boolean formula
- unit propagation
- max sat
- artificial intelligence
- combinatorial problems
- normal form
- orders of magnitude
- constraint satisfaction problems
- bayesian networks