© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Determinancy Inference for Logic Programs
Lunjin Lu and Andy King
Technical Report 19-04, University of Kent, Computing Laboratory, University of Kent, October 2004.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.
Download publication 383 kbytes (PostScript)Bibtex Record
@techreport{1990, author = {Lunjin Lu and Andy King}, title = {Determinancy {I}nference for {L}ogic {P}rograms}, month = {October}, year = {2004}, pages = {182-196}, keywords = {determinacy analysis, Craig interpolants}, note = {}, doi = {}, url = {http://www.cs.kent.ac.uk/pubs/2004/1990}, publication_type = {techreport}, submission_id = {19197_1098432244}, number = {19-04}, address = {University of Kent}, institution = {University of Kent, Computing Laboratory}, }