arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.08335cs.PL
收藏

近似不动点理论与高阶逻辑程序的良基语义

Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs

Angelos Charalambidis, Panos Rondogiannis, Ioanna Symeonidou

摘要:

我们定义了一个新的,可拓的,三值语义的高阶逻辑程序与否定。新的语义是基于解释类型的源语言作为三值拟合单调函数在所有级别的类型层次结构。我们证明了这样的拟合单调函数和双值结果函数对之间存在一个双射,其中该对的第一个成员是单调-反单调的,第二个成员是反单调-单调的。通过推导一致近似不动点理论(Denecker et al. 2004)的扩展并利用上述双射,我们定义了一个迭代过程,该过程为任何给定的高阶逻辑程序产生一个杰出的扩展模型。我们证明,这个模型实际上是一个最小的。此外,我们证明,我们的建设推广了熟悉的良好的基础语义的经典逻辑程序,使我们的建议,以这种方式一个有吸引力的制定捕捉良好的基础语义高阶逻辑程序。本文件正在考虑被TPLP接受。

英文摘要:

We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as three-valued Fitting-monotonic functions at all levels of the type hierarchy. We prove that there exists a bijection between such Fitting-monotonic functions and pairs of two-valued-result functions where the first member of the pair is monotone-antimonotone and the second member is antimonotone-monotone. By deriving an extension of consistent approximation fixpoint theory (Denecker et al. 2004) and utilizing the above bijection, we define an iterative procedure that produces for any given higher-order logic program a distinguished extensional model. We demonstrate that this model is actually a minimal one. Moreover, we prove that our construction generalizes the familiar well-founded semantics for classical logic programs, making in this way our proposal an appealing formulation for capturing the well-founded semantics for higher-order logic programs. This paper is under consideration for acceptance in TPLP.

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

↑