IDA Dept. of Computer and Information science, Linköping University

IDA Technical Reports: abstract

Generated: Sat, 25 Feb 2017 05:34:24

Drabent, W. and Martelli, M. (1989). Strict Completion of Logic Programs. Technical Report LiTH-IDA-R-89-28, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),

Abstract: The paper presents a new approach to the problem of completeness of the SLDNF-resolution. We propose a different reference theory that we call strict completion. This new concept of completion (comp*(P)) is based on a program transformation that given any program transforms it into a strict one (with the same computational behaviour) and the usual notion of program completion. We consider it a reasonable reference theory to discuss program semantics and completeness results. The new comp*(P) is always consistent and the completeness of all allowed programs and goals w.r.t. comp*(P) is proved.

Goto (at Linköping University): CS Dept TR Overview