A Compositional Semantics for Normal Open Programs

Sandro Etalle; Frank Teusink

A Compositional Semantics for Normal Open Programs

Sandro Etalle
, Frank Teusink

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

25 Downloads (Pure)

Abstract

In this paper we propose a semantics for first order modular (open) programs. Modular programs are built as a combination of separate modules, which may evolve separately, and be verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial role: the semantics of the whole program must be obtainable as a simple function from the semantics of its individual modules. In this paper we propose such a compositional semantics for first-order programs. This semantics is correct with respect to the set of logical consequences of the program. Moreoverr, - in contrast with other approaches - it is always computable. Furthermore, we show how our results on firs-order programs may be applied in a straightforward way to normal logic programs, in which case our semantics might be regarded as a compositional counterpart of Kunen's semantics. Finally we discuss and show how these results hav to be modified in order to be applied to normal CLP.

Original language	English
Title of host publication	Logic Programming
Subtitle of host publication	Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, Bonn, Germany, September 2-6, 1996
Editors	Michael Maher
Publisher	MIT Press
Pages	468-482
Number of pages	15
ISBN (Electronic)	9780262291309
ISBN (Print)	0-262-63173-3
Publication status	Published - 1996
Event	13th Joint International Conference and Symposium on Logic Programming, JICSLP 1996 - Bonn, Germany Duration: 2 Sept 1996 → 6 Sept 1996 Conference number: 13

Conference

Conference	13th Joint International Conference and Symposium on Logic Programming, JICSLP 1996
Abbreviated title	JICSLP
Country/Territory	Germany
City	Bonn
Period	2/09/96 → 6/09/96

Access to Document

Etalle1996compositionalAccepted author version, 274 KB

https://ieeexplore.ieee.org/document/6278906

Cite this

@inproceedings{15653b265e2842ccb6c7b34967415508,

title = "A Compositional Semantics for Normal Open Programs",

abstract = "In this paper we propose a semantics for first order modular (open) programs. Modular programs are built as a combination of separate modules, which may evolve separately, and be verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial role: the semantics of the whole program must be obtainable as a simple function from the semantics of its individual modules. In this paper we propose such a compositional semantics for first-order programs. This semantics is correct with respect to the set of logical consequences of the program. Moreoverr, - in contrast with other approaches - it is always computable. Furthermore, we show how our results on firs-order programs may be applied in a straightforward way to normal logic programs, in which case our semantics might be regarded as a compositional counterpart of Kunen's semantics. Finally we discuss and show how these results hav to be modified in order to be applied to normal CLP.",

author = "Sandro Etalle and Frank Teusink",

year = "1996",

language = "English",

isbn = "0-262-63173-3",

pages = "468--482",

editor = "Michael Maher",

booktitle = "Logic Programming",

publisher = "MIT Press",

address = "United States",

note = "13th Joint International Conference and Symposium on Logic Programming, JICSLP 1996, JICSLP ; Conference date: 02-09-1996 Through 06-09-1996",

}

Etalle, S & Teusink, F 1996, A Compositional Semantics for Normal Open Programs. in M Maher (ed.), Logic Programming: Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, Bonn, Germany, September 2-6, 1996. MIT Press, pp. 468-482, 13th Joint International Conference and Symposium on Logic Programming, JICSLP 1996, Bonn, Germany, 2/09/96. <https://ieeexplore.ieee.org/document/6278906>

A Compositional Semantics for Normal Open Programs. / Etalle, Sandro; Teusink, Frank.
Logic Programming: Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, Bonn, Germany, September 2-6, 1996. ed. / Michael Maher. MIT Press, 1996. p. 468-482.

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

TY - GEN

T1 - A Compositional Semantics for Normal Open Programs

AU - Etalle, Sandro

AU - Teusink, Frank

N1 - Conference code: 13

PY - 1996

Y1 - 1996

N2 - In this paper we propose a semantics for first order modular (open) programs. Modular programs are built as a combination of separate modules, which may evolve separately, and be verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial role: the semantics of the whole program must be obtainable as a simple function from the semantics of its individual modules. In this paper we propose such a compositional semantics for first-order programs. This semantics is correct with respect to the set of logical consequences of the program. Moreoverr, - in contrast with other approaches - it is always computable. Furthermore, we show how our results on firs-order programs may be applied in a straightforward way to normal logic programs, in which case our semantics might be regarded as a compositional counterpart of Kunen's semantics. Finally we discuss and show how these results hav to be modified in order to be applied to normal CLP.

AB - In this paper we propose a semantics for first order modular (open) programs. Modular programs are built as a combination of separate modules, which may evolve separately, and be verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial role: the semantics of the whole program must be obtainable as a simple function from the semantics of its individual modules. In this paper we propose such a compositional semantics for first-order programs. This semantics is correct with respect to the set of logical consequences of the program. Moreoverr, - in contrast with other approaches - it is always computable. Furthermore, we show how our results on firs-order programs may be applied in a straightforward way to normal logic programs, in which case our semantics might be regarded as a compositional counterpart of Kunen's semantics. Finally we discuss and show how these results hav to be modified in order to be applied to normal CLP.

M3 - Conference contribution

SN - 0-262-63173-3

SP - 468

EP - 482

BT - Logic Programming

A2 - Maher, Michael

PB - MIT Press

T2 - 13th Joint International Conference and Symposium on Logic Programming, JICSLP 1996

Y2 - 2 September 1996 through 6 September 1996

ER -

A Compositional Semantics for Normal Open Programs

Abstract

Conference

Access to Document

Fingerprint

Cite this