A simple fixed point characterization of three-valued stable model semantics (Q1183439): Difference between revisions

This paper provides a simple fixed point characterization of the three- valued stable model semantics. Due to results by \textit{T. Przymusinski} [Fundam. Inf. 13 (4), 445-464 (1990; Zbl 0706.68029)] we also obtain a formally identical, but notationally and technically simpler characterization of the three-valued well-founded semantics than the one given in \textit{T. Przymusinski} [Every logic program has a natural stratification and an iterated fixed point model, Proc. 8th Symp. on Principles of Database systems, 11-21 (1989)]. Because of the constructive nature of this new formalization we also find it appropriate as the starting point of an algorithm for execution of restricted classes of logic programs (specifically datalog).