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)
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)
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)
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)
Abductive Logic Programming ooers a formalism to declaratively express and solve problems in areas such as diagnosis, planning, belief revision and hypothetical reasoning. Tabled Logic Programming ooers a computational mechanism that provides a level of declarativity above that of Prolog, and which has supported successful applications in elds such as(More)
According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. These may represent time (e.g. in updates), specificity (e.g. in taxonomies), strength of updating instance (e.g. in the legislative domain), hierarchical position of knowledge source (e.g. in(More)
In the same way as the " static " Semantic Web deals with data model and language heterogeneity and semantics that lead to RDF and OWL, there is language heterogeneity and the need for a semanti-cal account concerning Web dynamics. Thus, generic rule markup has to bridge these discrepancies, i.e., allow for composition of component languages, retaining(More)