On sceptical versus credulous acceptance for abstract argument systems

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

Volumn 3229, Issue , 2004, Pages 462-473

  Doutre, Sylvie ^a   Mengin, Jérôme ^b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; SET THEORY;

ABSTRACT ARGUMENTS; AI SYSTEMS; ARGUMENTATION SYSTEMS; BINARY RELATION; CREDULOUS ACCEPTANCE; HIGH LEVEL OF ABSTRACTION; META-ARGUMENTATION SYSTEM;

FORMAL LOGIC;

ABSTRACT ARGUMENTS; CREDULOUS ACCEPTANCE; META-ARGUMENTATION SYSTEM; NONMONOTONIC LOGICS;

EID: 22944472722     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_39     Document Type: Conference Paper

References (18)

1. Bondarenko, A., Dung, P., Kowalski, R., Toni, F.: An abstract, argumentationtheoretic approach to default reasoning. Artificial Intelligence 93 (1997) 63-101
2. Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theoretical Computer Science 170 (1996) 209-244
3. Dimopoulos, Y., Magirou, V., Papadimitriou, C.: On kernels, Defaults and Even Graphs. Annals of Mathematics and AI (1997) 1-12
4. Berge, C.: Graphs and Hypergraphs. North-Holland Mathematical Library, North-Holland (1973)
5. Dung, P.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77 (1995) 321-357
6. Kakas, A., Toni, F.: Computing Argumentation in Logic Programming. Journal of Logic and Computation 9 (1999) 515-562
7. Prakken, H., Sartor, G.: Argument-based logic programming with defeasible priorities. Journal of Applied Non-Classical Logics 7 (1997) 25-75
8. Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Annals of Mathematics and Artificial Intelligence 34 (2002) 197-215
9. Vreeswijk, G., Prakken, H.: Credulous and Sceptical Argument Games for Preferred Semantics. In: Proc. JELIA'2000, LNAI 1919 (2000) 239-253
10. Cayrol, C., Doutre, S., Mengin, J.: On Decision Problems related to the preferred semantics for argumentation frameworks. Journal of Logic and Computation 13 (2003) 377-403
11. Doutre, S., Mengin, J.: On sceptical vs credulous acceptance for abstract argument systems. In: Tenth International Workshop on Non-Monotonic Reasoning (NMR2004). (2004) 134-139
12. Doutre, S.: Autour de la sémantique préférée des systèmes d'argumentation. PhD Thesis, Université Paul Sabatier, Toulouse (2002)
13. Jakobovits, H., Vermeir, D.: Dialectic Semantics for Argumentation Frameworks. In: Proc. ICAIL'99, ACM Press (1999) 53-62
14. Dimopoulos, Y., Nebel, B., Toni, F.: On the Computational Complexity of Assumption-based Argumentation for Default Reasoning. Artificial Intelligence 141 (2002) 57-78
15. Dunne, P., Bench-Capon, T.: Coherence in Finite Argument Systems. Artificial Intelligence 141 (2002) 187-203
16. Baker, A. B., Ginsberg, M. L.: A theorem prover for prioritized circumscription. In: Proceedings of the 11th International Joint Conference on Artificial Intelligence, Morgan Kaufmann (1989) 463-467
17. Poole, D. L.: Explanation and prediction: an architecture for default and abductive reasoning. Computational Intelligence 5 (1989) 97-110
18. Przymusinski, T.: An algorithm to compute circumscription. Artificial Intelligence 38 (1989) 49-73