LIPIcs.ICLP.2012.277.pdf
- Filesize: 0.49 MB
- 13 pages
Document
A Tarskian Informal Semantics for Answer Set Programming
Authors
-
Part of:
Volume:
Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (ICLP 2012)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2012-09-05
Cite AsGet BibTex
Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, and Joost Vennekens. A Tarskian Informal Semantics for Answer Set Programming. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 277-289, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.ICLP.2012.277
https://doi.org/10.4230/LIPIcs.ICLP.2012.277
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.
Keywords
- Answer set programming
- informal semantics
- generate-define-test
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads