Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Reconstructing Popov v. Hayashi in a framework for argumentation with structured arguments and Dungean semantics

Reconstructing Popov v. Hayashi in a framework for argumentation with structured arguments and... In this article the argumentation structure of the court’s decision in the Popov v. Hayashi case is formalised in Prakken’s (Argument Comput 1:93–124; 2010) abstract framework for argument-based inference with structured arguments. In this framework, arguments are inference trees formed by applying two kinds of inference rules, strict and defeasible rules. Arguments can be attacked in three ways: attacking a premise, attacking a conclusion and attacking an inference. To resolve such conflicts, preferences may be used, which leads to three corresponding kinds of defeat, after which Dung’s (Artif Intell 77:321–357; 1995) abstract acceptability semantics can be used to evaluate the arguments. In the present paper the abstract framework is instantiated with strict inference rules corresponding to first-order logic and with defeasible inference rules for defeasible modus ponens and various argument schemes. The main techniques used in the formal reconstruction of the case are rule-exception structures and arguments about rule validity. Arguments about socio-legal values and the use of precedent cases are reduced to arguments about rule validity. The tree structure of arguments, with explicit subargument relations between arguments, is used to capture the dependency relations between the elements of the court’s decision. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Artificial Intelligence and Law Springer Journals

Reconstructing Popov v. Hayashi in a framework for argumentation with structured arguments and Dungean semantics

Prakken, Henry
Artificial Intelligence and Law , Volume 20 (1) – Mar 11, 2012
Download PDF
26 pages

Loading next page...
 
/lp/springer-journals/reconstructing-popov-v-hayashi-in-a-framework-for-argumentation-with-cfMInQKpLu

References (25)

Publisher
Springer Journals
Copyright
Copyright © 2012 by The Author(s)
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Computational Linguistics; Legal Aspects of Computing; Philosophy of Law; Law of the Sea, Air and Outer Space
ISSN
0924-8463
eISSN
1572-8382
DOI
10.1007/s10506-012-9117-8
Publisher site
See Article on Publisher Site

Abstract

In this article the argumentation structure of the court’s decision in the Popov v. Hayashi case is formalised in Prakken’s (Argument Comput 1:93–124; 2010) abstract framework for argument-based inference with structured arguments. In this framework, arguments are inference trees formed by applying two kinds of inference rules, strict and defeasible rules. Arguments can be attacked in three ways: attacking a premise, attacking a conclusion and attacking an inference. To resolve such conflicts, preferences may be used, which leads to three corresponding kinds of defeat, after which Dung’s (Artif Intell 77:321–357; 1995) abstract acceptability semantics can be used to evaluate the arguments. In the present paper the abstract framework is instantiated with strict inference rules corresponding to first-order logic and with defeasible inference rules for defeasible modus ponens and various argument schemes. The main techniques used in the formal reconstruction of the case are rule-exception structures and arguments about rule validity. Arguments about socio-legal values and the use of precedent cases are reduced to arguments about rule validity. The tree structure of arguments, with explicit subargument relations between arguments, is used to capture the dependency relations between the elements of the court’s decision.

Journal

Artificial Intelligence and Law – Springer Journals

Published: Mar 11, 2012

There are no references for this article.