Drabent, W. (1993). On Completeness of SLDNF-Resolution. Technical Report LiTH-IDA-R-93-38, Department of Computer and Information Science, Linköping University, Sweden. This material was presented at a poster session at International Logic Programming Symposium, Vancouver, Canada, October 1993. (bibtex),
Abstract: In this paper we prove completeness of SLDNF-resolution for arbitrary programs, fair computation rules and non-floundering queries. For this we need an appropriate notion of floundering. We introduce two versions of this notion, one simple but crude, the other more sophisticated. We also show how the 3-valued completion semantics can be expressed in terms of the classical 2-valued logic.
CS Dept TR Overview