Publication

Evaluating Cases in Legal Disputes as Rival Theories

Jingshi Li
2010
Conference Papers

Abstract

In this paper we propose to draw a link from the quantitative notion of coherence, previously used to evaluate rival scientific theories, to legal reasoning. We evaluate the stories of the plaintiff and the defendant in a legal case as rival theories by measuring how well they cohere when accounting for the evidence. We show that this gives rise to a formalized comparison between rival cases that account for the same set of evidence, and provide a possible explanation as to why judgements may favour one side over the other. We illustrate our approach by applying it to a known legal dispute from the literature.

Official source

https://infoscience.epfl.ch/entities/publication/6a2c5d76-7746-4287-aa7b-7c53882b646f

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Jingshi Li
2010
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/6a2c5d76-7746-4287-aa7b-7c53882b646f

About this result

Related concepts (17)

Evaluation strategy

In a programming language, an evaluation strategy is a set of rules for evaluating expressions. The term is often used to refer to the more specific notion of a parameter-passing strategy that defines the kind of value that is passed to the function for each parameter (the binding strategy) and whether to evaluate the parameters of a function call, and if so in what order (the evaluation order). The notion of reduction strategy is distinct, although some authors conflate the two terms and the definition of each term is not widely agreed upon.

Defeasible reasoning

In philosophy of logic, defeasible reasoning is a kind of provisional reasoning that is rationally compelling, though not deductively valid.cite web | url= | title="Defeasible Reasoning," Stanford Encyclopedia of Philosophy | access-date=1 July 2016 It usually occurs when a rule is given, but there may be specific exceptions to the rule, or subclasses that are subject to a different rule. Defeasibility is found in literatures that are concerned with argument and the process of argument, or heuristic reasoning.

Deductive reasoning

Deductive reasoning is the mental process of drawing deductive inferences. An inference is deductively valid if its conclusion follows logically from its premises, i.e. it is impossible for the premises to be true and the conclusion to be false. For example, the inference from the premises "all men are mortal" and "Socrates is a man" to the conclusion "Socrates is mortal" is deductively valid. An argument is sound if it is valid and all its premises are true.

Related publications (31)

Evaluating Cases in Legal Disputes as Rival Theories

Chat with Graph Search

Toroidal families and averages of L-functions, I

Evaluation and digitalization: what are the key challenges for evaluation processes and evaluators?

Periodic and aperiodic NiFe nanomagnet/ferrimagnet hybrid structures for 2D magnon steering and interferometry with high extinction ratio