Abstract
To date, several types of structure for finite Constraint Satisfaction Problems have been investigated with the goal of either improving the performance of problem solvers or allowing efficient problem solvers to be identified. Our aim is to extend the work in this area by performing a structural analysis in terms of variable connectivity for 3-SAT problems. Initially structure is defined in terms of the compactness of variable connectivity for a problem. Using an easily calculable statistic developed to measure this compactness, a test was then created for identifying 3-SAT problems as either compact, loose or unstructured (or uniform). A problem generator was constructed for generating 3-SAT problems with varying degrees of structure. Using problems from this problem generator and existing problems from SATLIB, we investigated the effects of this type of structure on satisfiability and solvability of 3-SAT problems. For the same problem length, it is demonstrated that satisfiability and solvability are different for structured and uniform problems generated by the problem generator.
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
Gent I.P., MacIntyre E., Prosser P., Smith B.M., and Walsh T. Random Constraints Satisfaction: flaws and structure. Constraints 2001, Vol.6: 345–372.
Walsh T. Search on High Degree Graphs. Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI’01) 2001; 266–274.
Aloul F.A., Ramani A., Markov I.L., Sakallah K.A. Solving difficult SAT instances in the presence of symmetry.Proceedings of Design Automation Conference, University of Michigan, 2002.
Beckwith A.B., Choueiry B.Y., H. Zou. How the level of interchangeability embedded in a finite constraint satisfaction problem affects the perfomance of search. Proceedings of the 14th Australian Joint Conference on Artificial Intelligence (AI 2001) 2001; 50–61.
Walsh T. Search in a small world. Proceedings of the 16th International Joint Conference on Artificial Intelligence 1999; 1172–1176.
Kautz H., Ruan Y., Achlioptas D., Gomes C., Selman B., Stickel M. Balance and filtering in structured satisfiable problems. Proceedings of the 17th International Joint Conference on Artificial Intelligence 2001; 351–358.
Parkles A.J. Clustering at the phase transition. Proceedings of the 14th National Conference on Artificial Intelligence 1997; 340–345.
Hogg T. Which Search Problems Are Random? Proceedings of AAAI98; 1998; 438–443.
Gomes C.P., Selman B. Problem structure in the presence of perturbations. Proceedings of AAAI/IAAI 1997; 221–226.
Gu J. Global optimization for Satisfiability (SAT) problem. IEEE Trans. on Data and Knowledge Engineering 1994; Vol.6: 361–381.
Achlioptas D., Molloy M.S.O., Kirousis L.M., Stamatiou Y.C., Kranakis E., Krizanc D. Random Constraint Satisfaction: a more accurate picture. Constraints 2001; Vol.6: 329–344.
Cook S.A., Mitchell D.G. Finding hard instances of the satisfiability problem: a survey. In: Du, Gu, Pardalos (eds.): Satisfiability Problems: Theory and Applications, Vol.5. Americam Mathematical Society, 1997; 1–17.
S. Kirkpatrick, G. Gyorgyi, N. Tishby, and L. Troyansky, The Statistical Mechanics of ksatisfaction, Proceeedings of Advances in Neural Information Processing Systems 1994; 439–446.
SATLIB-satisfiability library, main site, http://www.satlib.org
Crawford J.M., Auton L.D. Experimental results on the crossover point in satisfiability problems. Proceedings of the 11th National Conference on Artificial Intelligence 1993; 21–27.
Sachs L. Applied Statistics: a Handbook of Techniques, 2nd Edition, Springer-Verlag, NY, 1984.
Thornton J., Pullan W., Terry J. Towards fewer parameters for SAT clause weighting algorithms. Research Report INT-02-02, Griffith University, 2002.
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
Kravchuk, O., Pullan, W., Thornton, J., Sattar, A. (2002). An Investigation of Variable Relationships in 3-SAT Problems. In: McKay, B., Slaney, J. (eds) AI 2002: Advances in Artificial Intelligence. AI 2002. Lecture Notes in Computer Science(), vol 2557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36187-1_51
Download citation
DOI: https://doi.org/10.1007/3-540-36187-1_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00197-3
Online ISBN: 978-3-540-36187-9
eBook Packages: Springer Book Archive