When boolean satisfiability meets gaussian elimination in a simplex way

Authors:
Cheng-Shen Han;Jie-Hong Roland Jiang
Affiliations:
Department of Electrical Engineering / Graduate Institute of Electronics Engineering, National Taiwan University, Taipei, Taiwan;Department of Electrical Engineering / Graduate Institute of Electronics Engineering, National Taiwan University, Taipei, Taiwan
Venue:
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Year:
2012

Citing 18
Cited 0

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
Logical Cryptanalysis as a SAT Problem

Journal of Automated Reasoning
The Taming of the (X)OR

CL '00 Proceedings of the First International Conference on Computational Logic
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
An interpolating theorem prover

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Improvements to combinational equivalence checking

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Extending SAT Solvers to Cryptographic Problems

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Model counting: a new strategy for obtaining good bounds

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
To SAT or Not to SAT: Scalable Exploration of Functional Dependency

IEEE Transactions on Computers
Efficient generation of craig interpolants in satisfiability modulo theories

ACM Transactions on Computational Logic (TOCL)
Extending Clause Learning DPLL with Parity Reasoning

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Equivalence Class Based Parity Reasoning with DPLL(XOR)

ICTAI '11 Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence
Towards completely automatic decoder synthesis

Proceedings of the International Conference on Computer-Aided Design
A combination method for generating interpolants

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent research on Boolean satisfiability (SAT) reveals modern solvers' inability to handle formulae in the abundance of parity (xor) constraints. Although xor-handling in SAT solving has attracted much attention, challenges remain to completely deduce xor-inferred implications and conflicts, to effectively reduce expensive overhead, and to directly generate compact interpolants. This paper integrates SAT solving tightly with Gaussian elimination in the style of Dantzig's simplex method. It yields a powerful tool overcoming these challenges. Experiments show promising performance improvements and efficient derivation of compact interpolants, which are otherwise unobtainable.