Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers

Authors:
Zhe Wu;Benjamin W. Wah
Affiliations:
-;-
Venue:
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Year:
1999

Citing 5
Cited 7

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems

Journal of Global Optimization
The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
The breakout method for escaping from local minima

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence

Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Proceedings of the 38th annual Design Automation Conference
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Journal of Symbolic Computation
Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems

Applied Soft Computing
Improving GASAT by replacing tabu search by DLM and enhancing the best members

Artificial Intelligence Review
Constraint metrics for local search

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
IslandSAT

International Journal of Advanced Intelligence Paradigms
A survey of the satisfiability-problems solving algorithms

International Journal of Advanced Intelligence Paradigms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present improved strategies in DLM-99-SAT to escape from traps and to select proper parameter sets to use when applied to solve some difficult but satisfiable SAT problems. One of the main issues in DLM-99-SAT is that it has a large number of tune-able parameters, making it difficult to determine the best parameters to use when given a new instance. To this end, we propose a set of performance metrics and a set of rules using these metrics that determine at run time the best parameters to use for a specific instance. Our experimental results show that these rules are able to select the most suitable parameter set for each instance with very little overhead. Finally, we verify the performance of DLM-99-SAT by solving some benchmarks in SATLIB and some of the most difficult but satisfiable DIMACS SAT problems, including par32-1-c to par32-4-c and hanoi4-simple.