Text size
  • Small
  • Medium
  • Large
Contrast
  • Standard
  • Blue text on blue
  • High contrast (Yellow text on black)
  • Blue text on beige

    Strictly Level-Decreasing Logic Programs

    2nd Irish Workshop on Formal Methods

    Cork, Ireland. 2nd - 3rd July 1998

    AUTHORS

    A.K. Seda & P. Hitzler

    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.

    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.

    PAPER FORMATS

    PDF filePDF Version of this Paper (244kb)