# CHRiSM and Probabilistic Argumentation Logic

@inproceedings{Sneyers2013CHRiSMAP, title={CHRiSM and Probabilistic Argumentation Logic}, author={Jon Sneyers and D. D. Schreye and Thom W. Fr{\"u}hwirth}, year={2013} }

Riveret et al. proposed a framework for probabilistic legal reasoning. Their goal is to determine the chance of winning a court case, given the chances of the judge accepting certain claims and legal rules. We tackle the same problem by defining and implementing a new formalism, called probabilistic argumentation logic (PAL). We implement PAL in CHRiSM, and discuss how it can be seen as a probabilistic generalization of Nute’s defeasible logic. Not only does this provide an automation of the… Expand

#### Tables and Topics from this paper

#### One Citation

Probabilistic legal reasoning in CHRiSM

- Computer Science
- Theory and Practice of Logic Programming
- 2013

Probabilistic argumentation logic is defined and implemented, which can be seen as a probabilistic generalization of Nute's defeasible logic, which provides an automation of the — only hand-performed — computations in Riveret et al. and provides a solution to one of their open problems: a method to determine the initial probabilities from a given body of precedents. Expand

#### References

SHOWING 1-10 OF 12 REFERENCES

Probabilistic legal reasoning in CHRiSM

- Computer Science
- Theory and Practice of Logic Programming
- 2013

Probabilistic argumentation logic is defined and implemented, which can be seen as a probabilistic generalization of Nute's defeasible logic, which provides an automation of the — only hand-performed — computations in Riveret et al. and provides a solution to one of their open problems: a method to determine the initial probabilities from a given body of precedents. Expand

Argument-Based Extended Logic Programming with Defeasible Priorities

- Mathematics, Computer Science
- J. Appl. Non Class. Logics
- 1997

A semantics and proof theory of a system for defeasible argumentation in a logic-programming language with both weak and strong negation, where an argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks. Expand

Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics

- Computer Science
- JELIA
- 2006

By introducing ambiguity propagation into this logic, the assertions of defeasible theories coincide with the well-founded models of their logic program translations and the two formalisms are found to disagree in important cases. Expand

Success Chances in Argument Games: A Probabilistic Approach to Legal Disputes

- Computer Science
- JURIX
- 2007

A probabilistic approach embedded into an argumentation framework is provided to capture this uncertainty and its use to determine the expected utility to engage in a legal dispute. Expand

CHR(PRISM)-based probabilistic logic learning

- Computer Science
- Theory and Practice of Logic Programming
- 2010

This paper introduces a new probabilistic logic formalism, called CHRiSM, based on a combination of CHR and PRISM, which can be used for high-level rapid prototyping of complex statistical models by means of “chance rules”. Expand

Strategic argumentation: a game theoretical investigation

- Computer Science
- ICAIL
- 2007

It is a new element of the present approach that the exchange of arguments is analysed with game theoretical tools, yielding a prescriptive and to some extent even predictive account of the actual course of play. Expand

On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games

- Computer Science
- Artif. Intell.
- 1995

By showing that argumentation can be viewed as a special form of logic programming with negation as failure, this paper introduces a general logic-programming-based method for generating meta-interpreters for argumentation systems, a method very much similar to the compiler-compiler idea in conventional programming. Expand

Constraint Handling Rules ?

- 1995

We are investigating the use of a class of logical formulas to de-ne constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a… Expand

A glimpse of symbolic-statistical modeling by PRISM

- Computer Science
- Journal of Intelligent Information Systems
- 2008

We give a brief overview of a logic-based symbolic modeling language PRISM which provides a unified approach to generative probabilistic models including Bayesian networks, hidden Markov models and… Expand

Constraint Handling Rules: Compilation, Execution, and Analysis

- Computer Science
- 2011

This book provides an overview of the state of the art of CHR research based on a reviewed selection of recent doctoral theses, and presents results from three different areas ofCHR research: compilation and optimization, execution strategies, and program analysis. Expand