-XOR-CNF satisfiability.
Nadia CreignouHervé DaudéPublished in: RAIRO Theor. Informatics Appl. (2003)
Keyphrases
- cnf formula
- conjunctive normal form
- sat solving
- boolean formula
- satisfiability problem
- np complete
- sat problem
- sat instances
- clause learning
- stochastic local search
- sat solvers
- knowledge compilation
- phase transition
- polynomial size
- max sat
- propositional formulas
- data sets
- boolean satisfiability
- propositional satisfiability
- propositional logic
- search tree
- constraint satisfaction
- constraint satisfaction problems