Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2017: Principles and Practice of Constraint Programming pp 139–156Cite as

All or Nothing: Toward a Promise Problem Dichotomy for Constraint Problems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10416))

Abstract

We show that intractability of the constraint satisfaction problem over a fixed finite constraint language can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise conditions. The instances are guaranteed to either have no solutions at all, or to be k-robustly satisfiable (for any fixed k), meaning that every “reasonable” partial instantiation on k variables extends to a solution.

M. Jackson—The second author was supported by ARC grants FT120100666 and DP1094578.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The complexity of satisfiability problems: refining Schaefer’s Theorem. J. Comput. System Sci. 75, 245–254 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994)

    MATH  Google Scholar 

  3. Abramsky, S., Gottlob, G., Kolaitis, P.G.: Robust constraint satisfaction and local hidden variables in quantum mechanics. In: IJCAI 2013, pp. 440–446 (2013)

    Google Scholar 

  4. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Barto, L., Kozik, M.: Constraint satisfaction problems of bounded width. In: Proceedings of FOCS 2009 (2009)

    Google Scholar 

  6. Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell), SIAM J. Comput. 38, 1782–1802 (2008/2009)

    Google Scholar 

  7. Beacham, A., Culberson, J.: On the complexity of unfrozen problems. Disc. Appl. Math. 153, 3–24 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bulatov, A.A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM 53, 66–120 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bulatov, A.A.: Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Log. 12(4), 24 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bulatov, A.A.: A dichotomy theorem for nonuniform CSPs. arXiv:1703.03021v2

  11. Bulatov, A.A., Jeavons, P.G., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3), 720–742 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Caicedo, X.: Finitely axiomatizable quasivarieties of graphs. Algebra Univers. 34, 314–321 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Chen, H., Larose, B.: Asking the metaquestions in constraint tractability. arxiv:1604.00932

  14. Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM J. Comput. 28(1), 57–104 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  15. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)

    MATH  Google Scholar 

  16. Geiger, D.: Closed systems of functions and predicates. Pacific J. Math. 27, 95–100 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gorbunov, V.A.: Algebraic Theory of Quasivarieties. Consultants Bureau, New York (1998)

    MATH  Google Scholar 

  18. Gottlob, G.: On minimal constraint networks. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 325–339. Springer, Heidelberg (2011). doi:10.1007/978-3-642-23786-7_26

    Chapter  Google Scholar 

  19. Goldreich, O.: On promise problems: a survey. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol. 3895, pp. 254–290. Springer, Heidelberg (2006). doi:10.1007/11685654_12

    Chapter  Google Scholar 

  20. Ham, L.: A gap trichotomy theorem for Boolean constraint problems: extending Schaefer’s theorem. In: ISAAC 2016, pp. 36: 1–36: 12 (2016)

    Google Scholar 

  21. Ham, L.: Gap theorems for robust satisfiability of constraint problems: Boolean CSPs and beyond. Theoret. Comp. Sci. 676, 69–91 (2017)

    Article  MATH  Google Scholar 

  22. Hell, P., Nešetřil, J.: On the complexity of H-colouring. J. Combin. Theory Ser. B 48(1), 92–110 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  23. Idziak, P., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and learnability arising from algebras with few subpowers. SIAM J. Comput. 39, 3023–3037 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  24. Jackson, M.: Flexible constraint satisfiability and a problem in semigroup theory. arXiv:1512.03127

  25. Jackson, M., Kowalski, T., Niven, T.: Digraph related constructions and the complexity of digraph homomorphism problems. Int. J. Algebra Comput. 26, 1395–1433 (2016)

    Article  MATH  Google Scholar 

  26. Jackson, M., Trotta, B.: Constraint satisfaction, irredundant axiomatisability and continuous colouring. Stud. Logica. 101, 65–94 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  27. Jeavons, P.: On the algebraic structure of combinatorial problems. Theor. Comput. Sci. 200(1–2), 185–204 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  28. Jeavons, P., Cohen, D.A., Martin, C.: Cooper.: constraints, consistency and closure. Artif. Intell. 101(1–2), 251–265 (1998)

    Article  MATH  Google Scholar 

  29. Jeavons, P., Cohen, D., Gyssens, M.: A unifying framework for tractable constraints. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 276–291. Springer, Heidelberg (1995). doi:10.1007/3-540-60299-2_17

    Google Scholar 

  30. Jeavons, P., Cohen, D.A., Gyssens, M.: Closure properties of constraints. J. ACM 44, 527–548 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  31. Jeavons, P., Cohen, D.A., Pearson, J.: Constraints and universal algebra. Ann. Math. Artif. Intell. 24(1–4), 51–67 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  32. Jonsson, P., Krokhin, A.: Recognizing frozen variables in constraint satisfaction problems. Theoret. Comp. Sci. 329, 93–113 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  33. Larose, B., Tesson, P.: Universal algebra and hardness results for constraint satisfaction problems. Theoret. Comput. Sci. 410, 1629–1647 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  34. Maltsev, A.I.: Algebraic Systems. Springer, Heidelberg (1973)

    Google Scholar 

  35. Maróti, M., McKenzie, R.: Existence theorems for weakly symmetric operations. Algebra Univers. 59, 463–489 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  36. Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48, 506–521 (1999)

    Article  MathSciNet  Google Scholar 

  37. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic phase transitions. Nature 400, 133–137 (1998)

    MathSciNet  MATH  Google Scholar 

  38. Nešetřil, J., Pultr, A.: On classes of relations and graphs determined by subobjects and factorobjects. Disc. Math. 22, 287–300 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  39. Rafiey, A., Kinne, J., Feder, T.: Dichotomy for digraph homomorphism problems, arXiv:1701.02409v2

  40. Schaefer, T.J.: The complexity of satisfiability problems. In: STOC , pp. 216–226 (1978)

    Google Scholar 

  41. Valeriote, M.A.: A subalgebra intersection property for congruence distributive varieties. Canad. J. Math. 61, 451–464 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  42. Zhuk, D.: The proof of the CSP dichotomy conjecture, arXiv:1704.01914

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, La Trobe University, Melbourne, 3086, Australia

    Lucy Ham & Marcel Jackson

Authors
  1. Lucy Ham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcel Jackson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcel Jackson .

Editor information

Editors and Affiliations

  1. University of Toronto, Toronto, Ontario, Canada

    J. Christopher Beck

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ham, L., Jackson, M. (2017). All or Nothing: Toward a Promise Problem Dichotomy for Constraint Problems. In: Beck, J. (eds) Principles and Practice of Constraint Programming. CP 2017. Lecture Notes in Computer Science(), vol 10416. Springer, Cham. https://doi.org/10.1007/978-3-319-66158-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66158-2_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66157-5

  • Online ISBN: 978-3-319-66158-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation