Weight Constraints as Nested Expressions

Details Weight Constraints as Nested Expressions Weight Constraints as Nested Expressions

2003-12-19

arxiv.org/abs/cs/0312045v1

Computer Science

Artificial Intelligence

To appear in Theory and Practice of Logic Programming

Scientific paper

We compare two recent extensions of the answer set (stable model) semantics of logic programs. One of them, due to Lifschitz, Tang and Turner, allows the bodies and heads of rules to contain nested expressions. The other, due to Niemela and Simons, uses weight constraints. We show that there is a simple, modular translation from the language of weight constraints into the language of nested expressions that preserves the program's answer sets. Nested expressions can be eliminated from the result of this translation in favor of additional atoms. The translation makes it possible to compute answer sets for some programs with weight constraints using satisfiability solvers, and to prove the strong equivalence of programs with weight constraints using the logic of here-and there.

Affiliated with

Also associated with

No associations

Rating

Weight Constraints as Nested Expressions 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 Weight Constraints as Nested Expressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weight Constraints as Nested Expressions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-198601