论文标题

限制单调性,认知分裂和基础通常在答案集编程中太强大

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

论文作者

Shen, Yi-Dong, Eiter, Thomas

论文摘要

最近,为认知逻辑程序引入了主观约束单调性,认知分裂和基础的概念,目的是将其分别用作主要标准,以比较文献中提出的有关如何遵守这些直觉的不同答案集合的语义。在本说明中,我们考虑了这三个概念,并在一些示例中证明了它们一般而言,可能会分别排除一些理想的答案集。总之,这些属性不应被视为每个答案设置语义总体上必须满足的强制性属性。

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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源