Abstract
LPPH has been proposed to solve the satisfiability problem (SAT). In order to solve the SAT more efficiently, a parallel execution has been proposed. Experimental results show that higher speedup ratio is obtained by using this parallel execution of the LPPH. In this paper, we propose a method of mixed parallel execution of several algorithms for the SAT. “Mixed” means the parallel execution of the LPPH and local search algorithms. In the experiments, we used the LPPH with attenuation coefficient generating function and the GSAT. Results of experiments show mixing these two algorithms yield excellent performance.
Chapter PDF
Similar content being viewed by others
Reference
M. Nagamatu and T. Yannaru, “On the stability of Lagrange programming neural networks of satisfiability problems of propositional calculus”, Neurocomputing, 13, 119–133, 1995.
M. Nagamatu and T. Yannaru, “Parallel state space search for SAT with Lagrange Programming Neural Network”, proceedings of the fifth International Conference on Neural Information Processing. October, 1998
K. Zhang and M. Nagamatu, “Parallel execution of neural networks for solving SAT” (to appear).
K. Zhang and M. Nagamatu, “Solving SAT by execution of neural network with probabilistic attenuation coefficient generator” (to appear)
B. Selman, H. Levesque and D. Mitchell, “A new method for solving hard satisfiability problem,” AAA-92, Proceedings Tenth National Conference on Artifical Intelligence, pp.440–6, 1992
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Zhang, K., Nagamatu, M. (2005). Mixed Parallel Execution of Algorithms for Satisfiability Problem. In: Shi, Z., He, Q. (eds) Intelligent Information Processing II. IIP 2004. IFIP International Federation for Information Processing, vol 163. Springer, Boston, MA. https://doi.org/10.1007/0-387-23152-8_35
Download citation
DOI: https://doi.org/10.1007/0-387-23152-8_35
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23151-8
Online ISBN: 978-0-387-23152-5
eBook Packages: Computer ScienceComputer Science (R0)