Equational Properties of Stratified Least Fixed Points (Extended Abstract)

被引：9
作者：
Esik, Zoltan [1 ]
机构：
[1] Univ Szeged, Dept Comp Sci, Szeged, Hungary
来源：
LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2015 | 2015年 / 9160卷
关键词：
LOGIC; SEMANTICS; FIXPOINT; AXIOMS;
D O I：
10.1007/978-3-662-47709-0_13
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between 'stratified complete lattices' and used to give semantics to logic programs with negation and boolean context-free grammars. We prove that this new operation satisfies 'the standard' identities of fixed point operations as described by the axioms of iteration theories.
引用
收藏
页码：174 / 188
页数：15
相关论文
共 29 条
[1]  
Barr Michael, 1995, Category Theory for Computing Science, V2nd
[2]  
Bekic H., 1969, LNCS
[3]  
Bloom S.L., 1993, EATCS MONOGRAPHS THE, DOI DOI 10.1007/978-3-642-78034-9
[4]   Fixed-point operations on ccc's .1. [J].
Bloom, SL ;
Esik, Z .
THEORETICAL COMPUTER SCIENCE, 1996, 155 (01) :1-38
[5]   EQUATIONAL LOGIC OF CIRCULAR DATA TYPE SPECIFICATION [J].
BLOOM, SL ;
ESIK, Z .
THEORETICAL COMPUTER SCIENCE, 1989, 63 (03) :303-331
[6]   Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation [J].
Charalambidis, Angelos ;
Esik, Zoltan ;
Rondogiannis, Panos .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2014, 14 :725-737
[7]  
Davey B.A., 2002, INTRODUCTION, V2nd, DOI DOI 10.1017/CBO9780511809088
[8]  
Denecker M, 2000, SPRINGER INT SER ENG, V597, P127
[9]  
Denecker M., 2004, INFORM COMPUT, V192, P21
[10]  
Elgot C. C., 1973, STUDIES LOGIC FDN MA, V80, P175
123