A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf
.
Strong Negation in Well-Founded and Partial Stable Semantics for Logic Programs
[chapter]
2006
Lecture Notes in Computer Science
A formalism called partial equilibrium logic (PEL) has recently been proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. In PEL one defines a class of minimal models, called partial equilibrium models, in a non-classical logic, HT 2 . On logic programs partial equilibrium models coincide with Przymusinski's partial stable (p-stable) models, so that PEL can be seen as a way to extend WFS and p-stable semantics to arbitrary propositional theories. We study
doi:10.1007/11874850_63
fatcat:qdlb2k7gg5ghfb3rjpjykbi4ce