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.