Robust semantics for argumentation frameworks

Journal of Logic and Computation

Volumn 9, Issue 2, 1999, Pages 215-261

  Jakobovits, Hadassa ^a   Vermeir, Dirk ^a  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

ARGUMENTATION FRAMEWORKS;

FORMAL LOGIC;

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

References (19)

1. A. Bondarenko, P.M. Dung, R. A. Kowalsk and F. Toni. An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence, 93, 63-101, 1997.
2. G. Brewka and T. Gordon. How to buy a porsche: an approach to defeasible decision making. In Working Notes of AAAI-94 Workshop on Computational Dialectics, pp. 28-38, Seattle, July 1994.
3. P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 77, 321-358, 1995.
4. T. Gordon and N. Karacapilidis. The zeno argumentation framework. In Proceedings of the Biannual International Conference on Formal and Applied Practical Reasoning (FAPR) Workshop, 1996. Available at http://nathan.gmd.de/projects/zeno/fapr/programme.html.
5. H. Jakobovits. A Theory of Argumentation and its Application to Semantics for Logic Programs. MSc thesis, Free University of Brussels, VUB, 1995.
6. H. Jakobovits and D. Vermeir. Contradiction in argumentation frameworks. In Proceedings of the IPMU Conference, pp. 821-826, 1996.
7. H. Jakobovits and D. Vermeir. Argumentation and logic programming semantics. In preparation, December 1997.
8. A. C. Kakas, P. Mancarella and P. M. Dung. The acceptability semantics for logic programs. In Proceedings of the 11th International Conference on Logic Programming, P. Van Hentenrijck, ed. pp. 504-519. The MIT Press, Cambridge, MA, 1994.
9. N. Karacapilidis, D. Papadias and T. Gordon. An argumentation based framework for defeasible and qualitative reasoning. In Advances in Artificial Intelligence, Proceedings of the XIIIth Brazilian Symposium on Artificial Intelligence, Curitiba, Brazil, volume 1159, D. L. Borges and C. A. A. Kaestner, eds. pp. 1-10. Springer-Verlag, 1996.
10. R. A. Kowalski and F. Toni. Abstract argumentation. Artificial Intelligence and Law Journal, Special Issue on Logical Models of Argumentation, 4, 1996.
11. E. Mendelson. Introduction to Mathematical Logic. 2nd edition, Van Nostrand, 1979.
12. J. Pollock. Justification and defeat. Artificial Intelligence, 67, 377-407, 1994.
13. H. Prakken. Dialectical proof theory for defeasible argumentation with defeasible priorities. In Proceedings of the Biannual International Conference on Formal and Applied Practical Reasoning (FAPR) Workshop, 1996. Available at http://nathan.gmd.de/projects/zeno/fapr/programme.html.
14. H. Prakken and G. Sartor. On the relation between legal language and legal argument: assumptions, applicability and dynamic priorities. In Proceedings of the Fifth International Conference on Artificial Intelligence and Law, pp. 1-9. ACM Press, 1995.
15. H. Prakken and G. Sartor. A system for defeasible argumentation, with defeasible priorities. In Proceedings of the International Conference on Formal Aspects of Practical Reasoning, Springer Lecture Notes in AI 1085, pp. 510-524, Springer Verlag, Bonn, 1996.
16. D. Sacca and C. Zaniolo. Stable models and non-determinism for logic programs with negation. In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 205-218. Association for Computing Machinery, 1990.
17. R. Sedgewick. Algorithms in C. Addison-Wesley, 1990.
18. A. Tarski. A lattice theoretical fixpoint theorem and its application. Pacific Journal of Mathematics, 5, 285-309, 1955.
19. G. A. W. Vreeswijk. Abstract argumentation systems. Artificial Intelligence, 90, 225-279, 1997.