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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Böhm and E. Speckenmeyer, A fast parallel SAT-solver - efficient workload balancing, Annals of Mathematics and Artificial Intelligence 17 (1996) 381–400.
S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971) pp. 151–158.
J.M. Crawford, Solving satisfiability problems using a combination of systematic and local search, Extended abstract, presented at Second DIMACS Challenge, Rutgers University, NJ (1993).
J.M. Crawford and L.D. Auton, Experimental results on the crossover point in random 3-SAT, Artificial Intelligence (1996) 81.
M. Davis, M. Logemann and D. Loveland, A machine program for theorem proving, Communications of the ACM 5 (1962) 394–397.
M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7 (1960) 210–215.
E. de Klerk, H. van Maaren and J.P. Warners, Relaxations of the satisfiability problem using semidefinite programming, Journal of Automated Reasoning 24 (2000) 37–65.
D. Du, J. Gu and P.M. Pardalos (eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 35 (American Mathematical Society, 1997).
O. Dubois, P. Andre, Y. Boufkhad and J. Carlier, SAT versus UNSAT, in: [13], pp. 415–436.
J. Gu, P.W. Purdom, J. Franco and B.W. Wah, Algorithms for the satisfiability (SAT) problem: a survey, in: [8], pp. 9–151.
J.N. Hooker and V. Vinay, Branching rules for satisfiability, Journal of Automated Reasoning 15(3) (1995) 359–383.
R.G. Jeroslow and J. Wang, Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence 1 (1990) 167–187.
D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in DiscreteMathematics and Computer Science, Vol. 26 (American Mathematical Society, 1996).
L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Review 38 (1996) 49–95.
A. van Gelder and Y.K. Tsuji, Satisfiability testing with more reasoning and less guessing, in: [13], pp. 559–586.
H. van Maaren, On the use of second order derivatives for the satisfiability problem, in [8], pp. 677–687.
H. van Maaren, Elliptic approximations of propositional formulae, Discrete Applied Mathematics 96-97 (1999) 223–244.
J.P. Warners and H. van Maaren, A two phase algorithm for solving a class of hard satisfiability problems, Operations Research Letters 23 (1998) 81–88.
J.P. Warners and H. van Maaren, Recognition of tractable satisfiability problems trough balanced polynomial representations, Discrete Applied Mathematics 99 (2000) 229–244.
J.P.Warners and H. van Maaren, Solving satisfiability problems using elliptic approximations - effective branching rules, Discrete Applied Mathematics 107 (2000) pp. 241–259.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
van Maaren, H., Warners, J.P. Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights. Annals of Mathematics and Artificial Intelligence 37, 273–283 (2003). https://doi.org/10.1023/A:1021200130191
Issue Date:
DOI: https://doi.org/10.1023/A:1021200130191