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 Niemel�a 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. KEYWORDS: answer sets, cardinality constraints, smodels, stable models, weight con- straints.

PS

Theory and Practice of Logic Programming, Vol. 5 (2005), pp. 45-74.

@article{fer05b, title={Weight Constraints as Nested Expressions}, author={Paolo Ferraris and Vladimir Lifschitz}, volume={5}, journal={Theory and Practice of Logic Programming}, pages={45-74}, url="http://www.cs.utexas.edu/users/ai-lab?fer05b", year={2005} }