Abstract
We consider methods for handling constraints over finite domains based on the notion of path consistency. We show that these methods can be easily integrated in the glassbox constraint-solver of the clp(FD) system. Besides the clp(FD) indexical constraints encoding (partial) arc-consistency methods, we introduce new primitive constraints, that we call m constraints, which encode path-consistency methods. We describe how to accommodate these new constraints in the clp(FD) extended WAM architecture.
This work has been carried out while the second author was visiting INRIA-Rocquencourt, France.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Aït-Kaci. Warren's Abstract Machine. The MIT Press, (1991).
A. Aggoun and N. Beldiceanu. Overview of the CHIP Compiler System. In Proc. Eighth Int. Conf. on Logic Programming (ICLP'91), Paris, France, The MIT Press, pp. 775–789 (1991). Also in Constraint Logic Programming: selected research (A. Colmerauer and F. Benhamou eds.), The MIT Press, (1993).
A. Colmerauer. An Introduction to Prolog III. ACM Comm., 33(7), pp. 70–90, July (1990).
D. Diaz and Ph. Codognet. A Minimal Extension of the WAM for clp(FD). In Proc. Tenth Int. Conf. on Logic Programming (ICLP'93), Budapest, Hungary, The MIT Press, pp.774–790 (1993).
Ph. Codognet and D. Diaz. Compiling Constraints in clp(FD). Tech. Rep. INRIA (1993).
Ph. Codognet and D. Diaz. Local Propagation Methods for Solving Boolean Constraints in Constraint Logic Programming. Tech. Rep. INRIA (1993).
CHIP User's Guide. Version 4.0 Revision A. COSYTEC SA, June 11, France (1993).
M. Dincbas, M. Simonis, and P. Van Hentenryck. Solving Large Combinatorial Problems in Constraint Logic Programming. Journal of Logic Programming, 8(1–2), pp. 75–93, (1990).
M. Dincbas, P. Van Hentenryck, M. Simonis, A. Aggoun, T. Graf, F. Berthier. The Constraint Logic Programming Language CHIP. In Proc. Int. Conf. on Fifth Generation Computer System (FGCS'88), Tokyo, Japan, December, pp. 693–702 (1988).
R.M. Haralick and G.L. Elliott. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Art. Int. 14, pp. 263–313, (1980).
J. Jaffar and J.-L. Lassez. Constraint Logic Programming. Tech. Rep. 86/73, Monash University, Victoria, Australia, June (1986).
J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. 14th ACM Conf. on Priciples of Programming Languages (POPL'87), Munich, January, pp. 111–119 (1987).
J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. J. Logic Programming, to appear, (1994).
J. Jaffar, S. Michaylov, P.J. Stuckey and R.H.C. Yap. The CLP(\(\mathcal{R}\)) Language and System. ACM Trans. on Prog. Lang. and Systems, vol. 14(3), pp. 339–395, (1992).
V. Kumar. Algorithms for Constraint-Satisfaction Problems: A Survey. AI Magazine, pp. 32–44, Spring (1992).
A.K. Mackworth. Consistency in Network of Relations. AI Journal, 8(1), pp.99–118, (1977).
A.K. Mackworth. The logic of constraint satisfaction. AI Journal, 58(1–3) (special volume on Constraint Based Reasoning), pp.3–20, (1992).
A.K. Mackworth and E.C. Freuder. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems. Art. Int. 25, pp.65–74, (1985).
R. Mohr and T.C. Henderson. Arc and Path Consistency Revisited. Artificial Intelligence, 28, pp.225–233, (1986).
U. Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Sciences 7, pp. 95–132, (1974).
E. Tsang. Foundations of Constraint Satisfaction. Academic Press, (1993).
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT Press, (1989).
P. Van Hentenryck and Y. Deville. The Cardinality Operator: A new Logical Connective for Constraint Logic Programming. In Proc. Eighth Int. Conf. on Logic Programming (ICLP'91), The MIT Press, Paris, France, (1991).
P. Van Hentenryck, Y. Deville and C.-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, pp 291–321, (1992).
P. Van Hentenryck, V.A. Saraswat and Y. Deville. Constraint processing in cc(FD). Draft (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Codognet, P., Nardiello, G. (1994). Path consistency in clp(FD). In: Jouannaud, JP. (eds) Constraints in Computational Logics. CCL 1994. Lecture Notes in Computer Science, vol 845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016854
Download citation
DOI: https://doi.org/10.1007/BFb0016854
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58403-2
Online ISBN: 978-3-540-48699-2
eBook Packages: Springer Book Archive