Founded World Views with Autoepistemic Equilibrium Logic

02/20/2019
by   Pedro Cabalar, et al.
0

Defined by Gelfond in 1991 (G91), epistemic specifications (or programs) are an extension of logic programming under stable models semantics that introducessubjective literals. A subjective literal al-lows checking whether some regular literal is true in all (or in some of) the stable models of the program, being those models collected in a setcalledworld view. One epistemic program may yield several world views but, under the original G91 semantics, some of them resulted from self-supported derivations. During the last eight years, several alternative approaches have been proposed to get rid of these self-supported worldviews. Unfortunately, their success could only be measured by studying their behaviour on a set of common examples in the literature, since no formal property of "self-supportedness" had been defined. To fill this gap, we extend in this paper the idea of unfounded set from standard logic programming to the epistemic case. We define when a world view is founded with respect to some program and propose the foundedness property for any semantics whose world views are always founded. Using counterexamples, we explain that the previous approaches violate foundedness, and proceed to propose a new semantics based on a combination of Moore's Autoepistemic Logic and Pearce's Equilibrium Logic. The main result proves that this new semantics precisely captures the set of founded G91 world views.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2019

About epistemic negation and world views in Epistemic Logic Programs

In this paper we consider Epistemic Logic Programs, which extend Answer ...
research
07/22/2019

Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting

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

Thirty years of Epistemic Specifications

The language of epistemic specifications and epistemic logic programs ex...
research
12/20/2018

Splitting Epistemic Logic Programs

Epistemic logic programs constitute an extension of the stable models se...
research
08/05/2020

eclingo: A solver for Epistemic Logic Programs

We describe eclingo, a solver for epistemic logic programs under Gelfond...
research
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...
research
03/22/2018

The Epistemology of Nondeterminism

This paper proposes new semantics for nondeterministic program execution...

Please sign up or login with your details

Forgot password? Click here to reset