March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver

Heule, Marijn J. H.; Dufour, Mark; Zwieten, Joris van; Maaren, Hans van

doi:10.1007/11527695_26

Cited by 46 publications

(33 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Computing NHBR(F, l) using l as dominator was proposed in [16], while [2] discusses the use of alternative dominators. It should be noted that the above-defined construction algorithm is very similar to the one proposed in [1].…”

Section: Capturing Non-transitive Hbrmentioning

confidence: 99%

“…Tree-based lookahead originates from [3] but has not been properly described in the literature yet. It is a technique to reduce the computational cost to find failed literals and non-transitive hyper binary resolvents by reusing propagations.…”

Section: Tree-based Lookaheadmentioning

confidence: 99%

“…As the main practical contribution, we show how this variant of HBR can be realized efficiently using so called tree-based lookahead [3]. In fact, the tree-based lookahead algorithm described in this work is a substantially simplified version of the original idea, and is also of independent interest due to its much more general applicability for instance within CDCL SAT solvers.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Revisiting Hyper Binary Resolution

Heule

Järvisalo

Biere

2013

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

View full text Add to dashboard Cite

Abstract. This paper focuses on developing efficient inference techniques for improving conjunctive normal form (CNF) Boolean satisfiability (SAT) solvers. We analyze a variant of hyper binary resolution from various perspectives: We show that it can simulate the circuit-level technique of structural hashing and how it can be realized efficiently using so called tree-based lookahead. Experiments show that our implementation improves the performance of state-of-the-art CNFlevel SAT techniques on combinational equivalent checking instances.

show abstract

Section: Capturing Non-transitive Hbrmentioning

confidence: 99%

Section: Tree-based Lookaheadmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Revisiting Hyper Binary Resolution

Heule

Järvisalo

Biere

2013

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

View full text Add to dashboard Cite

show abstract

“…The SAT solvers used in the comparative study were SymChaff, zChaff version 2003.11.04 [40], and March-eq-100 [28]. Symmetry breaking predicates (SBPs) were generated using Shatter version 0.3 [1], which uses the graph isomorphism tool Saucy [11].…”

Section: Benchmarks and Empirical Evaluationmentioning

confidence: 99%

“…researchers working towards a better understanding of SAT, it is not surprising that many competing SAT solvers have come into light, such as Grasp [38], Relsat [5], SATO [58], zChaff [40], Berkmin [25], March-eq [28], and MiniSat [16].…”

mentioning

confidence: 99%

SymChaff: exploiting symmetry in a structure-aware satisfiability solver

Sabharwal

2008

Constraints

View full text Add to dashboard Cite

This article presents a new low-overhead framework for representing and utilizing problem symmetry in propositional satisfiability algorithms. While many previous approaches have focused on symmetry extraction as a key component, the novelty in the proposed strategy lies in using high level problem description to pass on symmetry information to the SAT solver in a simple and concise form, in addition to the usual CNF formula. This information, comprising of the so-called symmetry sets and variable classes, captures variable semantics relevant to "complete multi-class symmetry" and is utilized dynamically to prune the search space. This allows us to address many limitations of alternative approaches like symmetry breaking predicates, implicit pseudo-Boolean representations, general group-theoretic methods, and ZBDDs. We demonstrate the efficacy of our technique through a solver called SymChaff, which achieves exponential speedup over DPLL-based SAT solvers on problems from both theory and practice, often by simply using natural tags or annotation in the problem specification.

show abstract

Aligning CNF- and Equivalence-Reasoning

Heule

Maaren

2005

Theory and Applications of Satisfiability Testing

Self Cite

View full text Add to dashboard Cite

Abstract. Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translation to CNF. Probably the best known example of this is the parity-family. Large instances of such CNF formulas cannot be solved in reasonable time if no detection of, and extra reasoning with, these clauses is incorporated. That is, in solving these formulas, there is a more or less separate algorithmic device dealing with the equivalence clauses, called equivalence reasoning, and another dealing with the remaining clauses. In this paper we propose a way to align these two reasoning devices by introducing parameters for which we establish optimal values over a variety of existing benchmarks. We obtain a truly convincing speed-up in solving such formulas with respect to the best solving methods existing so far.

show abstract

March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver

Cited by 46 publications

References 10 publications

Revisiting Hyper Binary Resolution

Revisiting Hyper Binary Resolution

SymChaff: exploiting symmetry in a structure-aware satisfiability solver

Aligning CNF- and Equivalence-Reasoning

Contact Info

Product

Resources

About