Abstract
Constraint logic programming languages that employ consistency techniques have been used to solve many combinatorial search problems. In solving such problems, the built-in constraints often do not suffice. Unfortunately, new constraints defined with lookahead and forward declarations are often inefficient. In this paper, we present an efficient high-level constraint mechanism. High-level constraints are ordinary predicates with an additional constraint declaration. They offer fine-grained control over the tradeoff between pruning power and execution time and achieve huge speedups over lookahead declarations.
Preview
Unable to display preview. Download preview PDF.
References
Mats Carlsson. Freeze, indexing and other implementation issues in the WAM. In Fourth International Conference on Logic Programming (ICLP-4), pages 40–58. MIT Press, 1987.
Phillippe Codognet, François Fages, and Thierry Sola. A metalevel compiler of CLP(FD) and its combination with intelligent backtracking. In Frédéric Benhamou and Alain Colmerauer, editors, Constraint Logic Programming: Selected Research, pages 437–456. MIT Press, 1993.
K. L. Clark, F. G. McCabe, and S. Gregory. IC-Prolog language features. In K. L. Clark and S.-A. Tärnlund, editors, Logic Programming, pages 253–266. Academic Press, London, 1982.
Daniel Diaz and Phillippe Codognet. A minimal extension of the WAM for clp(fd). In International Conference on Logic Programming (ICLP), pages 774–790, 1993.
M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving the Car Sequencing Problem in Constraint Logic Programming. In European Conference on Artificial Intelligence (ECAI-88), München, 1988.
Thom Frühwirth. Constraint simplification rules. Technical Report ECRC-92-18?, ECRC, 1992.
Christian Holzbaur. Implementation of Constraint Based Inference Mechanisms through Extended Unification. PhD thesis, Technische Universität Wien, 1990.
Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Fourteenth Annual ACM Symposium on Principles of Programming Languages (POPL), pages 111–119, München, 1987.
Jean Jourdan and Thierry Sola. The versatility of handling disjunctions as constraints. In Programming Language Implementation and Logic Programming (PLILP), pages 60–74, 1993.
Andreas Krall and Thomas Berger. Fast Prolog with a VAM1p based Prolog compiler. In Programming Language Implementation and Logic Programming (PLILP '92), pages 245–259. Springer LNCS 631, 1992.
Thierry Le Provost and Mark Wallace. Domain independent propagation. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 1004–1011, ICOT, Japan, 1992. Association for Computing Machinery.
Lee Naish. Negation and Control in Prolog. Springer LNCS 238, 1986.
Ulrich Neumerkel. Extensible unification by metastructures. In Meta-90, Leuven, 1990.
Gregory Sidebottom and William S. Havens. Hierarchical arc consistency for disjoint real intervals in constraint logic programming. Computational Intelligence, 8(4):601–623, 1992.
Greg Sidebottom. Compiling constraint logic programming using interval computations and branching constructs. Technical report, Simon Fraser University, 1993.
Andrew Taylor. LIPS on a MIPS. In Seventh International Conference on Logic Programming (ICLP-7), pages 174–185. MIT Press, 1990.
Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, Cambridge, Massachusetts, 1989.
Pascal Van Hentenryck and Yves Deville. The cardinality operator: A new logical connective for constraint logic programming. In Eighth International Conference on Logic Programming (ICLP-8), pages 745–759. MIT Press, 1991.
Pascal Van Hentenryck, Vijay Saraswat, and Yves Deville. Constraint processing in cc(FD). Ftp from parcftp.xerox.com, file pub/ccp/ccfd/pldi-5.ps, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ertl, M.A., Krall, A. (1995). High-level constraints over finite domains. In: Meyer, M. (eds) Constraint Processing. CP CP 1994 1993. Lecture Notes in Computer Science, vol 923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59479-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-59479-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59479-6
Online ISBN: 978-3-540-49281-8
eBook Packages: Springer Book Archive