Skip to main content

2016 | OriginalPaper | Buchkapitel

Argumentation for Practical Reasoning: An Axiomatic Approach

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

An argument system could be viewed as a pair of a set of argument and a binary attack relation between arguments. The semantics of argumentation rests on the acceptability of arguments and the structure of arguments and their attack relations. While there is a relatively good understanding of the acceptability of arguments, the same can not be said about their structure and attack relations. In this paper, we present an axiomatic analysis of the attack relations of rule-based argument systems by presenting a set of simple and intuitive properties and showing that they indeed determine an uniquely defined common attack relations for rule-based argument systems.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
The materials in Sects. 4, 5, 6 are from a recent paper [19]. The materials in Sects. 7, 8 are new.
 
2
\(d \prec d'\) means that d is less preferred than \(d'\).
 
3
D,P,T,A stand for Dean, Professor , Teach and Administrator respectively.
 
4
a reflexive, transitive and antisymmetric relation.
 
Literatur
1.
2.
Zurück zum Zitat Amgoud, L., Cayrol, C.: Integrating preference ordering into argument-based reasoning. In: Proceedings of ESQUARU-FAPS (1997) Amgoud, L., Cayrol, C.: Integrating preference ordering into argument-based reasoning. In: Proceedings of ESQUARU-FAPS (1997)
3.
Zurück zum Zitat Amgoud, L., Cayrol, C.: Infering from inconsistency in preference-based argumentation framework. Int J. Autom. Reasoning 29(2), 197–215 (2002)MathSciNetMATH Amgoud, L., Cayrol, C.: Infering from inconsistency in preference-based argumentation framework. Int J. Autom. Reasoning 29(2), 197–215 (2002)MathSciNetMATH
4.
Zurück zum Zitat Baroni, P., Giacomin, M.: Semantics of abstract argument systems. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence. Springer, New York (2009) Baroni, P., Giacomin, M.: Semantics of abstract argument systems. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence. Springer, New York (2009)
5.
Zurück zum Zitat Bench-Capon, T.J.M., Atkinson, K.: Abstract argumentation and values. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence. Springer, New York (2009) Bench-Capon, T.J.M., Atkinson, K.: Abstract argumentation and values. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence. Springer, New York (2009)
6.
Zurück zum Zitat Bench-Capon, T.J.M., Prakken, H., Sartor, G.: Argumentation in legal reasoning. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence. Springer, New York (2009) Bench-Capon, T.J.M., Prakken, H., Sartor, G.: Argumentation in legal reasoning. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence. Springer, New York (2009)
7.
Zurück zum Zitat Bench-Capon, J.M.T.: Persuasion in practical argument using value-based argumentation frameworks. J. Log. Comput. 13(3), 429–448 (2003)MathSciNetCrossRefMATH Bench-Capon, J.M.T.: Persuasion in practical argument using value-based argumentation frameworks. J. Log. Comput. 13(3), 429–448 (2003)MathSciNetCrossRefMATH
8.
Zurück zum Zitat Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artif. Intell. 93, 63–101 (1997)MathSciNetCrossRefMATH Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artif. Intell. 93, 63–101 (1997)MathSciNetCrossRefMATH
9.
Zurück zum Zitat Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: Proceedings of IJCAI 1989, pp. 1043–1048. Morgan Kaufmann, Burlington (1989) Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: Proceedings of IJCAI 1989, pp. 1043–1048. Morgan Kaufmann, Burlington (1989)
10.
Zurück zum Zitat Brewka, G., Dunne, P.E., Woltran, S.: Relating the semantics of abstract dialectical framework and standard AF. In: Proceedings of IJCAI (2011) Brewka, G., Dunne, P.E., Woltran, S.: Relating the semantics of abstract dialectical framework and standard AF. In: Proceedings of IJCAI (2011)
12.
Zurück zum Zitat Brewka, G., Niemelä, I., Truszczynski, M.: Preferences and nonmonotonic reasoning. AI Mag. 29(4), 69–78 (2008) Brewka, G., Niemelä, I., Truszczynski, M.: Preferences and nonmonotonic reasoning. AI Mag. 29(4), 69–78 (2008)
14.
Zurück zum Zitat Caminada, M., Modgil, S., Oren, N.: Preferences and unrestricted rebut. In: Proceedings of Comma 2014 (2014) Caminada, M., Modgil, S., Oren, N.: Preferences and unrestricted rebut. In: Proceedings of Comma 2014 (2014)
15.
Zurück zum Zitat Cayrol, C., Doutre, S., Mengin, J.: On decision problems related to the preferred semantics for argumentation frameworks. J. Log. Comput. 13(3), 377–403 (2003)MathSciNetCrossRefMATH Cayrol, C., Doutre, S., Mengin, J.: On decision problems related to the preferred semantics for argumentation frameworks. J. Log. Comput. 13(3), 377–403 (2003)MathSciNetCrossRefMATH
16.
Zurück zum Zitat Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)CrossRefMATH Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)CrossRefMATH
17.
Zurück zum Zitat Delgrande, J.P., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory Pract. Logic Program. 3(2), 129–187 (2003)MathSciNetCrossRefMATH Delgrande, J.P., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory Pract. Logic Program. 3(2), 129–187 (2003)MathSciNetCrossRefMATH
18.
19.
Zurück zum Zitat Dung, P.M.: A canonical semantics for structured argumentation with priorities. In: Baroni, P. (ed.) Proceedings of Comma 2016. IOS Press (2016) Dung, P.M.: A canonical semantics for structured argumentation with priorities. In: Baroni, P. (ed.) Proceedings of Comma 2016. IOS Press (2016)
20.
Zurück zum Zitat Dung, P.M., Sartor, G.: The modular logic of private international law. Artif. Intell. Law 19, 233–261 (2011)CrossRef Dung, P.M., Sartor, G.: The modular logic of private international law. Artif. Intell. Law 19, 233–261 (2011)CrossRef
21.
Zurück zum Zitat Dung, P.M., Thang, P.M.: Closure and consistency and logic-associated argumentation. J. Artif. Intell. Res. 49, 79–109 (2014)MathSciNetMATH Dung, P.M., Thang, P.M.: Closure and consistency and logic-associated argumentation. J. Artif. Intell. Res. 49, 79–109 (2014)MathSciNetMATH
22.
Zurück zum Zitat Dung, P.M., Thang, P.M.: Towards (probabilistic) argumentation for jury-based dispute resolution. In: COMMA, pp. 171–182 (2010) Dung, P.M., Thang, P.M.: Towards (probabilistic) argumentation for jury-based dispute resolution. In: COMMA, pp. 171–182 (2010)
23.
Zurück zum Zitat Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamescceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–358 (1995)MathSciNetCrossRefMATH Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamescceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–358 (1995)MathSciNetCrossRefMATH
24.
Zurück zum Zitat Dung, P.M.: An axiomatic analysis of structured argumentation for prioritized default reasoning. In: Proceedings of ECAI 2014 (2014) Dung, P.M.: An axiomatic analysis of structured argumentation for prioritized default reasoning. In: Proceedings of ECAI 2014 (2014)
25.
Zurück zum Zitat Dung, P.M., Kowalski, R.A., Toni, F.: Assumption-based argumentation. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence. Springer, New York (2009) Dung, P.M., Kowalski, R.A., Toni, F.: Assumption-based argumentation. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence. Springer, New York (2009)
26.
Zurück zum Zitat Gabbay, D.M.: Equational approach to argumentation networks. Argument Comput. (2012) Gabbay, D.M.: Equational approach to argumentation networks. Argument Comput. (2012)
27.
Zurück zum Zitat Garcia, A.J., Simari, G.R.: Defeasible logic programming: an argumentative approach. TPLP 4(1–2), 95–138 (2004)MathSciNetMATH Garcia, A.J., Simari, G.R.: Defeasible logic programming: an argumentative approach. TPLP 4(1–2), 95–138 (2004)MathSciNetMATH
28.
Zurück zum Zitat Gelfond, M., Son, T.C.: Reasoning with prioritized defaults. In: Dix, J., Moniz Pereira, L., Przymusinski, T.C. (eds.) LPKR 1997. LNCS (LNAI), vol. 1471, pp. 164–223. Springer, Heidelberg (1998)CrossRef Gelfond, M., Son, T.C.: Reasoning with prioritized defaults. In: Dix, J., Moniz Pereira, L., Przymusinski, T.C. (eds.) LPKR 1997. LNCS (LNAI), vol. 1471, pp. 164–223. Springer, Heidelberg (1998)CrossRef
29.
Zurück zum Zitat Pearl, J., Geffner, H.: Conditional entailment: bridging two approaches to default reasoning. Artif. Intell. 53, 209–244 (1992)MathSciNetCrossRefMATH Pearl, J., Geffner, H.: Conditional entailment: bridging two approaches to default reasoning. Artif. Intell. 53, 209–244 (1992)MathSciNetCrossRefMATH
30.
Zurück zum Zitat Hunter, A.: Probabilistic qualification of attack in abstract argumentation. Int. J. Approximate Reasoning 55(1), 607–638 (2014)MathSciNetCrossRefMATH Hunter, A.: Probabilistic qualification of attack in abstract argumentation. Int. J. Approximate Reasoning 55(1), 607–638 (2014)MathSciNetCrossRefMATH
31.
Zurück zum Zitat Hunter, A., Thimm, M.: Probabilistic argument graphs for argumentation lotteries. In: Computational Models of Argument (COMMA 2014). IOS Press (2014) Hunter, A., Thimm, M.: Probabilistic argument graphs for argumentation lotteries. In: Computational Models of Argument (COMMA 2014). IOS Press (2014)
32.
Zurück zum Zitat Hunter, A., Williams, M.: Aggregating evidence about positive and negative effects of treatments. Artif. Intell. Med. 56, 173–190 (2012)CrossRef Hunter, A., Williams, M.: Aggregating evidence about positive and negative effects of treatments. Artif. Intell. Med. 56, 173–190 (2012)CrossRef
33.
Zurück zum Zitat Li, H., Oren, N., Norman, T.J.: Probabilistic argumentation frameworks. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS, vol. 7132, pp. 1–16. Springer, Heidelberg (2012)CrossRef Li, H., Oren, N., Norman, T.J.: Probabilistic argumentation frameworks. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS, vol. 7132, pp. 1–16. Springer, Heidelberg (2012)CrossRef
34.
Zurück zum Zitat Martinez, D.C., Garcia, A.J., Simari, G.R.: On acceptability in abstract argumentation frameworks with an extended defeat relation. In: Bench-Capon, T.J.M., Dunne, P.E. (eds.) Proceedings of International Conference on “Computational Models of Arguments”. IOS Press (2006) Martinez, D.C., Garcia, A.J., Simari, G.R.: On acceptability in abstract argumentation frameworks with an extended defeat relation. In: Bench-Capon, T.J.M., Dunne, P.E. (eds.) Proceedings of International Conference on “Computational Models of Arguments”. IOS Press (2006)
35.
36.
Zurück zum Zitat Modgil, S., Prakken, H.: The aspic+ framework for structured argumenttion: a tutorial. J. Arguments Comput. 5, 31–62 (2014)CrossRef Modgil, S., Prakken, H.: The aspic+ framework for structured argumenttion: a tutorial. J. Arguments Comput. 5, 31–62 (2014)CrossRef
37.
Zurück zum Zitat Prakken, H.: An abstract framework for argumentation with structured arguments. J. Arguments Comput. 1, 93–124 (2010)CrossRef Prakken, H.: An abstract framework for argumentation with structured arguments. J. Arguments Comput. 1, 93–124 (2010)CrossRef
38.
Zurück zum Zitat Prakken, H., Sartor, G.: Argument-based extended logic programming with defeasible priorities. J. Appl. Non-Class. Logics 7(1), 25–75 (1997)MathSciNetCrossRefMATH Prakken, H., Sartor, G.: Argument-based extended logic programming with defeasible priorities. J. Appl. Non-Class. Logics 7(1), 25–75 (1997)MathSciNetCrossRefMATH
40.
Zurück zum Zitat Schaub, T., Wang, K.: A comparative study of logic programs with preferences. In: Proceedings of IJCAI 2001. Morgan Kaufmann, Burlington (2001) Schaub, T., Wang, K.: A comparative study of logic programs with preferences. In: Proceedings of IJCAI 2001. Morgan Kaufmann, Burlington (2001)
Metadaten
Titel
Argumentation for Practical Reasoning: An Axiomatic Approach
verfasst von
Phan Minh Dung
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-44832-9_2