A lattice-based approach to computing warranted belief in skeptical argumentation frameworks (2007)
| Venue: | In Proc. of the 20th Intl. Joint Conf. on Artificial Intelligence (IJCAI 2007), Hyberabad |
| Citations: | 3 - 2 self |
BibTeX
@INPROCEEDINGS{Chesñevar07alattice-based,
author = {Carlos Chesñevar and Guillermo Simari},
title = {A lattice-based approach to computing warranted belief in skeptical argumentation frameworks},
booktitle = {In Proc. of the 20th Intl. Joint Conf. on Artificial Intelligence (IJCAI 2007), Hyberabad},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract argumentation frameworks have played a major role as a way of understanding argumentbased inference, resulting in different argumentbased semantics. In order to make such semantics computationally attractive, suitable proof procedures are required, in which a search space of arguments is examined to find out which arguments are warranted or ultimately acceptable. 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. 1
