Declarative Semantics of Input Consuming Logic Programs

Annalisa Bossi; Nicoletta Cocco; Sandro Etalle; Sabina Rossi

doi:10.1007/978-3-540-25951-0_4

Declarative Semantics of Input Consuming Logic Programs

Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

22 Downloads (Pure)

Abstract

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 describe dynamic scheduling while abstracting from the technical details. We review and compare the different proposals given in related work for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.

Original language	Undefined
Title of host publication	Program Development in Computational Logic
Editors	Maurice Bruynooghe, Kung-Kia Lau
Place of Publication	Berlin
Publisher	Springer
Pages	90-114
Number of pages	25
ISBN (Print)	3-540-22152-2
DOIs	https://doi.org/10.1007/978-3-540-25951-0_4
Publication status	Published - Jun 2004

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Verlag
Number	3049

Keywords

EWI-790
METIS-220391
IR-48686

Access to Document

10.1007/978-3-540-25951-0_4

000000ec

http://www.springeronline.com/sgw/cda/frontpage/0,10735,5-156-22-31559567-0,00.html

Cite this

@inbook{77352dd084ce4e5da950a55e339f82c6,

title = "Declarative Semantics of Input Consuming Logic Programs",

abstract = "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 describe dynamic scheduling while abstracting from the technical details. We review and compare the different proposals given in related work for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.",

keywords = "EWI-790, METIS-220391, IR-48686",

author = "Annalisa Bossi and Nicoletta Cocco and Sandro Etalle and Sabina Rossi",

note = "Imported from DIES",

year = "2004",

month = jun,

doi = "10.1007/978-3-540-25951-0_4",

language = "Undefined",

isbn = "3-540-22152-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "3049",

pages = "90--114",

editor = "Maurice Bruynooghe and Kung-Kia Lau",

booktitle = "Program Development in Computational Logic",

address = "Germany",

}

Declarative Semantics of Input Consuming Logic Programs. / Bossi, Annalisa; Cocco, Nicoletta; Etalle, Sandro et al.
Program Development in Computational Logic. ed. / Maurice Bruynooghe; Kung-Kia Lau. Berlin: Springer, 2004. p. 90-114 (Lecture Notes in Computer Science; No. 3049).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

TY - CHAP

T1 - Declarative Semantics of Input Consuming Logic Programs

AU - Bossi, Annalisa

AU - Cocco, Nicoletta

AU - Etalle, Sandro

AU - Rossi, Sabina

N1 - Imported from DIES

PY - 2004/6

Y1 - 2004/6

N2 - 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 describe dynamic scheduling while abstracting from the technical details. We review and compare the different proposals given in related work for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.

AB - 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 describe dynamic scheduling while abstracting from the technical details. We review and compare the different proposals given in related work for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.

KW - EWI-790

KW - METIS-220391

KW - IR-48686

U2 - 10.1007/978-3-540-25951-0_4

DO - 10.1007/978-3-540-25951-0_4

M3 - Chapter

SN - 3-540-22152-2

T3 - Lecture Notes in Computer Science

SP - 90

EP - 114

BT - Program Development in Computational Logic

A2 - Bruynooghe, Maurice

A2 - Lau, Kung-Kia

PB - Springer

CY - Berlin

ER -