%0 Journal Article
%T Closed World Assumption for Disjunctive Reasoning
%A Wang Kewen
%A ZHOU Lizhu
%A <br>王克文
%A 周立柱
%J 计算机科学技术学报
%D 2001
%I 
%X In this paper, the relationship between argumentation and closed world reasoning for disjunctive information is studied. In particular, the authors propose a simple and intuitive generalization of the closed world assumption (CWA) for general disjunctive deductive databases (with default negation). This semantics, called DCWA, allows a natural argumentation-based interpretation and can be used to represent reasoning for disjunctive information. We compare DCWA with GCWA and prove that DCWA extends Minker's GCWA to the class of disjunctive databases with default negation. Also we compare our semantics with some related approaches. In addition, the computational complexity of DCWA is investigated.
%K deductive databases
%K closed world assumption
%K semantics
%K argumentation<br>文献型数据库
%K CWA
%K 检索推理
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=4D2535C959F48A6FC410BF522CC637CC&yid=14E7EF987E4155E6&vid=7801E6FC5AE9020C&iid=E158A972A605785F&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=15