A methodology for managing hard constraints in CLP systems
Joxan Jaffar, Spiro Michaylov, et al.
PLDI 1991
An abstract machine is described for the CLP1992 programming language. It is intended as a first step toward enabling CLP(R) programs to be executed with efficiency approaching that of conventional languages. The core Constraint Logic Arithmetic Machine (CLAM) extends the Warren Abstract Machine (WAM) for compiling Prolog with facilities for handling real arithmetic constraints. The full CLAM includes facilities for taking advantage of information obtained from global program analysis. © 1992, ACM. All rights reserved.
Joxan Jaffar, Spiro Michaylov, et al.
PLDI 1991
Mattia Chiari, Shizhe Zhao, et al.
ICAPS 2019
Joxan Jaffar, Michael J. Maher, et al.
New Generation Computing
Joxan Jaffar, Spiro Michaylov, et al.
ACM Transactions on Programming Languages and Systems (TOPLAS)