Properties of Input-Consuming Derivations
| dc.creator | Bossi, Annalisa | |
| dc.creator | Etalle, Sandro | |
| dc.creator | Rossi, Sabina | |
| dc.date | 2001-01-23 | |
| dc.date.accessioned | 2026-07-07T03:16:52Z | |
| dc.date.available | 2026-07-07T03:16:52Z | |
| dc.description | We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations 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 a weak version of the well-known switching lemma holds also for input-consuming derivations. Furthermore, we show that, under suitable conditions, there exists an algebraic characterization of termination of input-consuming derivations. | |
| dc.description | 33 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0101023 | |
| dc.identifier | http://arxiv.org/abs/cs/0101023 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30518 | |
| dc.subject | Programming Languages | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.1.6;D.3.1;F.3.2 | |
| dc.title | Properties of Input-Consuming Derivations | |
| dc.type | text |