This article surveys the major developments in sequential Prolog implementation during the
period 1983–1993. In this decade, implementation technology has matured to such a …

A constraint can be thought of intuitively as a restriction on a space of possibilities.
Mathematical constraints are precisely specifiable relations among several unknowns (or …

Since the early days of logic programming, researchers in the field realized the potential for
exploitation of parallelism present in the execution of logic programs. Their high-level …

We present the clp (FD) system: a constraint logic programming language with finite domain
constraints. We detail its implementation, and present an abstract instruction set for the …

We are investigating the use of a class of logical formulas to define constraint theories and
implement constraint solvers at the same time. The representation of constraint evaluation in …

Abstract The Andorra Kernel Language (AKL) is introduced. It is shown how AKL provides
the programming paradigms of both Prolog and GHC. This is the original goal of the design …

We present a very simple but exible declarative debugging scheme. A declarative debugger
can be de ned in Prolog with a single clause and relies on the de nition of just two additional …

We introduce a constraint system called FT. This system offers a theoretical and practical
alternative to the usual Herbrand system of constraints over constructor trees. Like …

Muse (Mu lti-se quential Prolog engines) is a simple and efficient approach to Or-parallel
execution of Prolog programs. It is based on having several sequential Prolog engines, each …

This paper presents some fundamental properties of independent and-parallelism and
extends its applicability by enlarging the class of goals eligible for parallel execution. A …