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

arxiv(2020)

引用 0|浏览30
暂无评分
摘要
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.
更多
查看译文
关键词
answer set programming,epistemic splitting,foundedness
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要