1094 search results - page 62 / 219 » On Computing Explanations in Argumentation |
ATAL
2005
Springer
15 years 4 months ago
2005
Springer
Systems of argumentation or ’computational dialectic’ are emerging as a powerful means of structuring inter-agent communication in multi-agent systems. Individual systems of c...
CSL
2008
Springer
15 years 23 days ago
2008
Springer
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
ENTCS
2007
14 years 11 months ago
2007
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
111
click to vote
MST
2011
14 years 6 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 ...
CSFW
2007
IEEE
15 years 5 months ago
2007
IEEE
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...