Using Defeasible Logic Programming for Argumentation-Based Decision Support in Private Law

Authors:
C. Beierle;B. Freund;G. Kern-Isberner;M. Thimm
Affiliations:
FernUniversität in Hagen, Germany;FernUniversität in Hagen, Germany;Technische Universität Dortmund, Germany;Technische Universität Dortmund, Germany
Venue:
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Year:
2010

Citing 5
Cited 1

The British Nationality Act as a logic program

Communications of the ACM
The Role of Logic in Computational Models of Legal Argument: A Critical Survey

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Defeasible logic programming: an argumentative approach

Theory and Practice of Logic Programming
Introducing the Logic and Law Corner

Journal of Logic and Computation
A formal model of adjudication dialogues

Artificial Intelligence and Law

An approach to argumentation considering attacks through time

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Legal reasoning is one of the most obvious application areas for computational models of argumentation as the exchange of arguments and counterarguments is the established means for making decisions in law. In this paper we employ Defeasible Logic Programming (DeLP) for representing legal cases and for giving decision-support, exemplary for private law. We give a formalization of legal provisions that can be used easily by judges for supporting their decision process and present a working system that resembles the decision-making in legal reasoning, in particular, with respect to the burden of proof.