Abstract
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive singleton checks (i.e. enforcing arc consistency after the assignment of a value to a variable) in order to identify inconsistent pairs of values, until a fixpoint is reached. In this paper, we propose two new algorithms, denoted by sDC2 and sDC3, to enforce (strong) PC following the DC approach. These algorithms can be seen as refinements of Mac Gregor’s algorithm as they partially and totally exploit the incrementality of the underlying Arc Consistency algorithm. While sDC3 admits the same interesting worst-case complexities as PC8, sDC2 appears to be the most robust algorithm in practice. Indeed, compared to PC8 and the optimal PC2001, sDC2 is usually around one order of magnitude faster on large instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bessiere, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. In: Proceedings of IJCAI 2005, pp. 54–59 (2005)
Bessiere, 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)
Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Support inference for generic filtering. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 721–725. Springer, Heidelberg (2004)
Boutaleb, K., Jégou, P., Terrioux, C.: (no)good recording and robdds for solving structured (v)csps. In: Proceedings of ICTAI 2006, pp. 297–304 (2006)
Chmeiss, A., Jégou, P.: Efficient path-consistency propagation. International Journal on Artificial Intelligence Tools 7(2), 121–142 (1998)
Debruyne, R., Bessiere, C.: Domain filtering consistencies. Journal of Artificial Intelligence Research 14, 205–230 (2001)
Dechter, R.: Constraint processing. Morgan Kaufmann, San Francisco (2003)
Frost, D., Dechter, R.: Dead-end driven learning. In: Proceedings of AAAI 1994, pp. 294–300 (1994)
Han, C.C., Lee, C.H.: Comments on Mohr and Henderson’s path consistency. Artificial Intelligence 36, 125–130 (1988)
Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)
Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: Proceedings of AAAI 2005, pp. 390–396 (2005)
Lecoutre, C., Cardon, S., Vion, J.: Conservative dual consistency. In: Proceedings of AAAI 2007, pp. 237–242 (2007)
Lecoutre, C., Hemery, F.: A study of residual supports in arc consistency. In: Proceedings of IJCAI 2007, pp. 125–130 (2007)
Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood recording from restarts. In: Proceedings of IJCAI 2007, pp. 131–136 (2007)
Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8(1), 99–118 (1977)
McGregor, J.J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Information Sciences 19, 229–250 (1979)
Mehta, D., van Dongen, M.R.C.: Reducing checks and revisions in coarse-grained MAC algorithms. In: Proceedings of IJCAI 2005, pp. 236–241 (2005)
Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28, 225–233 (1986)
Richaud, G., Cambazard, H., O’Sullivan, B., Jussien, N.: Automata for nogood recording in constraint satisfaction problems. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204. Springer, Heidelberg (2006)
Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problems. International Journal of Artificial Intelligence Tools 3(2), 187–207 (1994)
Singh, M.: Path consistency revisited. International Journal on Artificial Intelligence Tools 5, 127–141 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lecoutre, C., Cardon, S., Vion, J. (2007). Path Consistency by Dual Consistency. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)