The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms
[article]
2009
arXiv
pre-print
This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We introduce a succinct abstract representation of these constraint atoms in which a constraint atom is represented compactly. We show two applications. First, under this representation of constraint atoms, we generalize the Gelfond-Lifschitz transformation and apply it to define stable models (also called answer sets) for logic programs with arbitrary constraint atoms. The
arXiv:0904.4727v1
fatcat:wbjal5ctuzbnpozazmk442c2ym