CAL: A theoretical background of constraint logic programming and its applications

  • Authors:
  • Kô Sakai;Akira Aiba

  • Affiliations:
  • -;-

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 1989

Quantified Score

Hi-index 0.02

Visualization

Abstract

Constraint logic programming (CLP) is an extension of logic programming by introducing the facility of writing and solving constraints in a certain domain. CAL (Contrainte avec Logique) is a CLP language in which (possibly non-linear) polynomial equations can be written as constraints, while almost all the other CLP languages proposed so far have concentrated only on linear equations and inequations. This paper describes a general semantics of CLP including CAL, and shows the validity of CAL in this framework.