Epistemic answer set programming
Yükleniyor...
Dosyalar
Tarih
2019
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer International Publishing Ag
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
This paper introduces a new epistemic extension of answer set programming (ASP) called epistemic ASP (E-ASP). Then, it compares E-ASP with existing approaches, showing the advantages and the novelties of the new semantics and discusses which formalisms provide more intuitive results: compared to Gelfond's epistemic specifications (ES), E-ASP defines a simpler, but sufficiently strong language. Its epistemic view semantics is a natural and more standard generalisation of ASP's original answer set semantics, so it allows for ASP's previous language extensions. Moreover, compared to all semantics proposals in the literature, epistemic view semantics facilitates understanding of the intuitive meaning of epistemic logic programs and solves unintended results discussed in the literature, especially for epistemic logic programs including constraints.
Açıklama
16th European Conference on Logics in Artificial Intelligence (JELIA) -- MAY 07-11, 2019 -- Rende, ITALY
Anahtar Kelimeler
Answer Set Programming, Epistemic Specifications, Modal Logic S5, Stable Models, Answer Sets, World Views, Autoepistemic Equilibrium Models
Kaynak
Logics In Artificial Intelligence, Jelia 2019
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
11468
Sayı
Künye
Su, E. I. (2019, May). Epistemic answer set programming. In European Conference on Logics in Artificial Intelligence (pp. 608-626). Springer, Cham.
