@techreport{R-89-28,
TITLE = {Strict Completion of Logic Programs},
AUTHOR = {Wlodzimierz Drabent and Maurizio Martelli },
YEAR = {1989},
NUMBER = {R-89-28},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-89-28+abstr},
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.},
IDANR = {LiTH-IDA-R-89-28}