Some Remarks on the Completed Database¹

Article type: Research Article

Authors: Kunen, Kenneth^{; *}

Affiliations: Computer Sciences Department, University of Wisconsin, Madison, WI53706, USA, E-mail: kunen@cs.wisc.edu

Note: [1] A shortened version of this paper was presented at the Fifth International Conference Symposium on Logic Programming, Seattle, 1988

Note: [*] This research was supported by NSF Grant DMS-8501521.

Abstract: We show how Clark’s Completed Database (CDB) can be extended to include a number of Prolog constructs usually considered to be outside of pure logic, while still maintaining the known partial completeness results for SLDNF derivations. We also prove that in the semantics provided by the CDB and SLDNF, there is no definition of transitive closure which is strict and does not use function symbols.

DOI: 10.3233/FI-1990-13105

Journal: Fundamenta Informaticae, vol. 13, no. 1, pp. 35-49, 1990