Advertisement

On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing

  • Christoph Berkholz
  • Oleg Verbitsky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8087)

Abstract

Establishing arc consistency on two relational structures is one of the most popular heuristics for the constraint satisfaction problem. We aim at determining the time complexity of arc consistency testing. The input structures G and H can be supposed to be connected colored graphs, as the general problem reduces to this particular case. We first observe the upper bound O(e(G)v(H) + v(G)e(H)), which implies the bound O(e(G)e(H)) in terms of the number of edges and the bound O((v(G) + v(H))3) in terms of the number of vertices. We then show that both bounds are tight up to a constant factor as long as an arc consistency algorithm is based on constraint propagation (as all current algorithms are).

Our argument for the lower bounds is based on examples of slow constraint propagation. We measure the speed of constraint propagation observed on a pair G,H by the size of a proof, in a natural combinatorial proof system, that Spoiler wins the existential 2-pebble game on G,H. The proof size is bounded from below by the game length D(G,H), and a crucial ingredient of our analysis is the existence of G,H with D(G,H) = Ω(v(G)v(H)). We find one such example among old benchmark instances for the arc consistency problem and also suggest a new, different construction.

Keywords

Time Complexity Binary Relation Constraint Propagation Proof System Colored 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.
    Atserias, A., Bulatov, A.A., Dalmau, V.: On the power of k -consistency. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 279–290. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Atserias, A., Dalmau, V.: A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74(3), 323–334 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Atserias, A., Kolaitis, P.G., Vardi, M.Y.: Constraint propagation as a proof system. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 77–91. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Berkholz, C.: Lower bounds for existential pebble games and k-consistency tests. In: LICS 2012, pp. 25–34. IEEE Computer Society, Los Alamitos (2012)Google Scholar
  5. 5.
    Berkholz, C.: On the complexity of finding narrow proofs. In: FOCS 2012, pp. 351–360. IEEE Computer Society, Los Alamitos (2012)Google Scholar
  6. 6.
    Berkholz, C., Verbitsky, O.: On the speed of constraint propagation and the time complexity of arc consistency testing. E-print: arxiv.org/abs/1303.7077 (2013)Google Scholar
  7. 7.
    Bessière, C.: Constraint Propagation. In: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)Google Scholar
  8. 8.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Dechter, R., Pearl, J.: A problem simplification approach that generates heuristics for constraint-satisfaction problems. Tech. rep., Cognitive Systems Laboratory, Computer Science Department, University of California, Los Angeles (1985)Google Scholar
  10. 10.
    Feder, T., Vardi, M.Y.: 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)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45(3), 275–286 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Kolaitis, P.G., Panttaja, J.: On the complexity of existential pebble games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 314–329. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  13. 13.
    Kolaitis, P.G., Vardi, M.Y.: On the expressive power of datalog: Tools and a case study. J. Comput. Syst. Sci. 51(1), 110–134 (1995)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Kolaitis, P.G., Vardi, M.Y.: A game-theoretic approach to constraint satisfaction. In: Kautz, H.A., Porter, B.W. (eds.) AAAI/IAAI 2000, pp. 175–181. AAAI Press/The MIT Press, California (2000)Google Scholar
  15. 15.
    Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8(1), 99–118 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    McConnell, R.M., Mehlhorn, K., Näher, S., Schweitzer, P.: Certifying algorithms. Computer Science Review 5(2), 119–161 (2011)CrossRefGoogle Scholar
  17. 17.
    Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28(2), 225–233 (1986)CrossRefGoogle Scholar
  18. 18.
    Régin, J.-C.: AC-*: A configurable, generic and adaptive arc consistency algorithm. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 505–519. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  19. 19.
    Samal, A., Henderson, T.: Parallel consistent labeling algorithms. International Journal of Parallel Programming 16, 341–364 (1987)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Christoph Berkholz
    • 1
  • Oleg Verbitsky
    • 2
  1. 1.RWTH Aachen UniversityAachenGermany
  2. 2.Humboldt-University of BerlinBerlinGermany

Personalised recommendations