Soundness of inprocessing in clause sharing SAT solvers

Authors:
Norbert Manthey;Tobias Philipp;Christoph Wernhard
Affiliations:
Knowledge Representation and Reasoning Group, Technische Universität Dresden, Germany;Knowledge Representation and Reasoning Group, Technische Universität Dresden, Germany;Knowledge Representation and Reasoning Group, Technische Universität Dresden, Germany
Venue:
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Year:
2013

Citing 30
Cited 0

PSATO: a distributed propositional prover and its application to quasigroup problems

Journal of Symbolic Computation - Special issue on parallel symbolic computation
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
On a generalization of extended resolution

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Journal of Automated Reasoning
Probing-Based Preprocessing Techniques for Propositional Satisfiability

ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver

Annals of Mathematics and Artificial Intelligence
Minimizing Learned Clauses

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
Predicting learnt clauses quality in modern SAT solvers

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Control-based clause sharing in parallel SAT solving

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Diversification and intensification in parallel SAT solving

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
On the power of clause-learning SAT solvers as resolution engines

Artificial Intelligence
Partitioning SAT instances for distributed solving

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
On freezing and reactivating learnt clauses

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Efficient CNF simplification based on binary implication graphs

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Empirical study of the anatomy of modern sat solvers

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Grid-based SAT solving with iterative partitioning and clause learning

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Effective preprocessing in SAT through variable and clause elimination

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Blocked clause elimination

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An overview of parallel SAT solving

Constraints
Revisiting clause exchange in parallel SAT solving

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Designing scalable parallel SAT solvers

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Coprocessor 2.0: a flexible CNF simplifier

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Inprocessing rules

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Solving periodic event scheduling problems with SAT

IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Cube and conquer: guiding CDCL SAT solvers by lookaheads

HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a formalism that models the computation of clause sharing portfolio solvers with inprocessing. The soundness of these solvers is not a straightforward property since shared clauses can make a formula unsatisfiable. Therefore, we develop characterizations of simplification techniques and suggest various settings how clause sharing and inprocessing can be combined. Our formalization models most of the recent implemented portfolio systems and we indicate possibilities to improve these. A particular improvement is a novel way to combine clause addition techniques --- like blocked clause addition --- with clause deletion techniques --- like blocked clause elimination or variable elimination.