Abduction and legal reasoning

In this paper we present LAILA+, an extension of the LAILA coordination language for abductive logic agents, i.e. reasoning agents that collaborate towards the solution of a given problem exploiting a set of distributed, possibly partial, knowledge of the application domain. The extension consists of i) the possibility for agents to communicate with each other hypotheses while devising a coordinated solution, and ii) a relaxed consistency mechanism based on a given agent hierarchy: stronger agent coherence may overcome weaker agent inconsistency. We argue that the framework well adapts to legal reasoning, with agents that try to prove/disprove evidences from different, possibly partial and hierarchical, viewpoints, as often happens for instance in a trial.

[1]  Henry Prakken,et al.  Argument-Based Extended Logic Programming with Defeasible Priorities , 1997, J. Appl. Non Class. Logics.

[2]  Ira Rudowsky,et al.  Intelligent Agents , 2004, Commun. Assoc. Inf. Syst..

[3]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

[4]  G. L. Collected Papers , 1912, Nature.

[5]  Michael Wooldridge,et al.  Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence , 1999 .

[6]  Henry Prakken,et al.  The Role of Logic in Computational Models of Legal Argument: A Critical Survey , 2002, Computational Logic: Logic Programming and Beyond.

[7]  Evelina Lamma,et al.  LAILA: a language for coordinating abductive reasoning among logic agents , 2001, Comput. Lang..

[8]  Evelina Lamma,et al.  Cooperation and Competition in ALIAS: A Logic Framework for Agents that Negotiate , 2004, Annals of Mathematics and Artificial Intelligence.