Abstract
Local hill-climbing algorithms to solve the satisfiability problem have shown to be more efficient than complete systematic methods in many aspects. Many variants and refinements have been developed in the last few years. We present a neural network approach to evaluate such local search algorithms in a parallel manner, i.e. enlarging the neighbourhood of each possible move in the search space. We present an approach which allows the simultaneous change of truth value assignment for more than one variable at a time, such that the theoretical properties of the considered algorithms are preserved, and give experimental evidence that this algorithm is indeed faster than the respective sequential variants.
This work was supported by DFG Grant HO 1294/3-3. The author is also affiliated with TH Darmstadt, FG Intellektik
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Emile Aarts and Jan Korst. Simulated Annealing and Boltzmann Machines. John Wiley & Sons, 1989.
N. Boissin and J. L. Lutton. A parallel simulated annealing algorithm. Parallel Computing, 19:859–872, 1993.
J. M. Crawford and L. D. Auton. Experimental results on the crossover point in satisfiability problems. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 21–27. MIT press, 1993.
I. P. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for SAT. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 28–33. MIT press, 1993.
J. Hertz, A. Krogh, and R. G. Palmer. Introduction to the Theory of Neural Computation. Addison-Wesley Publishing Company, 1991.
S. Hölldobler, H. Hoos, A. Strohmaier, and A. Weiß. The GSAT/SA-Familiy — Relating greedy satisifability testing to simulated annealing. Technical Report AIDA-94-17, TH Darmstadt, 1994.
J. J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. In Proceedings of the National Academy of Sciences USA, pages 2554–2558, 1982.
K. Konolige. Easy to be hard: difficult problems for greedy algorithms. In Proceedings of the International Conference on Principles of Knowlege Representation and Reasoning, pages 374–378, 1994.
G. Pinkas. The equivalence of energy minimization and propositional calculus satisfiability. Technical Report WUCS-90-03, Washington University, 1990.
B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the AAAI National Conference on Artificial Intelligence, volume 1, pages 337–343,1994.
B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 440–446. MIT press, 1992.
W. M. Spears. Simulated annealing for hard satisfiability problems. Technical report, Naval Research Laboratory, Washington D.C., 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Strohmaier, A. (1997). Multi-flip networks: Parallelizing genSAT. In: Brewka, G., Habel, C., Nebel, B. (eds) KI-97: Advances in Artificial Intelligence. KI 1997. Lecture Notes in Computer Science, vol 1303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540634932_28
Download citation
DOI: https://doi.org/10.1007/3540634932_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63493-5
Online ISBN: 978-3-540-69582-0
eBook Packages: Springer Book Archive