非单调函数的一个不动点定理
A Fixed Point Theorem for Non-Monotonic Functions
摘要:
给出了特殊结构完备格上一类(潜在)非单调函数的不动点定理。该定理有作为一个特殊情况下的Knaster-Tarski不动点定理时,仅限于情况下的单调函数和Kleene定理时,功能是另外连续的。从实践的角度来看,该定理在逻辑程序设计中否定的语义学中有直接的应用。特别地,它导致了[Rondogiannis and W. W. Wadge,ACM TOCL 6(2):441-467(2005)]的最小不动点结果的更直接和优雅的证明。此外,该定理似乎有可能在逻辑编程领域之外的应用。
英文摘要:
We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of monotonic functions and Kleene's theorem when the functions are additionally continuous. From the practical side, the theorem has direct applications in the semantics of negation in logic programming. In particular, it leads to a more direct and elegant proof of the least fixed point result of [Rondogiannis and W.W.Wadge, ACM TOCL 6(2): 441-467 (2005)]. Moreover, the theorem appears to have potential for possible applications outside the logic programming domain.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。