A symbiotic approach to arc and path consistency checking
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.
Unable to display preview. Download preview PDF.
- 1.E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.Google Scholar
- 5.H. Bennaceur. Partial consistency for constraint satisfaction problems. In Proc. ECAI, Amsterdam, Netherlands, 1994.Google Scholar
- 6.Ph. Codognet and G. Nardiello. Path Consistency in clp (FD), volume 845 of Lecture Notes in Computer Science. Springer-Verlag, 1994.Google Scholar
- 7.D. Sabin and E. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proc. ECAI, Amsterdam, Netherlands, 1994.Google Scholar