In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in rule bodies but also in their heads.We start by introducing the notion of an update P U of a logic program P by another logic program U. Subsequently, we provide a precise semantic characterization of P U, and study some basic properties of program updates. In particular, we show that our update programs generalize the notion of interpretation update. We then extend this notion to compositional sequences of logic programs updates P1P2 ::: , dening a dynamic program update, and thereby introducing the paradigm of dynamic logic programming. This paradigm significantly facilitates modularization of logic programming, and thus modularization of nonmonotonic reasoning as a whole. Specically, suppose that we are given a set of logic program modules, each describing a dierent state of our knowledge of the world. Dierent states may represent dierent time points or dierent sets of priorities or perhaps even dierent viewpoints. Consequently, program modules may contain mutually contradictory as well as overlapping information. The role of the dynamic program update is to employ the mutual relationships existing between dierent modules to precisely determine, at any given module composition stage, the declarative as well as the procedural semantics of the combined program resulting from the modules.
|Title of host publication||Declarative Programming|
|Number of pages||16|
|Publication status||Published - Apr 1999|
|Event||Joint Conference on Declarative Programming (AGP) - |
Duration: 1 Jan 1998 → …
|Conference||Joint Conference on Declarative Programming (AGP)|
|Period||1/01/98 → …|