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.

Authors:
Joost P. Warners;Hans Van Maaren
Affiliations:
SEN2, CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology ...;Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands
Venue:
Operations Research Letters
Year:
1998

Citing 8
Cited 19

A new polynomial-time algorithm for linear programming

Combinatorica
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Recognition of tractable satisfiability problems through balanced polynomial representations

Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
A machine program for theorem-proving

Communications of the ACM
Global Optimization for Satisfiability (SAT) Problem

IEEE Transactions on Knowledge and Data Engineering
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Ten challenges in propositional reasoning and search

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1

Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights

Annals of Mathematics and Artificial Intelligence
Relaxations of the Satisfiability Problem Using Semidefinite Programming

Journal of Automated Reasoning
The Propositional Formula Checker HeerHugo

Journal of Automated Reasoning
Recovering and Exploiting Structural Knowledge from CNF Formulas

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The Taming of the (X)OR

CL '00 Proceedings of the First International Conference on Computational Logic
How to fake an RSA signature by encoding modular root finding as a SAT problem

Discrete Applied Mathematics - The renesse issue on satisfiability
Equivalent literal propagation in the DLL procedure

Discrete Applied Mathematics - The renesse issue on satisfiability
Security Parallels between People and Pervasive Devices

PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Efficient SAT solving: beyond supercubes

Proceedings of the 42nd annual Design Automation Conference
B-Cubing: New Possibilities for Efficient SAT-Solving

IEEE Transactions on Computers
Filter-based resolution principle for lattice-valued propositional logic LP(X)

Information Sciences: an International Journal
Protocols for RFID tag/reader authentication

Decision Support Systems
The state of SAT

Discrete Applied Mathematics
Variable dependency in local search: prevention Is better than cure

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Aligning CNF- and equivalence-reasoning

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
March_eq: implementing additional reasoning into an efficient look-ahead SAT solver

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Observed lower bounds for random 3-SAT phase transition density using linear programming

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
When boolean satisfiability meets gaussian elimination in a simplex way

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Automated reencoding of boolean formulas

HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The DIMACS suite of satisfiability (SAT) benchmarks contains a set of instances that are very hard for existing algorithms. These instances arise from learning the parity function on 32bits. In this paper we develop a two-phase algorithm that is capable of solving these instances. In the first phase, a polynomially solvable subproblem is identified and solved. Using the solution to this problem, we can considerably restrict the size of the search space in the second phase of the algorithm, which is an extension of the well-known Davis-Putnam-Logemann-Loveland algorithm. We conclude with reporting on our computational results on the parity instances.