On CNF Conversion for Disjoint SAT Enumeration.
Gabriele MasinaGiuseppe SpallittaRoberto SebastianiPublished in: SAT (2023)
Keyphrases
- sat solvers
- sat solving
- propositional satisfiability
- search space
- sat problem
- sat instances
- model counting
- conjunctive normal form
- boolean satisfiability
- cnf formula
- max sat
- satisfiability problem
- stochastic local search
- orders of magnitude
- boolean formula
- search strategies
- constraint satisfaction
- clause learning
- weighted model counting
- pairwise
- propositional logic
- np complete
- constraint satisfaction problems
- randomly generated
- boolean functions
- search tree
- knowledge compilation
- phase transition
- propositional formulas
- constraint programming
- polynomial size
- sat encodings
- dynamic programming
- satisfiability testing
- relational databases
- search strategy
- metaheuristic
- unit propagation