๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Compositionality of normal open logic programs

โœ Scribed by Sofie Verbaeten; Marc Denecker; Danny de Schreye

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
252 KB
Volume
42
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 deยฎnite 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 on 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 oer dierent sucient 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.

๐Ÿ“œ SIMILAR VOLUMES

Completing open logic programs by constr
Completing open logic programs by constructive induction
โœ Esra Erdem; Pierre Flener ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 247 KB

We consider part of the problem of schema-biased inductive synthesis of recursive logic ลฝ programs from incomplete specifications, such as clausal evidence for instance, but not . necessarily, ground positive and negative examples . After synthesizing the base clause ลฝ . and introducing recursive ca

On the equivalence of semantics for norm
On the equivalence of semantics for normal logic programs
โœ Jia-Huai You; Li Yan Yuan ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 699 KB

Despite the frequent comment that there is no general agreement on the semantics of logic programs, this paper shows that a number of independently proposed extensions to the stable model semantics coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by