37 search results - page 1 / 8 » On the computational complexity of assumption-based argument... |
AI
2002
Springer
13 years 4 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
ARGMAS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Several recent works in the area of Artificial Intelligence focus on computational models of argumentation-based negotiation. However, even if computational models of ar...
ARGMAS
2007
Springer
13 years 8 months ago
2007
Springer
Argumentation can serve as an effective computational tool and as a useful abstraction for various agent activities and in particular for agent reasoning. In this paper we further ...
AMAI
2002
Springer
13 years 4 months ago
2002
Springer
Probabilistic argumentation systems are based on assumption-based reasoning for obtaining arguments supporting hypotheses and on probability theory to compute probabilities of sup...
ECAI
1992
Springer
13 years 9 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...