Abstract
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.
Original language | Undefined |
---|---|
Pages (from-to) | 125-154 |
Number of pages | 30 |
Journal | Theory and practice of logic programming |
Volume | 2 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2002 |
Keywords
- IR-38138
- EWI-1755
- METIS-209050