March_eq: implementing additional reasoning into an efficient look-ahead SAT solver

Authors:
Marijn Heule;Mark Dufour;Joris van Zwieten;Hans van Maaren
Affiliations:
Department of Information Systems and Algorithms, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology;Department of Information Systems and Algorithms, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology;Department of Information Systems and Algorithms, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology;Department of Information Systems and Algorithms, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology
Venue:
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Year:
2004

Citing 7
Cited 12

A machine program for theorem-proving

Communications of the ACM
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Equivalent literal propagation in the DLL procedure

Discrete Applied Mathematics - The renesse issue on satisfiability
The SAT2002 Competition

Annals of Mathematics and Artificial Intelligence
A backbone-search heuristic for efficient solving of hard 3-SAT formulae

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Hard and easy distributions of SAT problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
A two-phase algorithm for solving a class of hard satisfiability problemsfn1fn1Supported by the Dutch Organization for Scientific Research (NWO) under grant SION 612-33-001.

Operations Research Letters

The SAT-based Approach to Separation Logic

Journal of Automated Reasoning
Present and Future of Practical SAT Solving

Complexity of Constraints
Generation of hard non-clausal random satisfiability problems

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
SATzilla: portfolio-based algorithm selection for SAT

Journal of Artificial Intelligence Research
SymChaff: exploiting symmetry in a structure-aware satisfiability solver

Constraints
Extending Clause Learning DPLL with Parity Reasoning

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Partitioning SAT instances for distributed solving

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Algorithm selection and scheduling

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Instance-Specific algorithm configuration as a method for non-model-based portfolio generation

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Finding efficient circuits for ensemble computation

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Conflict-driven XOR-clause learning

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Classifying and propagating parity constraints

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses several techniques to make the look- ahead architecture for satisfiability (Sat) solvers more competitive. Our contribution consists of reduction of the computational costs to perform look-ahead and a cheap integration of both equivalence reasoning and local learning. Most proposed techniques are illustrated with experimental results of their implementation in our solver march_eq.