On CNF Conversion for SAT Enumeration.
Gabriele MasinaGiuseppe SpallittaRoberto SebastianiPublished in: CoRR (2023)
Keyphrases
- sat solvers
- sat solving
- search space
- propositional satisfiability
- sat problem
- model counting
- sat instances
- boolean satisfiability
- cnf formula
- stochastic local search
- orders of magnitude
- conjunctive normal form
- max sat
- satisfiability problem
- boolean formula
- search tree
- clause learning
- np complete
- boolean functions
- automated reasoning
- knowledge compilation
- weighted model counting
- randomly generated
- search strategies
- heuristic search
- phase transition
- constraint satisfaction
- satisfiability testing
- constraint satisfaction problems
- computational properties
- propositional logic
- symmetry breaking
- search strategy
- constraint programming
- sat encodings
- backtracking search
- logic programs