Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||
|
|
Bossi, A. and Etalle, S. and Rossi, S.
(1999)
Properties of Input-Consuming Derivations.
In: ICLP'99 International Conference on Logic Programming: Workshop on Verification of Logic Programs, December 1, 1999, Las Cruces, New Mexico.
pp. 1-23.
Electronic Notes in Theoretical Computer Science 30.
Elsevier.
ISSN 1571-0661
Full text available as:
Official URL: http://dx.doi.org/10.1016/S1571-0661(04)00116-1 AbstractWe 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.
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||
