1094 search results - page 55 / 219 » On Computing Explanations in Argumentation |
130
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning a...
117
click to vote
IJMI
2007
15 years 4 months ago
2007
s from Biomedical Abstracts Patrick Rucha , Celia Boyer c , Christine Chichesterb , Imad Tbahritiab Antoine Geissbühlera , Paul Fabrya , Julien Gobeilla , Violaine Pilletab , Diet...
140
click to vote
COLING
1990
15 years 5 months ago
1990
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
142
click to vote
ENTCS
2011
14 years 11 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation...
111
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when soluti...