Learn More
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 one logic program P by another logic program U. Subsequently,(More)
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 ,(More)
Most of the work conducted so far in the eld of logic programming has focused on representing static knowledge, i.e. knowledge that does not evolve with time. To overcome this limitation, in a recent paper, the authors introduced the concept of dynamic logic programming. There, they studied and deened the declarative and operational semantics of sequences(More)
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics 22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised 11]. This relationship improves the cross{fertilization between(More)
Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. In this paper we describe a simple though quite powerful approach to modelling the updates of knowledge bases expressed by generalized logic programs, by means of a new language, hereby christened EVOLP (after EVOlving Logic P rograms).(More)
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases [52], and it is based on an adaptation of the Stable Model Semantics to knowledge bases(More)
Abductive logic programming offers a formalism to declaratively express and solve problems in areas such as diagnosis, planning, belief revision and hypothetical reasoning. Tabled logic programming offers a computational mechanism that provides a level of declarativ-ity superior to that of Prolog, and which has supported successful applications in fields(More)
The evolution of logic programming semantics has included the introduction of a new explicit form of negation, beside the older implicit (or default) negation typical of logic programming. The richer language has been shown adequate for a spate of knowledge representation and reasoning forms. The widespread use of such extended programs requires the(More)
This paper reports on the use of logic program updates to models actions that bring about changes in knowledge states describing the world and its rules. The LUPS language is employed to specify concurrent update rules to model actions that depend on, and change, rule rich world states, not described simply by propositional uents. This language and(More)