Generalizing an Exactly-1 SAT Solver for Arbitrary Numbers of Variables, Clauses, and K.
Francesco PiroMehrnoosh AskarpourElisabetta Di NittoPublished in: Q-SET@QCE (2020)
Keyphrases
- boolean formula
- sat solvers
- boolean variables
- boolean satisfiability
- clause learning
- orders of magnitude
- clause learning sat solvers
- sat problem
- unsatisfiable cores
- search space
- np complete
- conjunctive normal form
- max sat
- propositional satisfiability
- sat solving
- practical problems
- propositional formulas
- sat instances
- constraint satisfaction
- linear constraints
- search tree
- binary decision diagrams
- propositional theories
- membership queries
- max sat solver
- random sat instances
- search strategies
- sat encodings
- constraint solver
- heuristic search
- constraint satisfaction problems
- upper bound