%0 Journal Article
%T A Procedural Semantics for Disjunctive Closed World Assumption<br>析取封闭世界假设的一种过程语义
%A WANG Ke wen
%A ZHOU Li zhu
%A FENG Jian hua
%A <br>王克文
%A 周立柱
%A 冯建华
%J 软件学报
%D 2001
%I 
%X Recently there has been an increasing interest in representing disjunctive information. DCWA (disjunctive closed world assumption) is a skeptical semantics for disjunctive deductive databases (DDBs) (with default negation) and extends the well founded model for normal logic programs. DCWA also provides an approximation for the generalized closed world assumption (GCWA) and supports argumentation. This paper presents a top down procedure for DCWA and proves its soundness and completeness.
%K disjunctive deductive databases
%K closed world assumption
%K semantics<br>演绎数据库
%K 封闭世界假设
%K 语义
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=1D4A102EFAFF8C8C&yid=14E7EF987E4155E6&vid=59906B3B2830C2C5&iid=9CF7A0430CBB2DFD&sid=38194DB47CE47B20&eid=A5CB84B03418407D&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=10