Skip to main content
SpringerLink
Log in

A hybrid tractable class for non-binary CSPs

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

Find new islands of tractability, that is classes of CSP instances for which polytime algorithms exist, is a fundamental task in the study of constraint satisfaction problems. The concept of hybrid tractable class, which allows to deal simultaneously with the restrictions of languages and, for example, the satisfaction of structural properties, is an approach which has already shown its interest in this domain. Here we study a hybrid class for non-binary CSP instances. With this aim in view, we consider the Broken Triangle Property (BTP) introduced in Cooper et al. (Artificial Intelligence, 174, 570–584 2010). While this tractable class has been defined for binary instances, the authors have suggested to extend it to instances with constraints of arbitrary arities, using the dual representation of such CSPs. We develop this idea by proposing a new definition without exploiting the dual representation, but using a semantic property associated to the compatibility relations of the constraints. This class is called DBTP for Dual Broken Triangle Property. We study it in depth, firstly to show that it is tractable. Then we compare it to some known classes. In particular, we prove that DBTP is incomparable with BTP and that it includes some well known tractable classes of CSPs such as β-acyclic CSPs. Then, we compare it with the Hyper-k-Consistency, which allows us to also present new results for BTP. Finally, we analyse DBTP from a practical viewpoint, by first highlighting that some benchmarks which are classically used to compare the solvers are included in DBTP and then by explaining the efficiency of solvers of the state of the art on such instances thanks to their membership of the DBTP class.

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. van Beek, P., & Dechter, R. (1995). On the minimality and decomposability of row-convex constraint networks. Journal of the ACM, 42(3), 543–561.

    Article  MATH  MathSciNet  Google Scholar 

  2. Beeri, C., Fagin, R., Maier, D., & Yannakakis, M. (1983). On the desirability of acyclic database schemes. Journal of the ACM, 30(3), 479–513.

    Article  MATH  MathSciNet  Google Scholar 

  3. Bessière, C. (2006). Constraint Propagation, chap. 3. Handbook of Constraint Programming: Elsevier.

  4. Bessière, C., Stergiou, K., & Walsh, T. (2008). Domain filtering consistencies for non-binary constraints. Artificial Intelligence, 172, 800–822.

    Article  MATH  MathSciNet  Google Scholar 

  5. Cohen, D., Cooper, M., Green, M., & Marx, D. (2011). On guaranteeing polynomially bounded search tree size. In Proceedings of CP (pp. 160–171).

  6. Cohen, D.A. (2003). A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure. In Proceedings of CP 2003 (pp. 807–811).

  7. Cooper, M., Cohen, D., & Jeavons, P. (1994). Characterising Tractable Constraints. Artificial Intelligence, 65(2), 347–361.

    Article  MATH  MathSciNet  Google Scholar 

  8. Cooper, M., & Jeavons, P. (2010). Salamon, A.: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination. Artificial Intelligence, 174, 570–584.

    Article  MATH  MathSciNet  Google Scholar 

  9. Duris, D. (2012). Some characterizations of γ and β-acyclicity of hypergraphs. Information Processing Letters, 112(16), 617–620.

    Article  MATH  MathSciNet  Google Scholar 

  10. El Mouelhi, A., Jégou, P., Terrioux, C., & Zanuttini, B. (2013). Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms. In Proceedings of CP-AI-OR (pp. 61–76).

  11. El Mouelhi, A., Jégou, P., & Terrioux, C. (2013). A Hybrid Tractable Class for Non-Binary CSPs. In Proceedings of ICTAI (pp. 947–954).

  12. El Mouelhi, A., Jégou, P., & Terrioux, C. (2014). Hidden Tractable Classes: from Theory to Practice. In Proceedings of ICTAI (pp. 437–445).

  13. Fagin, R. (1983). Degrees of Acyclicity for Hypergraphs and Relational Database Schemes. Journal of the ACM, 30(3), 514–550.

    Article  MATH  MathSciNet  Google Scholar 

  14. Freuder, E. (1982). A Sufficient Condition for Backtrack-Free Search. Journal of the ACM, 29(1), 24–32.

    Article  MATH  MathSciNet  Google Scholar 

  15. Gavril, F. (1972). Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing, 1(2), 180–187.

    Article  MATH  MathSciNet  Google Scholar 

  16. Golumbic, M. (1980). Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press.

    MATH  Google Scholar 

  17. Graham, M.H. (1979). On the universal relation. Tech. rep., University of Toronto.

  18. Janssen, P., Jégou, P., Nouguier, B., & Vilarem, M.C. (1989). A filtering process for general constraint satisfaction problems: achieving pairwise-consistency using an associated binary representation. In Proceedings of IEEE Workshop on Tools for Artificial Intelligence (pp. 420–427).

  19. Jeavons, P., & Cooper, M. (1995). Tractable constraints on ordered domains. Artificial Intelligence, 79(2), 327–339.

    Article  MATH  MathSciNet  Google Scholar 

  20. Jégou, P. (1991). Contribution à l’étude des problèmes de satisfaction de contraintes : Algorithmes de propagation et de résolution – Propagation de contraintes dans les réseaux dynamiques. Ph.D. thesis, Université des Sciences et Techniques du Languedoc.

  21. Jégou, P. (1993). Decomposition of Domains Based on the Micro-Structure of Finite Constraint Satisfaction Problems. In Proceedings of AAAI (pp. 731–736).

  22. Jégou, P. (1993). On the Consistency of General Constraint-Satisfaction Problems. In Proceedings of AAAI (pp. 114–119).

  23. Nadel, B. (1988). Tree Search and Arc Consistency in Constraint-Satisfaction Algorithms, pp. 287–342. In Search in Artificial Intelligence: Springer-Verlag.

  24. Robertson, N., & Seymour, P. (1986). Graph minors II: Algorithmic aspects of treewidth. Algorithms, 7, 309–322.

    Article  MATH  MathSciNet  Google Scholar 

  25. Rossi, F., van Beek, P., & Walsh, T. (2006). Handbook of Constraint Programming: Elsevier.

  26. Sabin, D., & Freuder, E. (1994). Contradicting Conventional Wisdom in Constraint Satisfaction. In Proceedings of ECAI (pp. 125–129).

  27. Salamon, A., & Jeavons, P. (2008). Perfect Constraints Are Tractable. In Proceedings of CP (pp. 524–528).

Download references

Author information

Authors and Affiliations

  1. LSIS UMR 7296, Aix-Marseille Université, CNRS, ENSAM, Université de Toulon, 13397, Marseille, France

    Achref El Mouelhi, Philippe Jégou & Cyril Terrioux

Authors
  1. Achref El Mouelhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Jégou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cyril Terrioux
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cyril Terrioux.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

El Mouelhi, A., Jégou, P. & Terrioux, C. A hybrid tractable class for non-binary CSPs. Constraints 20, 383–413 (2015). https://doi.org/10.1007/s10601-015-9185-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-015-9185-y

Keywords

Search

Navigation