Abstract
It is currently possible to build computational models of single-case legal evidential reasoning, and many software packages are available on the market that are suitable for the task.1 It is true that every legal case is different, but we can reasonably hope to find general abstract structures, “consolidative models,”2 that can be applied to different cases whenever the same kind of evidence is dealt with.
This Article is the development of some of the ideas I presented in a somewhat different form at the Second World Conference on New Trends in Criminal Investigation and Evidence in Amsterdam, in December 1999, and at the Artificial Intelligence and Judicial Proof Symposium, hosted by the Benjamin N. Cardozo School of Law and The Jacob Burns Institute for Advanced Legal Studies in New York, in April 2000. The discussions held at these conferences have so greatly contributed to this final version that I have to thank all the participants, and in particular, David Schum, for the obvious debt I owe to his work, and Peter Tillers for the fine job performed in organizing the conferences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Garbolino, P. (2002). Explaining Relevance. In: MacCrimmon, M., Tillers, P. (eds) The Dynamics of Judicial Proof. Studies in Fuzziness and Soft Computing, vol 94. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1792-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1792-8_9
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-662-00323-7
Online ISBN: 978-3-7908-1792-8
eBook Packages: Springer Book Archive