Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/solving-satisfiability-problems-using-elliptic-approximations-a-note-Osck8mMntR
References (20)
-
Max Böhm, Ewald Speckenmeyer (1996)
A fast parallel SAT-solver — efficient workload balancingAnnals of Mathematics and Artificial Intelligence, 17
-
J. Warners, H. Maaren (2000)
Solving satisfiability problems using elliptic approximations - effective branching rulesDiscret. Appl. Math., 107
-
H. Maaren (1999)
Elliptic Approximations of Propositional FormulaeDiscret. Appl. Math., 96-97
-
Martin Davis, G. Logemann, D. Loveland (2011)
A machine program for theorem-provingCommun. ACM, 5
-
(1993)
Solving satisfiability problems using a combination of systematic and local search -
R. Jeroslow, Jinchang Wang (1990)
Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1
-
J. Warners, H. vanMaaren (1998)
A two phase algorithm for solving a class of hard satissfiability problems -
(2000)
Warners, Relaxations of the satisfiability problem using semidefinite programming -
A. Gelder, Yumi Tsuji (1995)
Satisfiability testing with more reasoning and less guessing -
(1999)
Centrum voor Wiskunde en Informatica REPORTRAPPORT Report SEN-R9903 -
Martin Davis, H. Putnam (1960)
A Computing Procedure for Quantification TheoryJ. ACM, 7
-
H. Maaren (1996)
On the use of second order derivatives for the satisfiability problem -
L. Vandenberghe, Stephen Boyd (1996)
Semidefinite ProgrammingSIAM Rev., 38
-
J. Gu, P. Purdom, J. Franco, B. Wah (1996)
Algorithms for the satisfiability (SAT) problem: A survey -
S. Cook (1971)
The complexity of theorem-proving proceduresProceedings of the third annual ACM symposium on Theory of computing
-
O. Dubois, Pascal André, Yacine Boufkhad, J. Carlier (1993)
SAT versus UNSAT -
J. Warners, H. Maaren (2000)
Recognition of Tractable Satisfiability Problems through Balanced Polynomial RepresentationsDiscret. Appl. Math., 99
-
J. Hooker, V. Vinay (1995)
Branching rules for satisfiabilityJournal of Automated Reasoning, 15
-
J. Crawford, Larry Auton (1996)
Experimental Results on the Crossover Point in Random 3-SATArtif. Intell., 81
-
J.M. Crawford (1993)
Second DIMACS Challenge
- Publisher
- Springer Journals
- Copyright
- Copyright © 2003 by Kluwer Academic Publishers
- Subject
- Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Complex Systems
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1023/A:1021200130191
- Publisher site
- See Article on Publisher Site
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.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 10, 2004