Efficient CNF simplification based on binary implication graphs

Authors:
Marijn J. H. Heule;Matti Järvisalo;Armin Biere
Affiliations:
Department of Software Technology, Delft University of Technology, The Netherlands;Department of Computer Science, University of Helsinki, Finland;Institute for Formal Models and Verification, Johannes Kepler University Linz, Austria
Venue:
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Year:
2011

Citing 13
Cited 8

The Propositional Formula Checker HeerHugo

Journal of Automated Reasoning
Simplifying Binary Propositional Theories into Connected Components Twice as Fast

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Algebraic Simplification Techniques for Propositional Satisfiability

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Integrating Equivalency Reasoning into Davis-Putnam Procedure

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Enhancing Davis Putnam with extended binary clause reasoning

Eighteenth national conference on Artificial intelligence
Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver

Annals of Mathematics and Artificial Intelligence
Alembic: an efficient algorithm for CNF preprocessing

Proceedings of the 44th annual Design Automation Conference
iProver --- An Instantiation-Based Theorem Prover for First-Order Logic (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Clause elimination procedures for CNF formulas

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Effective preprocessing in SAT through variable and clause elimination

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Cost-effective hyper-resolution for preprocessing CNF formulas

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
A simplifier for propositional formulas with many binary clauses

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Finding kernels or solving SAT

Journal of Discrete Algorithms
Coprocessor 2.0: a flexible CNF simplifier

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Augmenting clause learning with implied literals

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
Formula preprocessing in MUS extraction

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems

Journal of Artificial Intelligence Research
Soundness of inprocessing in clause sharing SAT solvers

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Abstract satisfaction

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper develops techniques for efficiently detecting redundancies inCNF formulas. We introduce the concept of hidden literals, resulting in the novel technique of hidden literal elimination. We develop a practical simplification algorithmthat enables "Unhiding" various redundancies in a unified framework. Based on time stamping literals in the binary implication graph, the algorithmapplies various binary clause based simplifications, including techniques that, when run repeatedly until fixpoint, can be too costly. Unhiding can also be applied during search, taking learnt clauses into account. We show that Unhiding gives performance improvements on real-world SAT competition benchmarks.