Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns (1604.07981v4)

Published 27 Apr 2016 in cs.CC and cs.AI

Abstract: Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial intelligence. Forbidding patterns (generic sub-instances) provides a means of defining CSP fragments which are neither exclusively language-based nor exclusively structure-based. It is known that the class of binary CSP instances in which the broken-triangle pattern (BTP) does not occur, a class which includes all tree-structured instances, are decided by arc consistency (AC), a ubiquitous reduction operation in constraint solvers. We provide a characterisation of simple partially-ordered forbidden patterns which have this AC-solvability property. It turns out that BTP is just one of five such AC-solvable patterns. The four other patterns allow us to exhibit new tractable classes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. On the Power of k-Consistency. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP’07), volume 4596 of Lecture Notes in Computer Science, pages 279–290. Springer, 2007.
  2. Libor Barto. Constraint satisfaction problem and universal algebra. ACM SIGLOG News, 1(2):14–24, 2014.
  3. Constraint Satisfaction Problems Solvable by Local Consistency Methods. Journal of the ACM, 61(1), 2014. Article No. 3.
  4. An optimal coarse-grained arc consistency algorithm. Artif. Intell., 165(2):165–185, 2005.
  5. Andrei Bulatov. Combinatorial problems raised from 2-semilattices. Journal of Algebra, 298:321–339, 2006.
  6. Andrei Bulatov. Bounded relational width. Unpublished manuscript, 2009.
  7. A simple algorithm for Mal’tsev constraints. SIAM Journal on Computing, 36(1):16–27, 2006.
  8. Classifying the Complexity of Constraints using Finite Algebras. SIAM Journal on Computing, 34(3):720–742, 2005.
  9. Tractability in constraint satisfaction problems: a survey. Constraints, 21(2):115–144, 2016.
  10. Variable and value elimination in binary constraint satisfaction via forbidden patterns. Journal of Computer and System Sciences, 81(7):1127–1143, 2015.
  11. Tractable classes of binary CSPs defined by excluded topological minors. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI’15), pages 1945–1951. AAAI Press, 2015.
  12. The Complexity of Soft Constraint Satisfaction. Artificial Intelligence, 170(11):983–1016, 2006.
  13. The tractability of CSP classes defined by forbidden patterns. Journal of Artificial Intelligence Research, 45:47–78, 2012.
  14. Soft arc consistency revisited. Artificial Intelligence, 174(7–8):449–478, 2010.
  15. Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns. Discrete Applied Mathematics, 184:89–113, 2015.
  16. Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. Artificial Intelligence, 174(9–10):570–584, 2010.
  17. A Microstructure-Based Family of Tractable Classes for CSPs. In Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming (CP’15), volume 9255 of Lecture Notes in Computer Science, pages 74–88. Springer, 2015.
  18. On broken triangles. In Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP’14), volume 8656 of Lecture Notes in Computer Science, pages 9–24. Springer, 2014.
  19. The power of arc consistency for CSPs defined by partially-ordered forbidden patterns. In Proceedings of the 31st Annual ACM/IEE Symposium on Logic in Computer Science (LICS’16), pages 652–661, 2016.
  20. Hybrid tractable classes of constraint problems. In Andrei Krokhin and Stanislav Živný, editors, Complexity and approximability of Constraint Satisfaction Problems, volume 7 of Dagstuhl Follow-Ups, pages 113–135. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
  21. M.C. Cooper. Linear-time algorithms for testing the realisability of line drawings of curved objects. Artificial Intelligence, 108:31–67, 1999.
  22. Víctor Dalmau. Generalized Majority-Minority Operations are Tractable. Logical Methods in Computer Science, 2(4), 2006.
  23. Temporal constraint networks. Artif. Intell., 49:61–95, 1991.
  24. Guillaume Escamocher. Forbidden Patterns in Constraint Satisfaction Problems. PhD thesis, University of Toulouse, 2014.
  25. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM Journal on Computing, 28(1):57–104, 1998.
  26. Hybrid tractable classes of binary quantified constraint satisfaction problems. In Proceedings of AAAI’11. AAAI Press, 2011.
  27. Domain permutation reduction for constraint satisfaction problems. Artificial Intelligence, 172(8-9):1094–1118, 2008.
  28. Martin Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM, 54(1):1–24, 2007.
  29. Tractability and learnability arising from algebras with few subpowers. SIAM Journal on Computing, 39(7):3023–3037, 2010.
  30. Tractable Constraints on Ordered Domains. Artificial Intelligence, 79(2):327–339, 1995.
  31. Effectiveness of structural restrictions for hybrid csps. CoRR, abs/1504.07067, 2015.
  32. The power of linear programming for general-valued CSPs. SIAM Journal on Computing, 44(1):1–36, 2015.
  33. Dániel Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Journal of the ACM, 60(6), 2013. Article No. 42.
  34. Wady Naanaa. Unifying and extending hybrid tractable classes of CSPs. Journal of Experimental and Theoretical Artificial Intelligence, 25(4):407–424, 2013.
  35. The Handbook of Constraint Programming. Elsevier, 2006. Chapter 3 (by Christian Bessiere): Constraint Propagation.
  36. Rustem Takhanov. Hybrid (V)CSPs and algebraic reductions. CoRR, abs/1506.06540, 2015.
  37. The complexity of finite-valued CSPs. Journal of the ACM, 63(4), 2016. Article No. 37.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Martin C. Cooper (25 papers)
  2. Stanislav Živný (42 papers)
Citations (12)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now