2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/30518We 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.33 pagesProgramming LanguagesLogic in Computer ScienceD.1.6;D.3.1;F.3.2text