BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting.
Mate SoosKuldeep S. MeelPublished in: AAAI (2019)
Keyphrases
- sat solvers
- model counting
- sat solving
- weighted model counting
- propositional satisfiability
- propositional formulas
- orders of magnitude
- sat problem
- knowledge compilation
- sat instances
- search tree
- search strategies
- constraint satisfaction
- boolean satisfiability
- max sat
- clause learning
- boolean formula
- search space
- polynomial size
- conjunctive normal form
- sat encodings
- search algorithm
- branch and bound algorithm