Local Redundancy in SAT: Generalizations of Blocked Clauses.
Benjamin KieslMartina SeidlHans TompitsArmin BierePublished in: CoRR (2017)
Keyphrases
- boolean satisfiability
- sat solvers
- sat problem
- boolean formula
- cnf formula
- propositional formulas
- clause learning
- sat solving
- unit propagation
- first order logic
- satisfiability problem
- random sat instances
- random sat
- search space
- randomly generated
- conjunctive normal form
- max sat
- search algorithm
- integer linear programming
- phase transition
- branch and bound algorithm
- symmetry breaking
- constraint satisfaction problems
- probabilistic planning
- multiple description coding
- np complete
- truth assignment
- stochastic local search algorithms
- search strategies
- propositional satisfiability
- background knowledge
- combinatorial problems
- branch and bound
- propositional logic
- boolean variables
- horn clauses
- davis putnam logemann loveland