Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing.
Tobias PhilippPublished in: GCAI (2016)
Keyphrases
- sat solvers
- clause learning
- max sat
- unit propagation
- orders of magnitude
- cnf formula
- search space
- theorem prover
- sat solving
- boolean formula
- sat problem
- search strategies
- search tree
- constraint satisfaction
- propositional satisfiability
- boolean satisfiability
- sat instances
- data structure
- constraint solver
- theorem proving
- graph coloring
- answer sets
- satisfiability problem
- heuristic search
- first order logic