Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Constraint Processing

International Workshop on Constraint Processing

CP 1994, CP 1993: Constraint Processing pp 51–66Cite as

High-level constraints over finite domains

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 923))

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. Thom Frühwirth. Constraint simplification rules. Technical Report ECRC-92-18?, ECRC, 1992.

    Google Scholar 

  7. Christian Holzbaur. Implementation of Constraint Based Inference Mechanisms through Extended Unification. PhD thesis, Technische Universität Wien, 1990.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. Jean Jourdan and Thierry Sola. The versatility of handling disjunctions as constraints. In Programming Language Implementation and Logic Programming (PLILP), pages 60–74, 1993.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. 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.

    Google Scholar 

  12. Lee Naish. Negation and Control in Prolog. Springer LNCS 238, 1986.

    Google Scholar 

  13. Ulrich Neumerkel. Extensible unification by metastructures. In Meta-90, Leuven, 1990.

    Google Scholar 

  14. Gregory Sidebottom and William S. Havens. Hierarchical arc consistency for disjoint real intervals in constraint logic programming. Computational Intelligence, 8(4):601–623, 1992.

    Google Scholar 

  15. Greg Sidebottom. Compiling constraint logic programming using interval computations and branching constructs. Technical report, Simon Fraser University, 1993.

    Google Scholar 

  16. Andrew Taylor. LIPS on a MIPS. In Seventh International Conference on Logic Programming (ICLP-7), pages 174–185. MIT Press, 1990.

    Google Scholar 

  17. Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, Cambridge, Massachusetts, 1989.

    Google Scholar 

  18. 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.

    Google Scholar 

  19. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Computersprachen, Technische Universität Wien, Argentinierstraße 8, 1040, Wien, Austria

    M. Anton Ertl

Authors
  1. M. Anton Ertl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Krall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Meyer

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation