Answer sets for propositional theories

  • Authors:

  • Paolo Ferraris

  • Affiliations:

  • Department of Computer Sciences, The University of Texas at Austin, Austin, TX

  • Venue:
  • LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case in which every formula is a “rule” — an implication that has no implications in the antecedent (body) and consequent (head). The semantics of equilibrium logic looks very different from the usual definitions of an answer set in logic programming, as it is based on Kripke models. In this paper we propose a new definition of equilibrium logic which uses the concept of a reduct, as in the standard definition of an answer set. Second, we apply the generalized concept of an answer set to the problem of defining the semantics of aggregates in answer set programming. We propose, in particular, a semantics for weight constraints that covers the problematic case of negative weights. Our semantics of aggregates is an extension of the approach due to Faber, Leone, and Pfeifer to a language with choice rules and, more generally, arbitrary rules with nested expressions.