Constraint satisfaction tractability from semi-lattice operations on infinite sets (original) (raw)

Abstract

A famous result by Jeavons, Cohen, and Gyssens shows that every constraint satisfaction problem (CSP) where the constraints are preserved by a semi-lattice operation can be solved in polynomial time. This is one of the basic facts for the so-called universalalgebraic approach to a systematic theory of tractability and hardness in finite domain constraint satisfaction.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (20)

  1. Libor Barto and Marcin Kozik. New conditions for Taylor varieties and CSP. In Proceedings of LICS, pages 100-109, 2010.
  2. Manuel Bodirsky. Cores of countably categorical structures. Logical Methods in Computer Science, 3(1):1- 16, 2007.
  3. Manuel Bodirsky, Martin Hils, and Barnaby Martin. On the scope of the universal-algebraic approach to constraint satisfaction. Accepted for publication in LMCS; available at arXiv:0909.5097v3. An extended abstract that announced some of the results appeared in the proceedings of LICS'10, pages 90-99, 2011.
  4. Manuel Bodirsky and Jan Kára. The complexity of temporal constraint satisfaction problems. Journal of the ACM, 57(2), 2009. An extended abstract appeared in the proceedings of STOC'08.
  5. Manuel Bodirsky and Jan Kára. A fast algorithm and Datalog inexpressibility for temporal reasoning. ACM Transactions on Computational Logic, 11(3), 2010.
  6. Manuel Bodirsky and Jaroslav Nešetřil. Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation, 16(3):359-373, 2006.
  7. Manuel Bodirsky and Michael Pinsker. All reducts of the random graph are model-complete. Preprint, arXiv:0810.2270, 2009.
  8. Andrei Bulatov, Andrei Krokhin, and Peter G. Jeavons. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing, 34:720-742, 2005.
  9. Peter J. Cameron. Transitivity of permutation groups on unordered sets. Mathematische Zeitschrift, 148:127-139, 1976.
  10. Peter J. Cameron. Oligomorphic Permutation Groups. Cambridge University Press, Cambridge, 1990.
  11. Peter J. Cameron. Permutation Groups. LMS Student Text 45. Cambridge University Press, Cambridge, 1999.
  12. Hubie Chen, Víctor Dalmau, and Berit Grußien. Arc consistency and friends. Accepted for publication in the Journal on Logic and Computation. CoRR, abs/1104.4993, 2011.
  13. Víctor Dalmau and Justin Pearson. Closure functions and width 1 problems. In Proceedings of CP, pages 159-173, 1999.
  14. Rina Dechter. Constraint Processing. Morgan Kaufmann, 2003.
  15. Tomás Feder and Moshe Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing, 28:57-104, 1999.
  16. Su Gao. Invariant Descriptive Set Theory. Pure and applied mathematics. Taylor and Francis, 2008.
  17. Wilfrid Hodges. A shorter model theory. Cambridge University Press, Cambridge, 1997.
  18. Peter Jeavons, David Cohen, and Marc Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-548, 1997.
  19. Benoit Larose and László Zádori. Finite posets and topological spaces in locally finite varieties. Algebra Universalis, 52(2-3):119-136, 2004.
  20. H. D. Macpherson. Orbits of infinite permutation groups. Proceedings of the LMS, 51(3):246-284, 1985.