1094 search results - page 32 / 219 » On Computing Explanations in Argumentation |
COMMA
2008
14 years 12 months ago
2008
Abstract. The identification of consistent sets of arguments is one of the most important concerns in the development of computational models of argument. Such extensions drive the...
COMMA
2006
14 years 12 months ago
2006
Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...
ECAI
2006
Springer
15 years 2 months ago
2006
Springer
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extract...
JUCS
2010
14 years 5 months ago
2010
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
EUROCRYPT
2007
Springer
15 years 4 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...