Argument Calculus and Networks

Abstract

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.

Cite

Text

Darwiche. "Argument Calculus and Networks." Conference on Uncertainty in Artificial Intelligence, 1993. doi:10.1016/B978-1-4832-1451-1.50055-X

Markdown

[Darwiche. "Argument Calculus and Networks." Conference on Uncertainty in Artificial Intelligence, 1993.](https://mlanthology.org/uai/1993/darwiche1993uai-argument/) doi:10.1016/B978-1-4832-1451-1.50055-X

BibTeX

@inproceedings{darwiche1993uai-argument,
  title     = {{Argument Calculus and Networks}},
  author    = {Darwiche, Adnan},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1993},
  pages     = {420-427},
  doi       = {10.1016/B978-1-4832-1451-1.50055-X},
  url       = {https://mlanthology.org/uai/1993/darwiche1993uai-argument/}
}