Constraint Monotonicity, Epistemic Splitting and Foundedness Are Too Strong in Answer Set Programming release_orelsuhg2zfjjbvqv6jcfvecp4

by Yi-Dong Shen, Thomas Eiter

Released as a article .

2020  

Abstract

Recently, some researchers in the community of answer set programming introduced the notions of subjective constraint monotonicity, epistemic splitting, and foundedness for epistemic logic programs, aiming to use them as main criteria/intuitions to compare different answer set semantics proposed in the literature on how they comply with these intuitions. In this note we demonstrate that these three properties are too strong and may exclude some desired answer sets/world views. Therefore, such properties should not be used as necessary conditions for answer set semantics.
In text/plain format

Archived Files and Locations

application/pdf  93.0 kB
file_ytjlfgntmjctrnhxlv23skf6mi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-10-01
Version   v1
Language   en ?
arXiv  2010.00191v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: dd5152aa-1459-41ca-82e0-2d516db6e911
API URL: JSON