Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms

Details Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms

2009-04-30

arxiv.org/abs/0904.4727v1

Computer Science

Artificial Intelligence

34 pages. To appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

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 resulting semantics turns out to coincide with the one defined by Son et al., which is based on a fixpoint approach. One advantage of our approach is that it can be applied, in a natural way, to define stable models for disjunctive logic programs with constraint atoms, which may appear in the disjunctive head as well as in the body of a rule. As a result, our approach to the stable model semantics for logic programs with constraint atoms generalizes a number of previous approaches. Second, we show that our abstract representation of constraint atoms provides a means to characterize dependencies of atoms in a program with constraint atoms, so that some standard characterizations and properties relying on these dependencies in the past for logic programs with ordinary atoms can be extended to logic programs with constraint atoms.

Affiliated with

Also associated with

No associations

Rating

Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-442528