1094 search results - page 61 / 219 » On Computing Explanations in Argumentation |
105
click to vote
ACL
2010
14 years 9 months ago
2010
For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
ACL
2009
14 years 8 months ago
2009
We describe an unsupervised system for learning narrative schemas, coherent sequences or sets of events (arrested(POLICE,SUSPECT), convicted( JUDGE, SUSPECT)) whose arguments are ...
ENTCS
2008
14 years 10 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
TCS
2011
14 years 6 months ago
2011
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
ARITH
2005
IEEE
15 years 4 months ago
2005
IEEE
In a search for an algorithm to compute atan(x) which has both low latency and few floating point instructions, an interesting variant of familiar trigonometry formulas was disco...