Dialectical proof theories for the credulous preferred semantics of argumentation frameworks

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2143, Issue , 2001, Pages 668-679

  Cayrol, Claudette ^a   Doutre, Sylvie ^a   Mengin, Jérôme ^a  

^a IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

ARGUMENTATION FRAMEWORKS; DECISION PROBLEMS; DIALECTICAL PROOF THEORY; LOGICAL SYSTEM; PREFERRED SEMANTICS; PROOF THEORY; STABLE SEMANTICS; TWO AGENTS;

PROBLEM SOLVING;

EID: 84937397492     PISSN: None     EISSN: None     Source Type: Journal    
DOI: 10.1007/3-540-44652-4_59     Document Type: Article

References (16)

1. [AC00] Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. In Proceedings of the Workshop on Uncertainty Frameworks in Non-monotonic Reasoning, NMR 2000, Breckenbridge, Colorado, April 9-11, (2000).
2. [BDKT97] Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentationtheoretic approach to default reasoning. Artificial Intelligence 93 (1997), 63-101.
3. [Ber73] Berge, C.: Graphs and Hypergraphs, vol.6 of North-Holland Mathematical Library, North-Holland (1973).
4. [CDM01] Cayrol, C., Doutre, S., Mengin, J.: Dialectical Proof Theories for the Credulous Preferred Semantics of Argumentation Frameworks. Research report, 2001-09-R, IRIT, May 2001.
5. [CML00] Chesñevar, C.I., Maguitman, A.G., Loui, R.P.: Logical Models of Argument. ACM Computing Surveys 32 (4) (2000), 337-383.
6. [DMP97] Dimopoulos, Y., Magirou, V., Papadimitriou, C.H.: On kernels, Defaults and Even Graphs. Annals of Mathematics and AI (1997).
7. [Dun95] Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77 (1995), 321-357.
8. [DM01] Doutre, S., Mengin, J.: Preferred Extensions of Argumentation Frameworks: Computation and Query Answering. In Proceedings of the Int. Joint Conf. on Automated Reasoning (IJCAR 2001), Siena, Italy, June 18-23 (2001).
9. [Gin89] Ginsberg, M.: A circumscriptive theorem prover. Artificial Intelligence, 39 (1989) 209- 230.
10. [KT99] Kakas, A.C., Toni, F.: Computing Argumentation in Logic Programming. Journal of Logic and Computation 9 (4) (1999), 515-562.
11. [JV99] Jakobovits, H., Vermeir, D.: Dialectic Semantics for Argumentation Frameworks. In Proceedings of the 7th International Conference on Artificial Intelligence and Law, (ACM Press) (1999), 53-62.
12. [Poo89] Poole, D.: Explanation and prediction: An architecture for default and abductive reasoning. Computational Intelligence Journal 5 (1989) 97-110.
13. [Prz89] Przymusinski, T.: An algorithm to compute circumscription. Artificial Intelligence, 38 (1989) 49-73.
14. [PS97] Prakken, H., Sartor, G.: Argument-Based Extended logic Programming with Defeasible Priorities. Journal of Applied Non-classical Logics 7 (1997) 25-75.
15. [Rei80] Reiter, R.: A logic for default reasoning. Artificial Intelligence 13 (1980) 81-132.
16. [VP00] Vreeswijk, G., Prakken, H.: Credulous and Sceptical Argument Games for Preferred Semantics. In Proceedings of the European Workshop on Logics in Artificial Intelligence (JELIA 2000) LNA1 1919, Springer Verlag (2000).