Abstract
The resolution of constraint satisfaction problems heavily relies on the use of local consistency enforcement procedures which are used to filter the problems before or during their resolution. While procedures based on arc-consistency are almost a standard, path-consistency checking is often neglected because it is costly and it filters out pairs of assignments instead of single assignments. This paper presents a domain filtering procedure that tightly combines the use of arc and path-consistency, each one helping the other to achieve further or faster work. We show, on an experimental evaluation, that the proposed procedure offers a considerable filtering power at relatively low cost.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
C. Han and C. Lee. Comments on Mohr and Henderson's path consistency algorithm. Artificial Intelligence, 36:125–130, 1988.
A. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.
R. Mohr and T. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:225–233, 1986.
H. Bennaceur. Partial consistency for constraint satisfaction problems. In Proc. ECAI, Amsterdam, Netherlands, 1994.
Ph. Codognet and G. Nardiello. Path Consistency in clp (FD), volume 845 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
D. Sabin and E. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proc. ECAI, Amsterdam, Netherlands, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berlandier, P. (1995). A symbiotic approach to arc and path consistency checking. In: Pinto-Ferreira, C., Mamede, N.J. (eds) Progress in Artificial Intelligence. EPIA 1995. Lecture Notes in Computer Science, vol 990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60428-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-60428-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60428-0
Online ISBN: 978-3-540-45595-0
eBook Packages: Springer Book Archive