A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the relations between stable and well-founded semantics of logic programs
1992
Theoretical Computer Science
Dung, P.M., On the relations between stable and well-founded semantics of logic programs, Theoretical Computer Science 105 (1992) 7-25. We study the relations between stable and well-founded semantics of logic programs. (1) We show that stable semantics can be defined in the same way as well-founded semantics based on the basic notion of unfounded sets. Hence, stable semantics can be considered as "two-valued well-founded semantics". (2) An axiomatic characterization of stable and well-founded
doi:10.1016/0304-3975(92)90285-n
fatcat:nlng3ns3are37ilruxydzvlouu