Well Founded Semantics for Logic Program Updates

Operational Semantics for DyLPs

“…Different semantics have been proposed [1,2,5,6,8,15,18,19,23] that assign meaning to arbitrary finite sequences P 1 , . .…”

“…A rule is rejected whenever it is in conflict with a newly added one (causal rejection of rules). Most of the semantics defined for DyLPs [1,2,5,6,8,15] are based on such a concept of causal rejection.…”

“…With the exception of the semantics proposed in [5], these semantics are extensions of the stable model semantics [10] to DyLPs and are proved to coincide on large classes of programs [8,11,13]. In [1] the authors provide theoretical results which strongly suggest that the refined semantics [1] should be regarded as the proper stable model-like semantics for DyLPs based on causal rejection.…”

“…As discussed in [5], though a stable model-like semantics is the most suitable option for several application domains 1 other domains exist, whose specificities require a different approach. In particular, domains with huge amount of distributed and heterogenous data require an approach to automated reasoning capable of quickly processing knowledge, and of dealing with inconsistent information even at the cost of losing some inference power.…”

“…Such areas demand a different choice of basic semantics, such as the well founded semantics [9]. In [5] a well founded paraconsistent semantics for DyLPs (WFDy) is defined. The WFDy semantics is shown to be a skeptical approximation of the refined semantic defined in [1].…”