Declarative semantics of programming in residuated lattice-valued logic  

作　　者：应明生 

机构地区：[1]State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China

出　　处：《Science China(Technological Sciences)》2000年第5期481-494,共14页中国科学（技术科学英文版）

摘　　要：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.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.

关 键 词：logic PROGRAMMING DECLARATIVE SEMANTICS residuated lattice FIXPOINT THEOREM COMPLETION of program. 

分 类 号：B811[哲学宗教—逻辑学]