Choisir un encodage CNF de contraintes de cardinalité performant pour SAT(Choosing an efficient CNF encoding of cardinality constraints for SAT).
Thomas DelacroixPublished in: CNIA+RJCIA (2018)
Keyphrases
- sat solvers
- sat solving
- propositional satisfiability
- sat encodings
- sat problem
- sat instances
- cardinality constraints
- model counting
- conjunctive normal form
- satisfiability problem
- cnf formula
- max sat
- search space
- clause learning
- boolean formula
- constraint satisfaction
- constraint programming
- np complete
- search algorithm
- entity relationship
- boolean functions
- phase transition
- propositional formulas
- quantifier elimination
- knowledge compilation
- constraint satisfaction problems
- boolean algebra