Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms

Details Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms

2011-10-10

arxiv.org/abs/1110.2205v1

Journal Of Artificial Intelligence Research, Volume 29, pages 353-389, 2007

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.2171

In this paper, we present two alternative approaches to defining answer sets for logic programs with arbitrary types of abstract constraint atoms (c-atoms). These approaches generalize the fixpoint-based and the level mapping based answer set semantics of normal logic programs to the case of logic programs with arbitrary types of c-atoms. The results are four different answer set definitions which are equivalent when applied to normal logic programs. The standard fixpoint-based semantics of logic programs is generalized in two directions, called answer set by reduct and answer set by complement. These definitions, which differ from each other in the treatment of negation-as-failure (naf) atoms, make use of an immediate consequence operator to perform answer set checking, whose definition relies on the notion of conditional satisfaction of c-atoms w.r.t. a pair of interpretations. The other two definitions, called strongly and weakly well-supported models, are generalizations of the notion of well-supported models of normal logic programs to the case of programs with c-atoms. As for the case of fixpoint-based semantics, the difference between these two definitions is rooted in the treatment of naf atoms. We prove that answer sets by reduct (resp. by complement) are equivalent to weakly (resp. strongly) well-supported models of a program, thus generalizing the theorem on the correspondence between stable models and well-supported models of a normal logic program to the class of programs with c-atoms. We show that the newly defined semantics coincide with previously introduced semantics for logic programs with monotone c-atoms, and they extend the original answer set semantics of normal logic programs. We also study some properties of answer sets of programs with c-atoms, and relate our definitions to several semantics for logic programs with aggregates presented in the literature.

Affiliated with

Also associated with

No associations

Rating

Answer Sets for Logic Programs with Arbitrary Abstract 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 Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471061