37 search results - page 3 / 8 » On the computational complexity of assumption-based argument... |
DALT
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. This paper proposes a formal framework for agent communication where agents can reason about their goals using strategic reasoning. This reasoning is argumentation-based ...
CCIA
2010
Springer
13 years 1 months ago
2010
Springer
Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. An important concern in extensionbased-argumentation semantics is t...
MST
2011
13 years 1 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
ECCV
2006
Springer
14 years 8 months ago
2006
Springer
Recognition of complex activities from surveillance video requires detection and temporal ordering of its constituent "atomic" events. It also requires the capacity to ro...
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...