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

Authors:
Hans van Maaren;Joost P. Warners
Affiliations:
Department of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Mekelweg 4, 2628 CD Delft, The Netherlands E-mail:;KPN Research E-mail:
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2003

Citing 10
Cited 1

Semidefinite programming

SIAM Review
Experimental results on the crossover point in random 3-SAT

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Elliptic approximations of propositional formulae

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
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
Solving satisfiability problems using elliptic approximations - effective branching rules

Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Relaxations of the Satisfiability Problem Using Semidefinite Programming

Journal of Automated Reasoning
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
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

Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note we propose to use the volume of elliptic approximations of satisfiability problems as a measure for computing weighting coefficients of clauses of different lengths. For random 3-SAT formula it is confirmed experimentally that, when applied in a DPLL algorithm with a branching strategy that is based on the ellipsoids as well, the weight deduced yields better results than the weights that are used in previous studies.