%0 Journal Article
%T CWA Formalizations in Multi-Valued Logics
%A WU Jinzhao
%A <br>吴尽昭
%J 计算机科学技术学报
%D 2001
%I 
%X 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.
%K CWA formalization
%K multi-valued logic
%K polynomial form
%K query evaluation<br>CWA
%K 演绎数据库
%K 逻辑数据库
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=9DF8DDF0B4E67310A6E6866D28C26CAE&yid=14E7EF987E4155E6&vid=7801E6FC5AE9020C&iid=38B194292C032A66&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=8