A parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics

Theory and Practice of Logic Programming

Volumn 5, Issue 1-2, 2005, Pages 207-242

  Schweimeier, Ralf ^a   Schroeder, Michael ^b  

^a Cumtec Software GmbH   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Argumentation semantics; Extended logic programming; Non monotonic reasoning; Well founded semantics with explicit negation

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; INTELLIGENT AGENTS; MATHEMATICAL MODELS; SEMANTICS; TREES (MATHEMATICS);

ARGUMENTATION SEMANTICS; EXTENDED LOGIC PROGRAMMING; NON-MONOTONIC REASONING; WELL-FOUNDED SEMANTICS WITH EXPLICIT NEGATION;

LOGIC PROGRAMMING;

EID: 14544284525     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S147106840400225X     Document Type: Article

References (46)

1. ALFERES, J. J., DAMÁSIO, C. V. AND PEREIRA, L. M. 1995. A logic programming system for non-monotonic reasoning. Journal of Automated Reasoning 14, 1, 93-147.
2. ALFERES, J. J., DUNG, P. M. AND PEREIRA, L. M. 1993. Scenario semantics for extended logic programming. In Proceedings of the Second International Workshop on Logic Programming and Non-monotonic Reasoning (LPNMR'93). MIT Press, 334-348.
3. ALFERES, J. J. AND PEREIRA, L. M. 1996. Reasoning with Logic Programming. LNAI 1111, Springer-Verlag.
4. ANTONIOU, G. 2002. Defeasible logic with dynamic priorities. In Proceedings of the 15th European Conference on Artificial Intelligence. IOS Press, Lyon, France, 521-525.
5. BELNAP, N. D. 1977. A useful four-valued logic. In Modern Uses of Many-valued Logic, G. Epstein and J. M. Dunn, Eds. Reidel Publishing Company, 8-37.
6. BIRKHOFF, G. 1967. Lattice Theory, 3rd ed. American Mathematical Society.
7. BONDARENKO, A., DUNG, P., KOWALSKI, R. AND TONI, F. 1997. An abstract, argumentationtheoretic approach to default reasoning. Artificial Intelligence 93, 1-2, 63-101.
8. BREWKA, G. 1996. Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research 4, 19-36.
9. CHESÑEVAR, C. I., Dix, J., STOLZENBURG, F. AND SIMARI, O. R. 2002. Relating defeasible and normal logic programming through transformation properties. Theoretical Computer Science 290, 1, 499-529.
10. CHESÑEVAR, C. I., MAGUITMAN, A. G. AND Loui, R. P. 2000. Logical models of argument. ACM Computing Surveys 32, 4 (December), 337-383.
11. CHIARIGLIONE, L. et al. 1997. Specification version 2.0. Tech. rep., Foundations of Intelligent Physical Agents, http://www.fipa.org.
12. CLARK, K. L. 1978. Negation as failure. In Logic and Databases, Gallaire and M inker, Eds. Plenum Press, New York, 293-322.
13. DAMÁSIO, C. V. 1996. Paraconsistent extended logic programming with constraints. Ph.D. thesis, Universidade Nova de Lisboa.
14. DÁMSIO, C. V. AND PEREIRA, L. M. 1998. A survey on paraconsistent semantics for extended logic programs. In Handbook of Defeasible Reasoning and Uncertainty Management, D. M. Gabbay and P. Smets, Eds. Vol. 2. Kluwer. Academic Publishers, 241-320.
15. DAMÁSIO, C. V., PEREIRA, L. M. AND SCHROEDER, M. 1997. REVISE: Logic programming and diagnosis. In Proceedings of the Conference on Logic Programming and Non-monotonic Reasoning LPNMR97. LNAI 1265, Springer-Verlag, 353-362.
16. DUNG, P. M. 1993. An argumentation semantics for logic programming with explicit negation. In Proc. of the 10th International Conference on Logic Programming ICLP'93. MIT Press, 616-630.
17. DUNG, P. M. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77, 2, 321-357.
18. FININ, T., FRITZSON, R., McKAY, D. AND MCENTIRE, R. 1994. KQML as an agent communication lanugage. In Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94). ACM Press, 456-463.
19. FREIRE, J., RAO, P., SAGONAS, K., SWITFT, T. AND WARREN, D. S. 1997. XSB; A system for efficiently computing the well-founded semantics. In International Workshop on Logic Programming and Non-monotonic Reasoning. 431-441.
20. GARCÍA, A. J. AND SIMARI, G. R. 2004. Defeasible logic programming: An argumentative approach. Theory and Practice of Logic Programming 4, 1.
21. GARCÍA, A. J., SIMARI, G. R. AND CHESÑEVAR, C. I. 1998. An argumentative framework for reasoning with inconsistent and incomplete information. In ECAI'98 Workshop on Practical Reasoning and Rationality. Brighton, UK.
22. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, R. A. Kowalski and K. A. Bowen, Eds. MIT Press, 1070-1080.
23. GELFOND, M. AND LIFSCHITZ, V. 1990. Logic programs with classical negation. In Proceedings of the 7th International Conference on Logic Programming. MIT Press, 579-597.
24. JAKOBOVITS, H. AND VERMEIR, D. 1999a. Dialectic semantics for argumentation frameworks. In Proceedings of the Seventh International Conference on Artificial Intelligence and Law (ICAIL '99). 53-62.
25. JAKOBOVITS, H. AND VERMEIR, D. 1999b. Robust semantics for argumentation frameworks. Journal of Logic and Computation 9, 2, 215-261.
26. KAKAS, A. AND TONI, F. 1999. Computing argumentation in logic programming. Journal of Logic and Computation 9, 4, 515-562.
27. KAKAS, A. C. AND MORAITIS, P. 2002. Argumentative agent deliberation, roles and context. In Proceedings of the ICLP-Workshop Computational Logic in Multi-Agent Systems.
28. KRAUS, S., SYCARA, K. AND EVENCHIK, A. 1998. Reaching agreements through argumentation: a logical model and implementation. Artificial Intelligence 104, 1-2, 1-69.
29. MÓRA, I. A. AND ALTERES, J. J. 1998. Argumentative and cooperative multi-agent system for extended logic programming. In Proceedings of the 14th Brazilian Symposium on Artificial Intelligence (SBIA'98). 161-170.
30. PARSONS, S. AND JENNINOS, N. 1996. Negotiation through argumentation-a preliminary report. In Proceedings of the Second International Conference on Multi-Agent Systems. Kyoto, Japan, 267-274.
31. PARSONS, S., SIERRA, C. AND JENNINOS, N. 1998. Agents that reason and negotiate by arguing. Journal of Logic and Computation 8, 3, 261-292.
32. PEREIRA, L. M AND ALFERES, J. J. 1992. Well founded semantics for logic programs with explicit negation. In B. Neumann (Ed.), European Conference on Artificial Intelligence. Wiley, 102-106.
33. POLLOCK, J. L. 1987. Defeasible reasoning. Cognitive Science 11, 481-518.
34. PRAKKEN, H. AND SARTOR, G. 1997. Argument-based extended logic programming with defeasible priorities. Journal of Applied Non-Classical Logics 7, 1, 25-75.
35. PRZYMUSINSKI, T. 1990. Extended stable semantics for normal and disjunctive programs. In Proceedings of the 7th International Conference on Logic Programming. MIT Press, 459-477.
36. SADRI, F., TONI, F. AND TORRONI, P. 2001. Logic agents, dialogue, negotiation - an abductive approach. In Proceedings of the AISB Symposium on Information Agents for E-commerce.
37. SCHROEDER, M. 1999. An efficient argumentation framework for negotiating autonomous agents. In Proceedings of Modelling Autonomous Agents in a Multi-Agent World MAAMAW99. LNAI1647, Springer-Verlag.
38. SCHWEIMEIER, R. AND SCHROEDER, M. 2002. Notions of attack and justified arguments for extended logic programs. In Proceedings of the 15th European Conference on Artificial Intelligence. IOC Press, Lyon, France, 536-540.
39. SIERRA, C., JENNINGS, N., NORIEGA, P. AND PARSONS, S. 1997. A framework for argumentationbased negotiation. In Proc. Fourth Int. Workshop on Agent Theories, Architectures and Languages (ATAL-97). Springer-Verlag, 167-182.
40. SIMARI, G. R., CHESÑEVAR, C. I. AND GARCÍA, A. J. 1994. The role of dialectics in defeasible argumentation. In Anales de la XIV Conferencia Internacional de la Sociedad Chilena para Ciencias de la Computacion. Universidad de Conception, Conception (Chile).
41. SIMARI, G. R. AND LOUI, R. P. 1992. A mathematical treatment of defeasible reasoning and its implementation. Artificial Intelligence 53, 125-157.
42. TARSKI, A. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285-309.
43. TORRONI, P. 2002, A study on the termination of negotiation dialogues. In Proceedings of Autonomous Agents and Multi Agent Systems 2002. ACM Press, 1223-1230.
44. VAN GELDER, A., ROSS, K. A. AND SCHLIPF, J. S. 1991. The well-founded semantics for general logic programs. Journal of the ACM 38, 3 (July), 620-650.
45. VREESWIJK, G. A. W. 1997. Abstract argumentation systems. Artificial Intelligence 90, 1-2, 225-279.
46. WAGNER, G. 1994. Vivid Logic - Knowledge-Based Reasoning with Two Kinds of Negation. Vol. LNAI 764. Springer-Verlag.