Strictly level-decreasing logic programs

Authors:
Anthony Karel Seda;Pascal Hitzler
Affiliations:
Department of Mathematics, National University of Ireland, Cork, Ireland;Mathematische Fakultät, Universität Tübingen, Tübingen, Germany
Venue:
IW-FM'98 Proceedings of the 2nd Irish conference on Formal Methods
Year:
1998

Citing 7
Cited 3

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
Topology

Handbook of logic in computer science (vol. 1)
Reasoning about termination of pure Prolog programs

Information and Computation
Dynamical systems, measures, and fractals via domain theory

Information and Computation
Quasi-metrics and the semantics of logic programs

Fundamenta Informaticae
Topology And The Semantics Of Logic Programs

Fundamenta Informaticae

Approximating the Semantics of Logic Programs by Recurrent Neural Networks

Applied Intelligence
Characterizations of Classes of Programs by Three-Valued Operators

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
A geometric interpretation of LD-resolution

Theoretical Computer Science - Logic, semantics and theory of programming

Quantified Score

Hi-index	0.00

Visualization

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.