arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.03369cs.AIcs.LOcs.PL
收藏

有序析取逻辑程序优选模型的逻辑刻画

A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction

National and Kapodistrian University of Athens(雅典国立卡波季斯特里安大学)

Angelos Charalambidis, Panos Rondogiannis, Antonis Troumpoukis

摘要:

有序析取逻辑程序(LPODs)是对经典逻辑程序的扩展,它能够在程序规则的头部以递减的优先度表示备选项。尽管有序析取的操作意义是明确的,但关于其语义仍存在一个重要的问题。具体地,不存在用于确定LPOD的最优选模型的纯模型理论方法。目前,选择最优选的模型是使用一种技术来执行的,该技术并不完全基于程序的模型,并且在某些情况下会产生违反直觉的结果。我们提供了一个新的,模型理论的语义LPODs,它使用一个额外的真值,以确定最首选的模型的程序。我们证明,所提出的方法克服了传统的语义LPODs的缺点。此外,新的方法可以用来定义一个自然类的逻辑程序,可以有有序的和经典的析取子句的头部的语义。这使得程序不仅可以表达严格的偏好级别,还可以表达同样偏好的替代方案。这项工作正在考虑接受在TPLP。

英文摘要:

Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing alternatives with decreasing degrees of preference in the heads of program rules. Despite the fact that the operational meaning of ordered disjunction is clear, there exists an important open issue regarding its semantics. In particular, there does not exist a purely model-theoretic approach for determining the most preferred models of an LPOD. At present, the selection of the most preferred models is performed using a technique that is not based exclusively on the models of the program and in certain cases produces counterintuitive results. We provide a novel, model-theoretic semantics for LPODs, which uses an additional truth value in order to identify the most preferred models of a program. We demonstrate that the proposed approach overcomes the shortcomings of the traditional semantics of LPODs. Moreover, the new approach can be used to define the semantics of a natural class of logic programs that can have both ordered and classical disjunctions in the heads of clauses. This allows programs that can express not only strict levels of preferences but also alternatives that are equally preferred. This work is under consideration for acceptance in TPLP.

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

↑