Closed World Assumption for Disjunctive Reasoning

In this paper, therelationship between argumentation and closed world reasoning fordisjunctive information is studied. In particular, the authors propose asimple and intuitivegeneralization of the closed world assumption (CWA) forgeneral disjunctive deductive databases (with default negation).This semantics, called DCWA, allows a natural argumentation-basedinterpretation and can be used to represent reasoning for disjunctiveinformation. We compare DCWA with GCWA and prove that DCWA extendsMinker's GCWA to the class of disjunctive databases with default negation. Also wecompare our semantics with some related approaches. In addition,the computational complexity of DCWA is investigated.