Metalogical control for logic programs

https://doi.org/10.1016/0743-1066(85)90019-6Get rights and content
Under an Elsevier user license
open archive

Abstract

An alternative computational “model” for logic programs is proposed which is based upon control annotations written in first-order predicate calculus. These annotations are used to generate runtime environments within which it is possible to exclude infinite computations. The major advantage of such a model is that it is possible to write conceptually transparent programs which otherwise would not have terminated under an existing naive control mechanism.

Cited by (0)

Current address: School of Computing Sciences, New South Wales Institute of Technology, P.O. Box 123, Broadway 2007, Australia.