Local Redundancy in SAT: Generalizations of Blocked Clauses.
Benjamin KieslMartina SeidlHans TompitsArmin BierePublished in: Log. Methods Comput. Sci. (2018)
Keyphrases
- boolean satisfiability
- sat solvers
- cnf formula
- unit propagation
- propositional formulas
- sat problem
- sat solving
- clause learning
- boolean formula
- max sat
- satisfiability problem
- symmetry breaking
- first order logic
- search space
- conjunctive normal form
- random sat instances
- sat instances
- random sat
- search algorithm
- max sat solver
- integer linear programming
- search tree
- phase transition
- orders of magnitude
- probabilistic planning
- branch and bound algorithm
- background knowledge
- horn clauses
- unsatisfiable cores
- randomly generated
- search strategies
- rough approximations
- davis putnam
- inference rules
- combinatorial problems
- stochastic local search
- multiple description coding