Skip to main content
SpringerLink
Log in

Meta-Level interpretation of constraint languages a case study: Logical primitives

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

This paper provides a detailed presentation of a Prolog-written meta-level interpreter for a constraint logic programming (CLP) language for expressing equalities and disequalities of finite trees, as well as non-negative integers (arities). The logical interpretation of the Prolog primitive functor (whose arguments are trees and arity) is used to illustrate the interactions among constraints pertaining to multiple domains. The paper’s objective is to provide insights about CLP language design and to present a modularized, incrementally-expandable meta-processor for this class of languages.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramson, H., Rogers, M.H.,Meta-Programming in Logic Programming, MIT Press, 1989.

  2. Van Caneghem, M.,L’Anatomie de Prolog, Inter Edition, Paris, 1986.

  3. Clark, K. L., “Negation as Failure,” inLogic and Data Bases (H. Gallaire and J. Minker, eds.), Plenum Press, pp. 293–322, 1978.

  4. Colmerauer, A., “Solving Equations and Inequations on Finite and Infinite Trees,”Proceedings of the Conference on Fifth Generation Computer Systems, Tokyo, Nov. 1984, pp. 85–99, 1984.

  5. Colmerauer, A., “An Introduction to Prolog III,”Communications of the ACM, July 1990.

  6. Cohen, J., “Constraint Logic Programming Languages,”Communications of the ACM, July 1990.

  7. Cohen, J., Koiran, P. and Perrin, C., “Meta-Level Interpretation of CLP (Linear Lists, Integers) Enhanced by Lazy Evaluation and Enumeration,”Technical Report, Brandeis University, 1991.

  8. Cohen, J. and Richard, J-P., “Meta-Level Interpretation of CLP (Booleans),”Technical Report, Brandeis University, 1991.

  9. Imbert, J-L., Cohen, J. and Weeger, M-D., “Efficient and Incremental Testing of the Satisfiability of Linear Constraints,”Technical Report, Brandeis University, 1991.

  10. Jaffar, J. and Michaylov, S., “Methodology and Implementation of a Constraint Logic Programming System,”Proceedings of the Fourth International Conference on Logic Programming, Melbourne, MIT Press, pp. 196–218, 1987. (a revised version of this paper has been presented in the Languages and Constraints Workshop, Alton Jones Campus Rhode Island, April 1988).

  11. Jaffar, J. and Lassez, J-L., “Constraint Logic Programming,”Proceedings of the 14th ACM Symposium on the Principles of Programming Languages, pp. 111–119, 1987.

  12. Special Issue of Partial Evaluation,New Genrration Computing, 6, 1989.

Download references

Author information

Authors and Affiliations

  1. Michtom School of Computer Science Ford Hall, Brandeis University, 02254, Waltham, MA

    Timothy J. Hickey, Jacques Cohen & Veronique Deschamps

Authors
  1. Timothy J. Hickey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Veronique Deschamps
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by NSF Grant CCR-871 8989.

About this article

Cite this article

Hickey, T.J., Cohen, J. & Deschamps, V. Meta-Level interpretation of constraint languages a case study: Logical primitives. New Gener Comput 10, 361–384 (1992). https://doi.org/10.1007/BF03037944

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037944

Keywords

Search

Navigation