Title: Compositionality of normal open logic programs
Authors: Verbaeten, Sofie ×
Denecker, Marc
De Schreye, Danny #
Issue Date: Mar-2000
Publisher: Elsevier science inc
Series Title: Journal of logic programming vol:42 issue:3 pages:151-183
Abstract: Compositionality of programs is an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly been studied for definite programs only. Here, we study compositionality in the context of normal open logic programming. This is a logic for knowledge representation in the context of uncertainty and incomplete knowledge an concepts and on problem domain, in which the compositionality issue turns up very naturally. The semantics of the logic is a generalisation (allowing non-Herbrand interpretations) of the well-founded semantics. We provide a number of results which offer different sufficient conditions under which the models of the composition of two theories can be related to the intersection of the models of the composing theories. In particular, under these conditions, logical consequence will be preserved under composition. (C) 2000 Elsevier Science Inc. All rights reserved.
ISSN: 0743-1066
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
2524.pdf Published 325KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science