Pearce's Characterisation in an Epistemic Domain
[ X ]
Tarih
2025
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Open Publishing Association
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Answer-set programming (ASP) is a successful problem-solving approach in logic-based AI. In ASP, problems are represented as declarative logic programs, and solutions are identified through their answer sets. Equilibrium logic (EL) is a general-purpose nonmonotonic reasoning formalism, based on a monotonic logic called here-and-there logic. EL was basically proposed by Pearce as a foundational framework of ASP. Epistemic specifications (ES) are extensions of ASP-programs with subjective literals. These new modal constructs in the ASP-language make it possible to check whether a regular literal of ASP is true in every (or some) answer-set of a program. ES-programs are interpreted by world-views, which are essentially collections of answer-sets. (Reflexive) autoepistemic logic is a nonmonotonic formalism, modeling self-belief (knowledge) of ideally rational agents. A relatively new semantics for ES is based on a combination of EL and (reflexive) autoepistemic logic. In this paper, we first propose an overarching framework in the epistemic ASP domain. We then establish a correspondence between existing (reflexive) (auto)epistemic equilibrium logics and our easily-adaptable comprehensive framework, building on Pearce's characterisation of answer-sets as equilibrium models. We achieve this by extending Ferraris' work on answer sets for propositional theories to the epistemic case and reveal the relationship between some ES-semantic proposals. © 2025 Open Publishing Association. All rights reserved.
Açıklama
40th International Conference on Logic Programming, ICLP 2024 -- 14 October 2024 through 17 October 2024 -- Dallas -- 206842
Anahtar Kelimeler
Inductive logic programming (ILP), Majority logic, Program debugging, Answer set, Answer set programming, Declarative logic, Equilibrium logic, Literals, Logic programs, Monotonics, Non-monotonic reasoning, Problem-solving, Programming problem, Specification languages
Kaynak
Electronic Proceedings in Theoretical Computer Science, EPTCS
WoS Q Değeri
Scopus Q Değeri
Q4
Cilt
416
