Argument Calculus and Networks

03/06/2013
by   Adnan Darwiche, et al.
0

A major reason behind the success of probability calculus is that it possesses a number of valuable tools, which are based on the notion of probabilistic independence. In this paper, I identify a notion of logical independence that makes some of these tools available to a class of propositional databases, called argument databases. Specifically, I suggest a graphical representation of argument databases, called argument networks, which resemble Bayesian networks. I also suggest an algorithm for reasoning with argument networks, which resembles a basic algorithm for reasoning with Bayesian networks. Finally, I show that argument networks have several applications: Nonmonotonic reasoning, truth maintenance, and diagnosis.

READ FULL TEXT

page 1

page 3

research
03/20/2013

Representing Bayesian Networks within Probabilistic Horn Abduction

This paper presents a simple framework for Horn clause abduction, with p...
research
01/23/2013

Contextual Weak Independence in Bayesian Networks

It is well-known that the notion of (strong) conditional independence (C...
research
01/30/2013

Irrelevance and Independence Relations in Quasi-Bayesian Networks

This paper analyzes irrelevance and independence relations in graphical ...
research
03/20/2013

Advances in Probabilistic Reasoning

This paper discuses multiple Bayesian networks representation paradigms ...
research
05/01/2019

QKD in Isabelle -- Bayesian Calculation

In this paper, we present a first step towards a formalisation of the Qu...
research
02/06/2013

Learning Bayesian Networks from Incomplete Databases

Bayesian approaches to learn the graphical structure of Bayesian Belief ...
research
05/17/2022

Mechanized Analysis of Anselm's Modal Ontological Argument

We use a mechanized verification system, PVS, to examine the argument fr...

Please sign up or login with your details

Forgot password? Click here to reset