We try to formalize the intuitive reasoning which we normally use to get convinced that a query has successful LD-derivations in a program. To this purpose we define the class of programs and queries without failures which have the property of not having finitely failing derivations. Such property is simple to verify, it is preserved through leftmost unfolding and it can be useful both in verifying properties of logic programs and in program transformation. The class of programs without failures is very restricted but in program transformations it is sufficient that only some predicates in the program are in the class.
|Data di pubblicazione:||1998|
|Titolo:||Programs Without Failures|
|Titolo del libro:||Proceedings LOPSTR'97|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/3-540-49674-2_2|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|