Inprocessing rules

Authors:
Matti Järvisalo;Marijn J. H. Heule;Armin Biere
Affiliations:
Department of Computer Science & HIIT, University of Helsinki, Finland;Department of Software Technology, Delft University of Technology, The Netherlands, Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria;Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria
Venue:
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Year:
2012

Citing 21
Cited 9

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
A proof engine approach to solving combinational design automation problems

Proceedings of the 39th annual Design Automation Conference
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
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Alembic: an efficient algorithm for CNF preprocessing

Proceedings of the 44th annual Design Automation Conference
Vivifying Propositional Clausal Formulae

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
On-the-Fly Clause Improvement

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
Learning for Dynamic Subsumption

ICTAI '09 Proceedings of the 2009 21st IEEE International Conference on Tools with Artificial Intelligence
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Extended clause learning

Artificial Intelligence
A Framework for Certified Boolean Branch-and-Bound Optimization

Journal of Automated Reasoning
Clause elimination procedures for CNF formulas

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Efficient CNF simplification based on binary implication graphs

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
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
Cost-effective hyper-resolution for preprocessing CNF formulas

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Reconstructing solutions after blocked clause elimination

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
On SAT modulo theories and optimization problems

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

On computing minimal equivalent subformulas

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Formula preprocessing in MUS extraction

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying refutations with extended resolution

CADE'13 Proceedings of the 24th international conference on Automated Deduction
Soundness of inprocessing in clause sharing SAT solvers

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Concurrent clause strengthening

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Factoring out assumptions to speed up MUS extraction

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Automated reencoding of boolean formulas

HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Mechanical verification of SAT refutations with extended resolution

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Knowledge compilation for model counting: affine decision trees

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Decision procedures for Boolean satisfiability (SAT), especially modern conflict-driven clause learning (CDCL) solvers, act routinely as core solving engines in various real-world applications. Preprocessing, i.e., applying formula rewriting/simplification rules to the input formula before the actual search for satisfiability, has become an essential part of the SAT solving tool chain. Further, some of the strongest SAT solvers today add more reasoning to search by interleaving formula simplification and CDCL search. Such inprocessing SAT solvers witness the fact that implementing additional deduction rules in CDCL solvers leverages the efficiency of state-of-the-art SAT solving further. In this paper we establish formal underpinnings of inprocessing SAT solving via an abstract inprocessing framework that covers a wide range of modern SAT solving techniques.