Closed world assumption for disjunctive reasoning

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 beused 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.

[1]  Li-Yan Yuan,et al.  An abductive approach to disjunctive logic programming , 2000, J. Log. Program..

[2]  Jack Minker,et al.  Circumscription and Disjunctive Logic Programming , 1991, Artificial and Mathematical Theory of Computation.

[3]  Jack Minker,et al.  An Extension to Linear Resolution with Selection Function , 1982, Inf. Process. Lett..

[4]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[5]  Kewen Wang,et al.  Argumentation-based abduction in disjunctive logic programming , 2000, J. Log. Program..

[6]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[7]  Jürgen Dix,et al.  Semantics of (disjunctive) Logic Programs Based on Partial Evaluation , 1999, J. Log. Program..

[8]  Georg Gottlob,et al.  Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..

[9]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[10]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[11]  Chiaki Sakama,et al.  Negation in Disjunctive Logic Programs , 1993, ICLP.

[12]  Teodor C. Przymusinski.  Stable semantics for disjunctive programs , 1991, New Generation Computing.

[13]  Teodor C. Przymusinski.  Static semantics for normal and disjunctive logic programs , 1995, Annals of Mathematics and Artificial Intelligence.

[14]  Teodor C. Przymusinski.  Semantics of Disjunctive Logic Programs and Deductive Databases , 1991, DOOD.