A Constructive Semantic Characterization of Aggregates in ASP

Details A Constructive Semantic Characterization of Aggregates in ASP A Constructive Semantic Characterization of Aggregates in ASP

2006-01-13

arxiv.org/abs/cs/0601051v2

Computer Science

Artificial Intelligence

21 pages

Scientific paper

This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator $\Phi^{aggr}_P$ for aggregate programs, independently proposed Pelov et al. This operator allows us to closely tie the computational complexity of the answer set checking and answer sets existence problems to the cost of checking a solution of the aggregates in the program. Finally, we relate the semantics described by the operator to other proposals for logic programming with aggregates. To appear in Theory and Practice of Logic Programming (TPLP).

Affiliated with

Also associated with

No associations

Rating

A Constructive Semantic Characterization of Aggregates in ASP 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 A Constructive Semantic Characterization of Aggregates in ASP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Constructive Semantic Characterization of Aggregates in ASP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-452101