arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.00870cs.LO
收藏

具有选言和因果选择规则的程序的证明

Justifications for Programs with Disjunctive and Causal-choice Rules

Pedro Cabalar, Jorge Fandinno

摘要:

在本文中,我们研究了一个扩展的稳定的模型语义的析取逻辑程序在一个模型中的每个真正的原子与一个代数表达式(规则标签),代表其理由。在我们以前的工作中的非析取程序,这些理由是在一个纯粹的语义的方式,通过代数运算(产品,除了和应用程序)的因果值格。我们的新定义扩展了因果稳定模型的概念,析取逻辑程序,并满足每个(标准)稳定模型对应于一类不相交的因果稳定模型共享相同的真值分配,但可能会改变所获得的解释。我们提供了一对说明性的例子,显示新的语义的行为,并讨论了需要引入一种新的类型的规则,我们称之为cabinet的选择。这种类型的规则直观地捕捉了“$A$可能导致$B$“的想法,并且当忽略因果信息时,相当于标准稳定模型语义下的通常选择规则。(正在考虑出版在逻辑编程的理论与实践)

英文摘要:

In this paper, we study an extension of the stable model semantics for disjunctive logic programs where each true atom in a model is associated with an algebraic expression (in terms of rule labels) that represents its justifications. As in our previous work for non-disjunctive programs, these justifications are obtained in a purely semantic way, by algebraic operations (product, addition and application) on a lattice of causal values. Our new definition extends the concept of causal stable model to disjunctive logic programs and satisfies that each (standard) stable model corresponds to a disjoint class of causal stable models sharing the same truth assignments, but possibly varying the obtained explanations. We provide a pair of illustrative examples showing the behaviour of the new semantics and discuss the need of introducing a new type of rule, which we call causal-choice. This type of rule intuitively captures the idea of "$A$ may cause $B$" and, when causal information is disregarded, amounts to a usual choice rule under the standard stable model semantics. (Under consideration for publication in Theory and Practice of Logic Programming)

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑