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 Sep 1996 → 6 Sep 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 |