Document Type
Conference Proceeding
Publication Date
1-1-1998
Abstract
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic programs, have both a highly intuitive declarative semantics, given as a unique supported model, and are computationally adequate in the sense that every partial recursive function can be represented by some sld-program P. Allowing for a safe use of cuts, an interpreter based on SLDNF-resolution, as implemented for example in standard Prolog systems, is shown to be sound and complete with respect to this class of programs. Furthermore, we study connections between topological dynamics and logic programming which are suggested by our approach to the declarative semantics of sld-programs.
Repository Citation
Hitzler, P.,
& Seda, A. K.
(1998). Strictly Level-Decreasing Logic Programs. Second Irish Workshop on Formal Methods (IWFM'98), 181-198.
https://corescholar.libraries.wright.edu/cse/22
Included in
Bioinformatics Commons, Communication Technology and New Media Commons, Databases and Information Systems Commons, OS and Networks Commons, Science and Technology Studies Commons
Comments
This paper was presented at the 2nd Irish Conference on Formal Methods in Cork, Ireland, July 2-3, 1998.
The posted PDF is the preprint version of the conference paper.