TY  - JOUR
A1  - Cabalar, Pedro
A1  - Fandiño, Jorge
A1  - Fariñas del Cerro, Luis
T1  - Splitting epistemic logic programs
T2  - Theory and practice of logic programming / publ. for the Association for Logic Programming
N2  - 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 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.
KW  - knowledge representation and nonmonotonic reasoning
KW  - logic programming methodology and applications
KW  - theory
Y1  - 2020
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/64634
SN  - 1471-0684
SN  - 1475-3081
VL  - 21
IS  - 3
SP  - 296
EP  - 316
PB  - Cambridge Univ. Press
CY  - Cambridge [u.a.]
ER  -