Solving satisfiability problems using elliptic approximations - effective branching rules

Authors:
Joost P. Warners;Hans van Maaren
Affiliations:
-;-
Venue:
Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Year:
2000

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

Annals of Mathematics and Artificial Intelligence
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets

Discrete Applied Mathematics - The renesse issue on satisfiability
The SAT2002 Competition

Annals of Mathematics and Artificial Intelligence
A SAT Approach to Query Optimization in Mediator Systems

Annals of Mathematics and Artificial Intelligence
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

Hi-index	0.00