An Abstract Model for Computing Warrant in Skeptical Argumentation Frameworks

CARLOS IVÁN CHESÑEVAR; GUILLERMO SIMARI,

Windermere, UK

Workshop; 11th Intl. Workshop on Non-Monotonic Reasoning (NMR 2006); 2006

Abstract argumentation frameworks have played a major role as a way of understanding argument-based inference, resulting in different argument-based semantics. The final goal of such semantics is to characterize which are the rationally justified (or warranted) beliefs associated with a given argumentative theory. In order to make such semantics computationally attractive, suitable argument-based proof procedures are required, in which a search space of arguments is examined looking for possible candidates that warrant those beliefs. This paper introduces an abstract approach to model the computation of warrant 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.