Logic programs with propositional connectives and aggregates

Details Logic programs with propositional connectives and aggregates Logic programs with propositional connectives and aggregates

2008-12-08

arxiv.org/abs/0812.1462v1

Computer Science

Artificial Intelligence

Scientific paper

Answer set programming (ASP) is a logic programming paradigm that can be used to solve complex combinatorial search problems. Aggregates are an ASP construct that plays an important role in many applications. Defining a satisfactory semantics of aggregates turned out to be a difficult problem, and in this paper we propose a new approach, based on an analogy between aggregates and propositional connectives. First, we extend the definition of an answer set/stable model to cover arbitrary propositional theories; then we define aggregates on top of them both as primitive constructs and as abbreviations for formulas. Our definition of an aggregate combines expressiveness and simplicity, and it inherits many theorems about programs with nested expressions, such as theorems about strong equivalence and splitting.

Affiliated with

Also associated with

No associations

Rating

Logic programs with propositional connectives and aggregates 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 Logic programs with propositional connectives and aggregates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic programs with propositional connectives and aggregates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318905