Collective argumentation and disjunctive logic programming

Journal of Logic and Computation

Volumn 13, Issue 3, 2003, Pages 405-428

  Bochman, Alexander ^a  

^a NONE

Author keywords

Argumentation theory; Disjunctive logic programming

Indexed keywords

ARTIFICIAL INTELLIGENCE; SEMANTICS; SET THEORY;

ARGUMENTATION THEORY;

LOGIC PROGRAMMING;

EID: 0041340845     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/13.3.405     Document Type: Article

References (22)

1. A. Bondarenko, P. M. Dung, R. A. Kowalski, and F. Toni. An abstract, argumentation-theoretic framework for default reasoning. Artificial Intelligence, 93, 63-101, 1997.
2. N. D. Belnap, Jr. A useful four-valued logic. In Modern Uses of Multiple-Valued Logic, M. Dunn and G. Epstein, eds, pp. 8-41. D. Reidel, 1977.
3. C. Baral and M. Gelfond. Logic programming and knowledge representation. Annals of Mathematics and Artificial Intelligence, 19/20, 73-148, 1994.
4. A. Bochnian. On a logical basis of normal logic programs. Fundamenta Infonnaticae, 28, 223-245, 1996.
5. A. Bochman. Biconsequence relations: A four-valued formalism of reasoning with inconsistency and incompleteness. Notre Dame Journal of Formal Logic, 39, 47-73, 1998.
6. A. Bochman. A logical foundation for logic programming, I and II. Journal of Logic Programming, 35, 151-194, 1998.
7. J. Dix, G. Gottlob, and V. Marek. Causal models for disjunctive logic programs. In Proceedings of the Eleventh International Conference on Logic Programming, S. Margherita Ligure, P. Van Hentenryck, ed., pp. 290-302, MIT Press, 1994.
8. P. M. Dung. Acyclic disjunctive programs with abductive procedure as proof procedure. In Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 555-561, ICOT, 1992.
9. P. H. Dung. An argumentation-theoretic foundation for logic programming. Journal of Logic Programming, 22, 151-177, 1995.
10. P. M. Dung. On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming and n-persons games. Artificial Intelligence, 76, 321-358, 1995.
11. M. Gelfond and V. Lifschitz. Classical negation and disjunctive databases. New Generation Computing, 9, 365-385, 1991.
12. T. Janhunen, I. Niemelä. P. Simons, and J.-H. You. Unfolding partiality and disjunctions in stable model semantics. In Proceedings of the International Conference on Knowledge Representation and Reasoning, KR'00, F. Giunchiglia and B. Selman, eds, pp. 411-424. Morgan Kaufmann, Breckenridge, CO, 2000.
13. H. Jakobovits and D. Vermeir. Robust semantics for argumentation frameworks. Journal of Logic and Computation, 9, 215-261, 1999.
14. A. C. Kakas and P. Mankarella. Stable theories for logic programs. In Proceeding of the International Symposium on Logic Programming, V. Saraswat and K. Ueda, eds, pp. 85-100. MIT Press, 1991.
15. A. C. Kakas and F. Toni. Computing argumentation in logic programming. Journal of Logic and Computation, 9, 515-562, 1999.
16. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, MA, 1992.
17. D. Poole. The effect of knowledge on belief: conditioning, specificity and the lottery paradox in default reasoning. Artificial Intelligence, 49, 281-307, 1991.
18. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9, 401-424, 1991.
19. J. S. Schlipf. Formalizing a logic for logic programming. Annals of Mathematics and Artificial Intelligence, 5, 279-302, 1992.
20. M. Schaerf. Negation and minimality in disjunctive databases. Journal of Logic Programming, 23, 63-86, 1995.
21. M. Wallace. Tight, consistent, and computable completions for unrestricted logic programs. Journal of Logic Programming, 15, 243-273, 1993.
22. J.-H. You, L. Y. Yuan, and R. Goebel. An abductive apprach to disjunctive logic programming. Journal of Logic Programming, 44, 101-127, 2000.