Abstract
Reasoning in legal and social domains appears not to be well dealt with by deductive approaches. This is because such reasoning is open-endedly defeasible, and because the various argument schemes used in these domains are often hard to construe as deductive arguments. In consequence, argumentation frameworks have proved increasingly popular for modelling disputes in such domains. In order to capture a third phenomenon of these domains, however, namely that rational disagreement is possible due to a difference in the social values of the disputants, these frameworks have been extended to relate the strengths of arguments in the dispute to the social values promoted by their acceptance. If we are to use such frameworks in computer systems we must be aware of their computational properties. While we can establish efficiently the status of an argument for a particular audience, deciding the status of an argument with respect to all potential audiences is known to be intractable. The main result of this paper is an algorithm which identifies the audiences for which some set of arguments is coherently cotenable. The usefulness of this algorithm is particularly evident in the dialectical settings in which these value based frameworks are most naturally deployed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bench-Capon, T.J.M.: Representation of Case Law as an Argumentation Framework. In: Bench-Capon, T., Daskalopoulu, A., Winkels, R. (eds.) Legal Knowledge and Information Systems, pp. 103–112. IOS Press, Amsterdam (2002)
Bench-Capon, T.J.M.: Àgreeing to differ: modelling persuasive dialogue between parties with different values’. Informal Logic 22(3) (2003)
Bench-Capon, T.J.M.: P̀ersuasion in Practical Argument Using Value Based Argumentation Frameworks. Journal of Logic and Computation 13(3), 429–448 (2003)
Christie, G.: The Notion of an Ideal Audience in Legal Argument. Kluwer Academic, Dordrecht (2000)
Dimopoulos, Y., Torres, A.: G̀raph theoretical structures in logic programs and default theories. Theoretical Computer Science 170, 209–244 (1996)
Dung, P.M.: Òn the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and N-person games. Artificial Intelligence 77, 321–357 (1995)
Dunne, P.E., Bench-Capon, T.J.M.: C̀oherence in finite argument systems. Artificial Intelligence 141, 187–203 (2002)
Dunne, P.E., Bench-Capon, T.J.M.: CÌ€omplexity in value-based argument systems. Technical Report, Dept. of Comp. Sci., Univ. of Liverpool (February 2004)
Dunne, P.E., Bench-Capon, T.J.M.: T̀wo party immediate response disputes: properties and efficiency. Artificial Intelligence 149, 221–250 (2003)
Jakobovits, H., Vermeir, D.: D̀ialectic semantics for argumentation frameworks. In: Proceedings of the Seventh International Conference on Artificial Intelligence and Law (ICAIL 1999), ACM SIGART, June 1999, pp. 53–62. ACM Press, New York (1999)
Perelman, C.: Justice, Law and Argument. Reidel, Dordrecht (1980)
Prakken, H.: Logical Tools for Modelling Legal Argument. Kluwer Academic Publishers, Dordrecht (1997)
Searle, J.R.: Rationality in Action. MIT Press, Cambridge (2001)
Vreeswijk, G., Prakken, H.: C̀redulous and sceptical argument games for preferred semantics. In: Brewka, G., Moniz Pereira, L., Ojeda-Aciego, M., de Guzmán, I.P. (eds.) JELIA 2000. LNCS (LNAI), vol. 1919, pp. 224–238. Springer, Heidelberg (2000)
Walton, D.N.: Argumentation Schemes for Presumptive Reasoning. Erbaum, Mahwah
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dunne, P.E., Bench-Capon, T. (2004). Identifying Audience Preferences in Legal and Social Domains. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2004. Lecture Notes in Computer Science, vol 3180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30075-5_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-30075-5_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22936-0
Online ISBN: 978-3-540-30075-5
eBook Packages: Springer Book Archive