Circular Belief in Logic Programming Semantics

In [HW02b, HW02a], a new methodology has been proposed which allows to derive uniform characterizations of different declarative semantics for logic programs with negation, and it has also been hinted at the possibility to use this novel approach in order to obtain new meaningful semantics for logic programs. In this paper, we substantiate this claim by proposing a new semantics which allows to deal with circular belief in logic programming. We will also show that this circular semantics makes it possible to encode uncertain knowledge with logic programs in a novel way