Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Negation in disjunctive logic programs
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
| Hi-index | 0.00 |
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.