Document Type
Conference Proceeding
Publication Date
2012
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.
Recommended Citation
Denecker, Marc; Lierler, Yuliya; Truszczyński, Miroslaw; and Vennekens, Joost, "A Tarskian Informal Semantics for Answer Set Programming" (2012). Computer Science Faculty Proceedings & Presentations. 1.
https://digitalcommons.unomaha.edu/compsicfacproc/1
Comments
© Marc Denecker, Yulia Lierler, Miroslaw Truszczynski and Joost Vennekens; licensed under Creative Commons License NC-ND 28th International Conference on Logic Programming.