Abstract machines for logic programs
Summary
The article presents turning logic programming rules into executable abstract machines by using stack-based state machines to evaluate ground queries like plus N M. It discusses mode assignments (inputs vs outputs), explores forward, backward, and nondeterministic execution, and connects these transformations to operational semantics and definitional interpreters with historical references.