Pearce's Characterisation in an Epistemic Domain

Basit Öğe Kaydı
dc.contributor.authorSu, Ezgi Iraz
dc.date.accessioned2025-03-23T19:17:27Z
dc.date.available2025-03-23T19:17:27Z
dc.date.issued2025
dc.departmentSinop Üniversitesi
dc.description40th International Conference on Logic Programming, ICLP 2024 -- 14 October 2024 through 17 October 2024 -- Dallas -- 206842
dc.description.abstractAnswer-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.
dc.identifier.doi10.4204/EPTCS.416.18
dc.identifier.endpage214
dc.identifier.issn2075-2180
dc.identifier.scopus2-s2.0-85218632461
dc.identifier.scopusqualityQ4
dc.identifier.startpage201
dc.identifier.urihttps://doi.org/10.4204/EPTCS.416.18
dc.identifier.urihttps://hdl.handle.net/11486/4356
dc.identifier.volume416
dc.indekslendigikaynakScopus
dc.institutionauthorSu, Ezgi Iraz
dc.language.isoen
dc.publisherOpen Publishing Association
dc.relation.ispartofElectronic Proceedings in Theoretical Computer Science, EPTCS
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_Scopus_20250323
dc.subjectInductive logic programming (ILP)
dc.subjectMajority logic
dc.subjectProgram debugging
dc.subjectAnswer set
dc.subjectAnswer set programming
dc.subjectDeclarative logic
dc.subjectEquilibrium logic
dc.subjectLiterals
dc.subjectLogic programs
dc.subjectMonotonics
dc.subjectNon-monotonic reasoning
dc.subjectProblem-solving
dc.subjectProgramming problem
dc.subjectSpecification languages
dc.titlePearce's Characterisation in an Epistemic Domain
dc.typeConference Object

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu