Determinancy Inference for Logic Programs

Lu, Lunjin and King, Andy (2004) Determinancy Inference for Logic Programs. Technical report. Springer , University of Kent

Postscript
Download (383Kb)	Preview
PDF
Download (279Kb)	Preview

Abstract

This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most one answer and that answer is generated only once. The principal component of the technique is a goal-independent analysis of individual clauses. This derives a condition for a call that ensures only one clause in the matching predicate possesses a successful derivation. Another key component of the analysis is backwards reasoning stage that strengthens these conditions to derive properties on a call that assure determinacy. The analysis has applications in program development, implementation and specialisation.

Item Type:	Monograph (Technical report)
Uncontrolled keywords:	abstract interpretation; logic programming; determinacy
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:	24 Nov 2008 18:01
Last Modified:	06 Sep 2011 01:21
Resource URI:	http://kar.kent.ac.uk/id/eprint/14066 (The current URI for this page, for reference purposes)

• Depositors only (login required):