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

规则和SE模型之间的来回转换(扩展版)

Back and Forth Between Rules and SE-Models (Extended Version)

CENTRIA(CENTRIA(人工智能中心));Universidade Nova de Lisboa(新里斯本大学)

Martin Slota, João Leite

摘要:

逻辑编程中的规则对文字之间的相互依赖性信息进行编码,这些信息没有被任何常用的语义捕获。一旦程序需要修改或进一步操作时,这些信息就变得至关重要。我们认为,在这些情况下,一个程序不应该被视为仅仅是它的模型集。相反,它应该被视为和操纵的每一个规则内的模型集的集合。考虑到这一点,我们调查和突出的SE模型语义和个别规则之间的关系。我们确定了一组代表的规则等价类引起的SE模型,因此精确的表达这种语义相对于一个单一的规则。我们还将SE-解释的集合类表示为一个单一的规则。最后,我们讨论了两个等价概念的引入,比强等价更强[1]和比强更新等价更弱[2],当规则中的依赖信息感兴趣时,它们似乎更合适。

英文摘要:

Rules in logic programming encode information about mutual interdependencies between literals that is not captured by any of the commonly used semantics. This information becomes essential as soon as a program needs to be modified or further manipulated. We argue that, in these cases, a program should not be viewed solely as the set of its models. Instead, it should be viewed and manipulated as the set of sets of models of each rule inside it. With this in mind, we investigate and highlight relations between the SE-model semantics and individual rules. We identify a set of representatives of rule equivalence classes induced by SE-models, and so pinpoint the exact expressivity of this semantics with respect to a single rule. We also characterise the class of sets of SE-interpretations representable by a single rule. Finally, we discuss the introduction of two notions of equivalence, both stronger than strong equivalence [1] and weaker than strong update equivalence [2], which seem more suitable whenever the dependency information found in rules is of interest.

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

↑