Well-Terminating, Input-Driven Logic Programs

Smaus, Jan-Georg (1998) Well-Terminating, Input-Driven Logic Programs. Technical report. University of Kent (Full text available)

Postscript
Download (198kB)
[img]
Preview
PDF
Download (217kB)
[img]
Preview

Abstract

We identify a class of predicates for which termination does not depend on left-to-right execution. All that is required is that derivations are input-driven that is, in each derivation step, the input arguments of the selected atom do not become instantiated. The method of showing that a predicate is in that class is based on level mappings, closely following the traditional approach for LD derivations. Many predicates terminate under such weak assumptions. Knowing these predicates can be a very useful part of a more comprehensive method of showing termination, which would have to make more specific assumptions about the selection rule.

Item Type: Monograph (Technical report)
Uncontrolled keywords: Logic programming, termination, modes, selection rules
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 25 Aug 2009 17:10
Last Modified: 06 Sep 2011 03:59
Resource URI: http://kar.kent.ac.uk/id/eprint/21583 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year