Advertisement

Structural Consistency: A New Filtering Approach for Constraint Networks

  • Philippe Jégou
  • Cyril Terrioux
Conference paper
  • 695 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8323)

Abstract

In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency is based on a new approach. While conventional consistencies generally rely on local properties extended to the entire network, this new partial consistency considers global consistency on subproblems. These subproblems are defined by partial constraint graphs whose tree-width is bounded by a constant w. We introduce a filtering algorithm which achieves w-SC consistency. We also analyze w-SC filtering w.r.t. other classical local consistencies to prove that this consistency is generally incomparable although this consistency can be regarded as a special case of inverse consistency. Finally, we present experimental results to assess the usefulness of this approach. We show that w-SC is a significantly more powerful level of filtering and more effective w.r.t. the runtime than SAC and that w-SC is a complementary approach to AC or SAC. So we can offer a combination of filterings, whose power is greater than w-SC or SAC.

Keywords

Space Complexity Constraint Satisfaction Problem Constraint Network Random Instance Constraint Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier (2006)Google Scholar
  2. 2.
    Bessiere, C.: Constraint Propagation. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch. 3, pp. 29–83. Elsevier (2006)Google Scholar
  3. 3.
    Robertson, N., Seymour, P.D.: Graph minors II: Algorithmic aspects of treewidth. Algorithms 7, 309–322 (1986)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Jégou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence 146, 43–75 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Freuder, E., Elfe, C.D.: Neighborhood inverse consistency preprocessing. In: Proceedings of AAAI, pp. 202–208 (1996)Google Scholar
  6. 6.
    Debruyne, R., Bessière, C.: Domain Filtering Consistencies. JAIR 14, 205–230 (2001)zbMATHGoogle Scholar
  7. 7.
    Bessière, C., Régin, J.C., Yap, R.H.C., Zhang, Y.: An optimal coarse-grained arc consistency algorithm. Artificial Intelligence 165(2), 165–185 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Freuder, E.: Synthesizing constraint expressions. CACM 21(11), 958–966 (1978)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Cooper, M.C.: An optimal k-consistency algorithm. Artificial Intelligence 41(1), 89–95 (1989)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Bessière, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. In: Proceedings of IJCAI, pp. 54–59 (2005)Google Scholar
  11. 11.
    Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124, 243–282 (2000)Google Scholar
  12. 12.
    Dechter, R.: Constraint processing. Morgan Kaufmann Publishers (2003)Google Scholar
  13. 13.
    Dechter, R., van Beek, P.: Local and Global Relational Consistency. Journal of Theoretical Computer Science (1996)Google Scholar
  14. 14.
    Bayer, K.M., Michalowski, M., Choueiry, B.Y., Knoblock, C.A.: Reformulating CSPs for Scalability with Application to Geospatial Reasoning. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 164–179. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Freuder, E.: A Sufficient Condition for Backtrack-Free Search. JACM 29(1), 24–32 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Beineke, Pippert: Properties and characterizations of k-trees. Mathematika 18, 141–151 (1971)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Bessière, C., Cardon, S., Debruyne, R., Lecoutre, C.: Efficient Algorithms for Singleton Arc Consistency. Constraints 16(1), 25–53 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Verfaillie, G., Martinez, D., Bessière, C.: A Generic Customizable Framework for Inverse Local Consistency. In: Proceedings of AAAI, pp. 169–174 (1999)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Philippe Jégou
    • 1
  • Cyril Terrioux
    • 1
  1. 1.LSIS - UMR CNRS 7296Aix-Marseille UniversitéMarseille Cedex 20France

Personalised recommendations