Abstract
In this work we address the question of whether and how parallel local search exhibits the criticality and parallelism phenomenon when performed on structured instances. We experimentally show that also for structured instances there exists an optimal value of parallelism which enables the algorithm to reach the optimal performance and, by analyzing the frequency of node degree of the graphs associated with the SAT instances, we observe that an asymmetric and not regular distribution strongly affects the algorithm performance with respect to the parallelism.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I. P. Gent, H. H. Hoos, P. Prosser, and T. Walsh. Morphing: Combining structure and randomness. In Proceedings of AAAI99, pages 654–660, 1999.
H. Hoos and T. Stützle. SATLIB: An online resource for research on SAT. In I. Gent, H. van Maaren, and T. Walsh, editors, SAT2000: Highlights of Satisfiability Research in the Year 2000, pages 283–292. IOS Press, 2000.
S. A. Kauffman and W. Macready. Technological evolution and adaptive organizations. Complexity, 26(2):26–43, March 1995.
W. G. Macready and S.A. Kauffman A. G. Siapas. Criticality and parallelism in combinatorial optimization. Science, 271:56–59, January 1996.
A. Roli. Criticality and parallelism in GSAT. Electronic Notes in Discrete Mathematics, 9, 2001.
A. Roli and C. Blum. Critical Parallelization of Local Search for MAX-SAT. In AI*IA2001: Advances in Artificial Intelligence, volume 2175 of Lecture Notes in Artificial Intelligence, pages 147–158. Springer, 2001.
B. Selman, H. J. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440–446, 1992.
T. Walsh. Search in a small world. In proceedings of IJCAI99, pages 1172–1177, 1999.
T. Walsh. Search on high degree graphs. In Proceedings of IJCAI-2001, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roli, A. (2002). Criticality and Parallelism in Structured SAT Instances. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_51
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive