A tarskian informal semantics for answer set programming

Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

23 Scopus citations

Abstract

In their seminal papers on stable model semantics, Gelfond and Lifschitz introduced ASP by casting programs as epistemic theories, in which rules represent statements about the knowledge of a rational agent. To the best of our knowledge, theirs is still the only published systematic account of the intuitive meaning of rules and programs under the stable semantics. In current ASP practice, however, we find numerous applications in which rational agents no longer seem to play any role. Therefore, we propose here an alternative explanation of the intuitive meaning of ASP programs, in which they are not viewed as statements about an agent's beliefs, but as objective statements about the world. We argue that this view is more natural for a large part of current ASP practice, in particular the so-called Generate-Define-Test programs.

Original languageEnglish
Title of host publicationTechnical Communications of the 28th International Conference on Logic Programming, ICLP 2012
Pages277-289
Number of pages13
DOIs
StatePublished - 2012
Event28th International Conference on Logic Programming, ICLP 2012 - Budapest, Hungary
Duration: Sep 4 2012Sep 8 2012

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume17
ISSN (Print)1868-8969

Conference

Conference28th International Conference on Logic Programming, ICLP 2012
Country/TerritoryHungary
CityBudapest
Period9/4/129/8/12

Keywords

  • Answer set programming
  • Generate-define-test
  • Informal semantics

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'A tarskian informal semantics for answer set programming'. Together they form a unique fingerprint.

Cite this