A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks
Abstract
This paper introduces a novel approach to model warrant computation in a skeptical abstract argumentation framework. We show that such search space can be defined as a lattice, and illustrate how the so-called dialectical constraints can play a role for guiding the efficient computation of warranted arguments.
Cite
Text
Chesñevar and Simari. "A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Chesñevar and Simari. "A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/chesnevar2007ijcai-lattice/)BibTeX
@inproceedings{chesnevar2007ijcai-lattice,
title = {{A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks}},
author = {Chesñevar, Carlos Iván and Simari, Guillermo Ricardo},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {280-285},
url = {https://mlanthology.org/ijcai/2007/chesnevar2007ijcai-lattice/}
}