Declarative Semantics of Input Consuming Logic Programs

13 years 9 months ago

Download www.dsi.unive.it

Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been introduced to deynamic scheduling while abstracting from the technical details. In this paper we review and compare the diﬀerent proposals given in [?], [?] and [?] for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.

Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sa

Real-time Traffic

Dynamic Scheduling | Input Consuming Derivations | LOPSTR 2004 | Most Logic Programming |

claim paper

» A Declarative View of Inheritance in Logic Programming

» Whats in a model Epistemological analysis of Logic Programming

» Paraconsistent Declarative Semantics for Extended Logic Programs

» Declarative Network Verification

» ReexecutionBased Analysis of Logic Programs with Delay Declarations

» A Declarative Agent Programming Language Based on Action Theories

» A lazy narrowing calculus for declarative constraint programming

» A Declarative Debugging System for Lazy Functional Logic Programs

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	LOPSTR
Authors	Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi

Comments (0)

Sciweavers

Declarative Semantics of Input Consuming Logic Programs

Dynamic Scheduling | Input Consuming Derivations | LOPSTR 2004 | Most Logic Programming |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers