A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas

Authors:
Ramón Béjar;Felip Manyà
Affiliations:
-;-
Venue:
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Year:
1999

Citing 3
Cited 2

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Phase Transitions in the Regular Random 3-SAT Problem

ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Capturing Structure with Satisfiability

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Mapping problems with finite-domain variables to problems with boolean variables

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reports on a series of experiments performed with the aim of comparing the performance of Regular-DP and Regular-GSAT. Regular-DP is a Davis-Putnam-style procedure for solving the propositional satisfiability problem in regular CNF formulas (regular SAT). Regular-GSAT is a GSAT-style procedure for finding satisfying interpretations in regular CNF formulas. Our experimental results provide experimental evidence that Regular-GSAT outperforms Regular-DP on computationally difficult regular random 3-SAT instances, and suggest that local search methods can extend the range and size of satisfiability problems that can be efficiently solved in many-valued logics.