Splitting Epistemic Logic Programs

12/20/2018
by   Pedro Cabalar, et al.
0

Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some regular literal is true in all stable models or in some stable model. As it can be imagined, the associated semantics has proved to be non-trivial, as the truth of the subjective literal 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. To this aim, 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 proposals fail to fulfill the epistemic splitting property, except the original semantics proposed by Gelfond in 1991.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/22/2019

Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting

In a recent line of research, two familiar concepts from logic programmi...
08/17/2021

Thirty years of Epistemic Specifications

The language of epistemic specifications and epistemic logic programs ex...
02/20/2019

Founded World Views with Autoepistemic Equilibrium Logic

Defined by Gelfond in 1991 (G91), epistemic specifications (or programs)...
08/05/2020

eclingo: A solver for Epistemic Logic Programs

We describe eclingo, a solver for epistemic logic programs under Gelfond...
03/14/2022

Strict stability of extension types

We show that the extension types occurring in Riehl–Shulman's work on sy...
10/01/2020

Constraint Monotonicity, Epistemic Splitting and Foundedness Could in General Be Too Strong in Answer Set Programming

Recently, the notions of subjective constraint monotonicity, epistemic s...
03/08/2000

A Splitting Set Theorem for Epistemic Specifications

Over the past decade a considerable amount of research has been done to ...