Abstract argumentation

In this paper we explore the thesis that the role of argumentation in practical reasoning in general and legal reasoning in particular is to justify the use of defeasible rules to derive a conclusion in preference to the use of other defeasible rules to derive a conflicting conclusion. The defeasibility of rules is expressed by means of non-provability claims as additional conditions of the rules.We outline an abstract approach to defeasible reasoning and argumentation which includes many existing formalisms, including default logic, extended logic programming, non-monotonic modal logic and auto-epistemic logic, as special cases. We show, in particular, that the ‘admissibility’ semantics for all these formalisms has a natural argumentation-theoretic interpretation and proof procedure, which seem to correspond well with informal argumentation.In the admissibility semantics there is only one way for one argument to attack another, namely by undermining one of its non-provability claims. In this paper, we show how other kinds of attack between arguments, specifically how rebuttal and priority attacks, can be reduced to the undermining of non-provability claims.

[1]  Giovanni Sartor,et al.  The structure of norm conditions and nonmonotonic reasoning in law , 1991, ICAIL '91.

[2]  Robert A. Kowalski,et al.  Legislation as Logic Programs , 1992, Logic Programming Summer School.

[3]  Jaap Hage Teleological reasoning in reason-based logic , 1995, ICAIL '95.

[4]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[5]  Antonis C. Kakas,et al.  Computing the Acceptability Semantics , 1995, LPNMR.

[6]  Francesca Toni,et al.  Reduction of Abductive Logic Programs to Normal Logic Programs , 1995, ICLP.

[7]  Grigori F. Shvarts Autoepistemic Modal Logics , 1990, TARK.

[8]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[9]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[10]  Phan Minh Dung,et al.  An Argumentation Semantics for Logic Programming with Explicit Negation , 1993, ICLP.

[11]  Gerhard Brewka,et al.  Preferred Subtheories: An Extended Logical Framework for Default Reasoning , 1989, IJCAI.

[12]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming , 1993, IJCAI.

[13]  Robert C. Moore Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[14]  Henry Prakken,et al.  On the relation between legal language and legal argument: assumptions, applicability and dynamic priorities , 1995, ICAIL '95.

[15]  Henry Prakken,et al.  A dialectical model of assessing conflicting arguments in legal reasoning , 1996, Artificial Intelligence and Law.

[16]  Henry Prakken,et al.  Informatics and the Foundations of Legal Reasoning , 1996 .

[17]  Drew McDermott,et al.  Nonmonotonic Logic II: Nonmonotonic Modal Theories , 1982, JACM.

[18]  Dov M. Gabbay,et al.  Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning , 1994 .

[19]  Antonis C. Kakas,et al.  Logic Programming without Negation as Failure , 1995, ILPS.

[20]  Thomas F. Gordon,et al.  The Pleadings Game , 1994, Artificial Intelligence and Law.

[21]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[22]  John L. Pollock,et al.  Defeasible Reasoning , 2020, Synthese Library.

[23]  Phan Minh Dung,et al.  An Abstract, Argumentation-Theoretic Approach to Default Reasoning , 1997, Artif. Intell..