Semantics of well-moded input-consuming logic programs

Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically "delayed" until their arguments are su ciently instantiated. To this end, logic languages are extended with constructs such as delay declarations. However, many declarative properties that hold for logic and pure Prolog programs do not apply any longer in this extended setting. In particular, the equivalence between the model

• Type: Journal
• Year: 2000
• Where: CL
• Authors: Annalisa Bossi, Sandro Etalle, Sabina Rossi
• Keywords: Automated Reasoning, CL 2000, Dynamic Scheduling, Input-consuming Programs, Logic