Properties of Input-Consuming Derivations

Share/Save/Bookmark

Bossi, Annalisa and Etalle, Sandro and Rossi, Sabina (1999) Properties of Input-Consuming Derivations. In: Workshop on Verification of Logic Programs. Electronic Notes in Theoretical Computer Science, 30 (1). Elsevier, pp. 102-124.

[img]
Preview
PDF
202Kb
Abstract:We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations do not employ a fixed selection rule, and can be used to model the behavior of logic programs using dynamic scheduling and employing constructs such as delay declarations.
We consider the class of nicely-moded programs and queries. We show that for these programs one part of the well-known Switching Lemma holds also for input-consuming derivations. Furthermore, we provide conditions which guarantee that all input-consuming derivations starting in a Nicely-Moded query are finite. The method presented here is easy to apply and generalizes other related works.
Item Type:Book Section
Copyright:© 1999 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/56188
Official URL:http://dx.doi.org/10.1016/S1571-0661(04)00116-1
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page