On the Completeness of Residuation

Hanus, Michael

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1332046_2

DetailsSummary

Released

Conference Paper

On the Completeness of Residuation

MPS-Authors

/persons/resource/persons44582

Hanus, Michael
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Hanus, M. (1992). On the Completeness of Residuation. In K. Apt (Ed.), Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming (pp. 192-206). Cambridge, USA: MIT Press.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AE19-C

Abstract

Residuation is an operational mechanism for the integration of functions into logic programming languages. The residuation principle delays the evaluation of functions during the unification process until the arguments are sufficiently instantiated. This has the advantage that the deterministic nature of functions is preserved but the disadvantage of incompleteness: if the variables in a delayed function call are not instantiated by the logic program, this function can never be evaluated and some answers which are logical consequences of the program are lost. In this paper we present a method for detecting such situations. The method is based on a compile-time analysis of the program and approximates the possible residuations and instantiation states of variables during program execution.