CAL: A theoretical background of constraint logic programming and its applications
type: Item
instance of: scholarly article
title: CAL: A theoretical background of constraint logic programming and its applications
zbMATH Open document ID: 0693.68009
DOI: 10.1016/S0747-7171(89)80063-X
author: Akira Aiba
author: Ko Sakai
published in: Journal of Symbolic Computation
publication date: 1989-01-01T00:00:00Z
review text: 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 nonlinear) polynomial equations can be written as constraints, while almost all the other CLP language 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.
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68T99
zbMATH DE Number: 4135382
zbMATH Keywords: logic programming
zbMATH Keywords: CLP language
zbMATH Keywords: semantics
reviewed by: Kokichi Sakai
describes a project that uses: CHIP
MaRDI profile type: Publication
cites work: Q3714165
cites work: Solving a cutting-stock problem with the constraint logic programming language CHIP
cites work: REF-ARF: A system for solving problems stated as procedures
cites work: Q4391452
cites work: Q3716279
cites work: Q3339245
cites work: Q3742690
cites work: The Semantics of Predicate Logic as a Programming Language
full work available at URL: s0747-7171(89)80063-x
OpenAlex ID: W2018083690
description: scientific article; zbMATH DE number 4135382