• search hit 26 of 80
Back to Result List

Splitting epistemic logic programs

  • Epistemic logic programs constitute an extension of the stable model semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some objective literal is true in all or some stable models. As it can be imagined, the associated semantics has proved to be non-trivial, since the truth of subjective literals may interfere with the set of stable models it is supposed to query. As a consequence, no clear agreement has been reached and different semantic proposals have been made in the literature. Unfortunately, comparison among these proposals has been limited to a study of their effect on individual examples, rather than identifying general properties to be checked. In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case. We formally define when an arbitrary semantics satisfies the epistemic splitting property and examine some of the consequences that can be derived from that, including its relation toEpistemic logic programs constitute an extension of the stable model semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some objective literal is true in all or some stable models. As it can be imagined, the associated semantics has proved to be non-trivial, since the truth of subjective literals may interfere with the set of stable models it is supposed to query. As a consequence, no clear agreement has been reached and different semantic proposals have been made in the literature. Unfortunately, comparison among these proposals has been limited to a study of their effect on individual examples, rather than identifying general properties to be checked. In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case. We formally define when an arbitrary semantics satisfies the epistemic splitting property and examine some of the consequences that can be derived from that, including its relation to conformant planning and to epistemic constraints. Interestingly, we prove (through counterexamples) that most of the existing approaches fail to fulfill the epistemic splitting property, except the original semantics proposed by Gelfond 1991 and a recent proposal by the authors, called Founded Autoepistemic Equilibrium Logic.show moreshow less

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Pedro CabalarORCiDGND, Jorge FandiñoORCiD, Luis Fariñas del Cerro
DOI:https://doi.org/10.1017/S1471068420000058
ISSN:1471-0684
ISSN:1475-3081
Title of parent work (English):Theory and practice of logic programming / publ. for the Association for Logic Programming
Publisher:Cambridge Univ. Press
Place of publishing:Cambridge [u.a.]
Publication type:Article
Language:English
Date of first publication:2021/05/04
Publication year:2021
Release date:2024/07/05
Tag:knowledge representation and nonmonotonic reasoning; logic programming methodology and applications; theory
Volume:21
Issue:3
Article number:PII S1471068420000058
Number of pages:21
First page:296
Last Page:316
Funding institution:MINECO, SpainSpanish Government [TIC2017-84453-P]; Xunta de Galicia, SpainXunta de Galicia [GPC ED431B 2019/03]; Centre International de Mathematiques et d'Informatique de Toulouse (CIMI) [ANR-11-LABEX-0040-CIMI, ANR-11-IDEX-0002-02]; Alexander von Humboldt FoundationAlexander von Humboldt Foundation
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science
DDC classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Peer review:Referiert
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.