Both logic programming in general and Prolog in particular have a long and fascinating
history, intermingled with that of many disciplines they inherited from or catalyzed. A large …

Dealing with contradiction Page 1 8. Dealing with contradiction As we've seen before, WFSX
is not defined for every program, ie some programs are contradictory and are given no …

This book is an updated version of my Ph. D. dissertation, The AND/OR Process Model for
Parallel Interpretation of Logic Programs. The three years since that paper was finished (or …

Current techniques for interpretation of logic programs involve a sequential search of a
global tree of procedure invocations. This dissertation introduces the AND/OR Process …

Logic programs offer many opportunities for parallelism. We present an abstract model that
exploits the parallelism due to nondeterministic choices in a logic program. A working …

A model for the coroutined execution of PROLOG programs is presented, and two control
primitives are described. Heuristics for the control of data-base and recursive procedures …

We present a selective backtracking method for Horn clause programs, as applied to Prolog
(2)(6)(11)(12), a programming language based on first-order predicate calculus (3)(4) …

This paper defines an abstract interpreter for logic programs based on a system of
asynchronous, independent processors which communicate only by passing messages …

We explore some connections between the technique of circumscription in artificial
intelligence and the notion of implicit definition in mathematical logic. Implicit definition can …

Execution of a logic program begins when the user provides an initial goal statement. The
interpreter computes values for variables of the goal through a series of resolutions. If the …