A formalization of argumentation schemes for legal case-based reasoning in ASPIC+
Open Access
- 9 May 2013
- journal article
- research article
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 25 (5) , 1141-1166
Abstract
In this article we offer a formal account of reasoning with legal cases in terms of argumentation schemes. These schemes, and undercutting attacks associated with them, are formalized as defeasible rules of inference within the ASPIC+ framework. We begin by modelling the style of reasoning with cases developed by Aleven and Ashley in the CATO project, which describes cases using factors, and then extend the account to accommodate the dimensions used in Rissland and Ashley's earlier HYPO project. Some additional scope for argumentation is then identified and formalized.Keywords
This publication has 18 references indexed in Scilit:
- Representing Popov v Hayashi with dimensions and factorsArtificial Intelligence and Law, 2012
- The Carneades model of argument and burden of proofArtificial Intelligence, 2007
- On the evaluation of argumentation formalismsArtificial Intelligence, 2007
- AGATHA: Using heuristic search to automate the construction of case law theoriesArtificial Intelligence and Law, 2005
- A model of legal reasoning with cases incorporating theories and valuesArtificial Intelligence, 2003
- Predicting outcomes of case based legal arguments2003
- A logic-based theory of deductive arguments☆☆This is an extended version of a paper entitled “Towards a logic-based theory of argumentation” published in the Proceedings of the National Conference on Artificial Intelligence (AAAI'2000), Austin, TX, MIT Press, Cambridge, MA, 2000.Artificial Intelligence, 2001
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamesArtificial Intelligence, 1995
- Neural networks and open texture1993
- Representing teleological structure in case-based legal reasoning1993