Towards the Application of Association Rules for Defeasible Rules Discovery

In this paper we investigate the feasibility of Knowledge Discovery from Database (KDD) in order to facilitate the discovery of defeasible rules that represent the ratio decidendi underpinning legal decision making. Moreover we will argue in favour of Defeasible Logic as the appropriate formal system in which the extracted principles should be encoded.

[1]  J. Yearwood.  Case-based Retrieval of Refugee Review Tribunal Text Cases , 1998 .

[2]  Edwina L. Rissland,et al.  Detecting change in legal concepts , 1995, ICAIL '95.

[3]  Michael J. Maher.  Propositional defeasible logic has linear complexity , 2001, Theory and Practice of Logic Programming.

[4]  Frans Coenen,et al.  Algorithms for computing association rules using a partial-support tree , 2000, Knowl. Based Syst..

[5]  Michael J. Maher,et al.  A Family of Defeasible Reasoning Logics and its Implementation , 2000, ECAI.

[6]  Michael J. Maher,et al.  Efficient defeasible reasoning systems , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.

[7]  Trevor J. M. Bench-Capon.  Neural networks and open texture , 1993, ICAIL '93.

[8]  Guido Governatori,et al.  On the Modeling and Analysis of Regulations , 1999 .

[9]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

[10]  Philip J. Hayes,et al.  Intelligent high-volume text processing using shallow, domain-specific techniques , 1992 .

[11]  Paul Thompson.  Automatic categorization of case law , 2001, ICAIL '01.

[12]  Erich Schweighofer.  The Revolution in Legal Information Retrieval or: The Empire Strikes Back , 1999, Journal of Information, Law and Technology.

[13]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[14]  Michael J. Maher,et al.  Argumentation Semantics for Defeasible Logics , 2000, PRICAI.

[15]  Gregory Piatetsky-Shapiro,et al.  Knowledge Discovery in Databases: An Overview , 1992, AI Mag..

[16]  Dawn Wilkins,et al.  The effectiveness of machine learning techniques for predicting time to case disposition , 1997, ICAIL '97.

[17]  Guido Governatori,et al.  A formal approach to protocols and strategies for (legal) negotiation , 2001, ICAIL '01.

[18]  David Billington,et al.  Defeasible Logic is Stable , 1993, J. Log. Comput..

[19]  Michael J. Maher,et al.  An Argumentation-Theoretic Characterization of Defeasible Logic , 2000, ECAI.

[20]  Anandeep Pannu,et al.  Using genetic algorithms to inductively reason with cases in the legal domain , 1995, ICAIL '95.

[21]  William Frawley,et al.  Knowledge Discovery in Databases , 1991 .

[22]  Marie-Francine Moens,et al.  Abstracting of legal cases: the SALOMON experience , 1997, ICAIL '97.

[23]  Luc De Raedt,et al.  Mining Association Rules in Multiple Relations , 1997, ILP.

[24]  Donald Nute,et al.  Prolog Programming in Depth , 1988 .

[25]  Michael J. Maher,et al.  Representation results for defeasible logic , 2000, TOCL.

[26]  Edwina L. Rissland,et al.  Finding legally relevant passages in case opinions , 1997, ICAIL '97.

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

[28]  John Zeleznikow,et al.  The Credit Act Advisory System (CAAS): conversion from an expert system prototype to a C++ commercial system , 1993, ICAIL '93.

[29]  Kevin D. Ashley,et al.  Improving the representation of legal case texts with information extraction methods , 2001, ICAIL '01.