A Generalisation of Epistemic Splitting Property

Basit Öğe Kaydı
dc.contributor.authorSu, Ezgi Iraz
dc.date.accessioned2025-03-23T19:47:04Z
dc.date.available2025-03-23T19:47:04Z
dc.date.issued2025
dc.departmentSinop Üniversitesi
dc.description17th International Conference on Logic Programming and Non-monotonic Reasoning -- OCT 11-14, 2024 -- Dallas, TX
dc.description.abstractAnswer-set programming (ASP) is a declarative logic programming paradigm that provides an efficient problem-solving approach in logic-based artificial intelligence (AI). While it has proven successful, ASP encounters specific situations where its language falls short of accurately representing and reasoning about incomplete information. Researchers now widely agree that ASP requires powerful introspective reasoning with the use of epistemic modal operators; yet, despite long-lasting debates on how to extend ASP with such operators, they cannot reach a consensus on satisfactory semantics. Cabalar et al. argue that such research should be grounded in formal robustness. Thus, inspired by ASP's foundational properties, they introduce a structural principle called epistemic splitting and designate it as one of the compulsory criteria for epistemic ASP. This paper generalises their approach to a more comprehensive, meticulous, and conservative extension of ASP-splitting, thereby enhancing its applicability and efficiency.
dc.description.sponsorshipThe University of Texas at Dallas
dc.description.sponsorshipMUR [Prot. 2020FNEB27]
dc.description.sponsorshipI sincerely thank the anonymous reviewers for their time and effort in providing valuable comments and suggestions on earlier drafts of this paper. I would also like to express my gratitude to the program co-chairs, Carmine Dodaro and Maria Vanina Martinez, as well as the general chair, Gopal Gupta, for their technical assistance. This work was partially supported by the MUR under the PRIN project PINPOINT Prot. 2020FNEB27.
dc.identifier.doi10.1007/978-3-031-74209-5_30
dc.identifier.endpage393
dc.identifier.isbn978-3-031-74208-8
dc.identifier.isbn978-3-031-74209-5
dc.identifier.issn2945-9133
dc.identifier.issn1611-3349
dc.identifier.scopus2-s2.0-85207641178
dc.identifier.scopusqualityQ3
dc.identifier.startpage380
dc.identifier.urihttps://doi.org/10.1007/978-3-031-74209-5_30
dc.identifier.urihttps://hdl.handle.net/11486/7272
dc.identifier.volume15245
dc.identifier.wosWOS:001420089700031
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.institutionauthorSu, Ezgi Iraz
dc.language.isoen
dc.publisherSpringer International Publishing Ag
dc.relation.ispartofLogic Programming and Nonmonotonic Reasoning, Lpnmr 2024
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WOS_20250323
dc.subjectAnswer-set programming
dc.subjectEquilibrium logic
dc.subjectEpistemic logic programs
dc.subjectEpistemic splitting property
dc.subjectSubjective constraint monotonicity
dc.titleA Generalisation of Epistemic Splitting Property
dc.typeConference Object

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu