A connection between the Cantor–Bendixson derivative and the well-founded semantics of finite logic programs
Annals of Mathematics and Artificial Intelligence, Volume 65, Issue 1, 2012, Pages 1-24.
Logic programWell-founded semanticsCantor–Bendixson derivative68T2703B70More(1+)
Results of Schlipf (J Comput Syst Sci 51:64---86, 1995) and Fitting (Theor Comput Sci 278:25---51, 2001) show that the well-founded semantics of a finite predicate logic program can be quite complex. In this paper, we show that there is a close connection between the construction of the perfect kernel of a $\Pi^0_1$ class via the iteratio...More
Full Text (Upload PDF)
PPT (Upload PPT)