Beyond unit propagation in SAT solving

Authors:
Michael Kaufmann;Stephan Kottler
Affiliations:
Wilhelm-Schickard-Institut für Informatik, University of Tübingen, Germany;Wilhelm-Schickard-Institut für Informatik, University of Tübingen, Germany
Venue:
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Year:
2011

Citing 20
Cited 0

Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Introduction to Algorithms

Introduction to Algorithms
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Enhancing Davis Putnam with extended binary clause reasoning

Eighteenth national conference on Artificial intelligence
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Using Rewriting Rules and Positive Equality to Formally Verify Wide-Issue Out-of-Order Microprocessors with a Reorder Buffer

Proceedings of the conference on Design, automation and test in Europe
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
On-the-Fly Clause Improvement

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Backdoors to typical case complexity

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Understanding the power of clause learning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A simplifier for propositional formulas with many binary clauses

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
On Modern Clause-Learning Satisfiability Solvers

Journal of Automated Reasoning
A generalized framework for conflict analysis

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Computation of renameable Horn backdoors

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Aligning CNF- and equivalence-reasoning

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
SAT solving with reference points

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The tremendous improvement in SAT solving has made SAT solvers a core engine for many real world applications. Though still being a branch-and-bound approach purposive engineering of the original algorithm has enhanced state-of-the-art solvers to tackle huge and difficult SAT instances. The bulk of solving time is spent on iteratively propagating variable assignments that are implied by decisions. In this paper we present two approaches on how to extend the broadly applied Unit Propagation technique where a variable assignment is implied iff a clause has all but one of its literals assigned to false. We propose efficient ways to utilize more reasoning in the main component of current SAT solvers so as to be less dependent on felicitous branching decisions.