Logic Programming: Operational Semantics and Proof Theory

Dr. Andrews provides a homogeneous treatment for the semantics (operational and logical) of both theoretical and practical logic programming languages. He demonstrates that the rift between theory and practice in logic programming can be bridged. He achieves this by precisely characterizing the way in which "depth-first" search for solutions to a logical formula--the usual strategy in most practical languages--is incomplete. Languages that perform "breadth-first" searches reflect more closely the theory underlying logic programming languages.