A reductive semantics for counting and choice in answer set programming
| Abstract | In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions as abbreviations. We follow up on that suggestion and introduce an answer set programming language that defines the mean- ing of counting and choice by reducing these constructs to first-order formulas. For the new language, the concept of a safe program is defined, and its semantic role is investigated. We compare the new language with the concept of a disjunc- tive program with aggregates introduced by Faber, Leone and Pfeifer, and discuss the possibility of implementing a frag- ment of the language by translating it into the input language of the answer set solver DLV. The language is also compared with cardinality constraint programs defined by Syrjänen. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesDavid Pearce & Agustín Valverde (2005). A First Order Nonmonotonic Extension of Constructive Logic. Studia Logica 80 (2-3):321 - 346.
Uwe Egly, Sarah Alice Gaggl & Stefan Woltran (2011). Answer-Set Programming Encodings for Argumentation Frameworks. Argument and Computation 1 (2):147-177.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #277,406 of 556,896 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
