Skip to main content
SpringerLink
Log in

The complexity of Boolean constraint satisfaction local search problems

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

The class of generalized satisfiability problems, first introduced by Schaefer in 1978, presents a uniform way of studying the complexity of Boolean constraint satisfaction problems with respect to the nature of constraints allowed in the input. We investigate the complexity of local search for this class of problems. We prove a dichotomy result: any generalized satisfiability local search problem is either in P or PLS-complete. In the meantime our study contributes to a better understanding of the complexity class PLS through the identification of an appropriate tool that captures reducibility among Boolean constraint satisfaction local search problems: sensitive implementation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, in: Proceedings of 33rd IEEE Symp. on the Foundations of Computer Science (1992) pp. 14–23.

  2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi, Complexity and Approximation (Springer, 1999).

  3. M. Bellare, O. Goldreich and M. Sudan, Free bits, PCPs, and nonapproximability — towards tight results, SIAM Journal on Computing 27(3) (1998) 804–915.

    Article  MATH  MathSciNet  Google Scholar 

  4. L. Bolc and J. Cytowski, Search Methods for Artificial Intelligence (Academic Press, 1992).

  5. N. Creignou, A dichotomy theorem for maximum generalized satisfiability problems, Journal of Computer and System Sciences 51(3) (1995) 511–522.

    Article  MathSciNet  Google Scholar 

  6. N. Creignou and M. Hermann, Complexity of generalized satisfiability counting problems, Information and Computation 125(1) (1996) 1–12.

    Article  MATH  MathSciNet  Google Scholar 

  7. N. Creignou, S. Khanna and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monographs on Discrete Mathematics and Applications (2001).

  8. P. Crescenzi, R. Silvestri and L. Trevisan, To weight or not to weight: Where is the question?, in: Proceedings of the 4th IEEE Israel Symposium on Theory of Computing and Systems (1996) pp. 68–77.

  9. E. Dantsin, A. Goerdt, E.A. Hirsch, R. Kannan, J. Kleinberg, C. Papadimitriou, P. Raghavan and U. Schőning, A deterministic \((2 - \frac{2}{{k + 1}})^n \) algorithm for k-SAT based on local search, Theoretical Computer Science (2002).

  10. J. Gu, P. Purdom, J. Franco and B.W. Wah, Algorithms for the Satisfiability Problem, Cambridge Tracts in Theoretical Computer Science, Vol. 51 (Cambridge University Press, Cambridge, MA, 2000).

  11. E.A. Hirsch, SAT local search algorithms: worst-case study, Journal of Automated Reasoning 24(1/2) (2000) 127–143.

    Article  MATH  MathSciNet  Google Scholar 

  12. H.B. Hunt III, R.E. Stearns and M.V. Marathe, Relational representability, local reductions, and the complexity of generalized satisfiability problems, Manuscript (2000).

  13. D.S. Johnson, C.H. Papadimitriou and M. Yannakakis, How easy is local search? Journal of Computer and System Sciences 37 (1988) 79–100.

    Article  MATH  MathSciNet  Google Scholar 

  14. S. Khanna and M. Sudan, The optimization complexity of constraint satisfaction problems, Stanford University Tech. Note STAN-CS-TN-96-29 (1996).

  15. S. Khanna, M. Sudan, L. Trevisan and D.P. Williamson, The approximability of constraint satisfaction problems, SIAM Journal on Computing 30(6) (2000) 1863–1920.

    Article  MathSciNet  Google Scholar 

  16. E. Koutsoupias and C.H. Papadimitriou, On the greedy algorithm for Satisfiability, Information Processing Letters 43(1) (1992) 53–55.

    Article  MATH  MathSciNet  Google Scholar 

  17. M.W. Krentel, On finding and verifying locally optimal solutions, SIAM Journal on Computing 19(4) (1990) 742–749.

    Article  MATH  MathSciNet  Google Scholar 

  18. C.H. Papadimitriou, On selecting a satisfying truth assignment, in: Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS’91 (1991) pp. 163–169.

  19. S. Reith and H. Vollmer, Optimal satisfiability for propositional calculi and constraint satisfaction problems, in: Proceedings of 25th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 1893 (Springer, 2000) pp. 640–649.

  20. T.J. Schaefer, The complexity of satisfiability problems, in: Conference Record of the 10th Annual ACM Symposium on Theory of Computing, San Diego, CA (1–3 May 1978) pp. 216–226.

  21. A.A. Schäffer and M. Yannakakis, Simple local search problems that are hard to solve, SIAM Journal on Computing 20(1) (1991) 56–87.

    Article  MATH  MathSciNet  Google Scholar 

  22. U. Schöning, A probabilistic algorithm for k-SAT and constraint satisfaction problems, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, FOCS’99 (1999) pp. 410-14.

  23. B. Selman, H. Levesque and D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of the 10th National Conference on Artificial Intelligence, AAAI’92 (MIT Press, 1992) pp. 440–446.

  24. L. Trevisan, G.B. Sorkin, M. Sudan and D.P. Williamson, Gadgets, approximation, and linear programming, SIAM Journal on Computing 29(6) (2000) 2074–2097.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GREYC, UMR CNRS 6072, Université de Caen, Boulevard Maréchal Juin, 14 032, Caen cedex, France

    Philippe Chapdelaine

  2. LIF, UMR CNRS 6166, Université de la Méditerranée, 163, Avenue de Luminy, 13 288, Marseille cedex 9, France

    Nadia Creignou

Authors
  1. Philippe Chapdelaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nadia Creignou
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chapdelaine, P., Creignou, N. The complexity of Boolean constraint satisfaction local search problems. Ann Math Artif Intell 43, 51–63 (2005). https://doi.org/10.1007/s10472-005-0419-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-005-0419-3

Keywords

Search

Navigation