A reductive semantics for counting and choice in answer set programming

Joohyung Lee, Vladimir Lifschitz, Ravi Palla

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Scopus citations

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 meaning 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 disjunctive program with aggregates introduced by Faber, Leone and Pfeifer, and discuss the possibility of implementing a fragment 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.

Original languageEnglish (US)
Title of host publicationAAAI-08/IAAI-08 Proceedings - 23rd AAAI Conference on Artificial Intelligence and the 20th Innovative Applications of Artificial Intelligence Conference
Pages472-479
Number of pages8
StatePublished - Dec 24 2008
Event23rd AAAI Conference on Artificial Intelligence and the 20th Innovative Applications of Artificial Intelligence Conference, AAAI-08/IAAI-08 - Chicago, IL, United States
Duration: Jul 13 2008Jul 17 2008

Publication series

NameProceedings of the National Conference on Artificial Intelligence
Volume1

Other

Other23rd AAAI Conference on Artificial Intelligence and the 20th Innovative Applications of Artificial Intelligence Conference, AAAI-08/IAAI-08
CountryUnited States
CityChicago, IL
Period7/13/087/17/08

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A reductive semantics for counting and choice in answer set programming'. Together they form a unique fingerprint.

  • Cite this

    Lee, J., Lifschitz, V., & Palla, R. (2008). A reductive semantics for counting and choice in answer set programming. In AAAI-08/IAAI-08 Proceedings - 23rd AAAI Conference on Artificial Intelligence and the 20th Innovative Applications of Artificial Intelligence Conference (pp. 472-479). (Proceedings of the National Conference on Artificial Intelligence; Vol. 1).