David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
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)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
David 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.
Added to index2009-01-28
Total downloads2 ( #366,304 of 1,101,906 )
Recent downloads (6 months)1 ( #306,556 of 1,101,906 )
How can I increase my downloads?