Declarative semantics of programming in residuated lattice-valued logic

被引：0
|
作者：
应明生
机构：
[1] Beijing 100084
[2] Department of Computer Science and Technology
[3] China
[4] Tsinghua University
[5] State Key Laboratory of Intelligent Technology and Systems
来源：
Science in China(Series E:Technological Sciences) | 2000年 / 05期
关键词：
logic programming; declarative semantics; residuated lattice; fixpoint theorem; completion of program;
D O I：
暂无
中图分类号：
B811 [辩证逻辑];
学科分类号：
010104 ; 010105 ;
摘要：
We give two generalizations of Tarski’s fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski’s least fixpoint semantics for residuated lattice-valued logic programs.
引用
收藏
页码：481 / 494
页数：14
相关论文
共 50 条
12345