Nondeterministic Lisp as a Substrate for Constraint Logic Programming

Abstract

We have implemented a comprehensive constraintbased programming language as an extension to Common Lisp. This constraint package provides a unified framework for solving both numeric and non-numeric systems of constraints using a combination of local propagation techniques including binding propagation, Boolean constraint propagation, generalized forward checking, propagation of bounds, and unification. The backtracking facility of the nondeterministic dialect of Common Lisp used to implement this constraint package acts as a general fallback constraint solving method mitigating the incompleteness of local propagation. Introduction Recent years have seen significant interest in constraint logic programming languages. Numerous implementations of such languages have been described in the literature, notably clp(!) (Jaffar and Lassez 1987) and CHiP (Van Hentenryck 1989). The point of departure leading to these systems is the observation that the unification operation at the core of lo...

Cite

Text

Siskind and McAllester. "Nondeterministic Lisp as a Substrate for Constraint Logic Programming." AAAI Conference on Artificial Intelligence, 1993.

Markdown

[Siskind and McAllester. "Nondeterministic Lisp as a Substrate for Constraint Logic Programming." AAAI Conference on Artificial Intelligence, 1993.](https://mlanthology.org/aaai/1993/siskind1993aaai-nondeterministic/)

BibTeX

@inproceedings{siskind1993aaai-nondeterministic,
  title     = {{Nondeterministic Lisp as a Substrate for Constraint Logic Programming}},
  author    = {Siskind, Jeffrey Mark and McAllester, David A.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1993},
  pages     = {133-138},
  url       = {https://mlanthology.org/aaai/1993/siskind1993aaai-nondeterministic/}
}