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

10/01/2020
by   Yi-Dong Shen, et al.
0

Recently, the notions of subjective constraint monotonicity, epistemic splitting, and foundedness have been introduced for epistemic logic programs, with the aim to use them as main criteria respectively intuitions to compare different answer set semantics proposed in the literature on how they comply with these intuitions. In this note, we consider these three notions and demonstrate on some examples that they may be too strong in general and may exclude some desired answer sets respectively world views. In conclusion, these properties should not be regarded as mandatory properties that every answer set semantics must satisfy in general.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2019

Epistemic Logic Programs: A Different World View

Epistemic Logic Programs (ELPs), an extension of Answer Set Programming ...
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
03/08/2000

A Splitting Set Theorem for Epistemic Specifications

Over the past decade a considerable amount of research has been done to ...
research
12/20/2018

Splitting Epistemic Logic Programs

Epistemic logic programs constitute an extension of the stable models se...
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/05/2020

eclingo: A solver for Epistemic Logic Programs

We describe eclingo, a solver for epistemic logic programs under Gelfond...
research
02/20/2019

Founded World Views with Autoepistemic Equilibrium Logic

Defined by Gelfond in 1991 (G91), epistemic specifications (or programs)...

Please sign up or login with your details

Forgot password? Click here to reset