CWA Formalizations in Multi-Valued Logics  

作　　者：吴尽昭 

出　　处：《Journal of Computer Science & Technology》2001年第3期263-269,共7页计算机科学技术学报（英文版）

摘　　要：To enhance the expressive power and the declarative ability of a deductive database, various CWA (Closed World Assumption) formalizations including the naive CWA, the generalized CWA and the careful CWA are extended to multi-valued logics. The basic idea is to embed logic formulas into some polynomial ring. The extensions can be applied in a uniform manner to any finitely multi-valued logics. Therefore they are also of computational significance.To enhance the expressive power and the declarative ability of a deductive database, various CWA (Closed World Assumption) formalizations including the naive CWA, the generalized CWA and the careful CWA are extended to multi-valued logics. The basic idea is to embed logic formulas into some polynomial ring. The extensions can be applied in a uniform manner to any finitely multi-valued logics. Therefore they are also of computational significance.

关 键 词：CWA formalization multi-valued logic polynomial form query evaluation 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]