Closed world assumption for disjunctive reasoning |
| |
Authors: | Wang Kewen Zhou Lizhu |
| |
Affiliation: | (1) Department of Computer Science and Technology, Tsinghua University, 100084 Beijing, P.R. China |
| |
Abstract: | 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. |
| |
Keywords: | deductive databases closed world assumption semantics argumentation |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
|