1094 search results - page 116 / 219 » On Computing Explanations in Argumentation |
AIPS
2011
14 years 2 months ago
2011
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
IVC
2008
14 years 11 months ago
2008
This paper considers arguments for the necessity of embodiment in cognitive vision systems. We begin by delineating the scope of cognitive vision, and follow this by a survey of t...
112
click to vote
SODA
2010
ACM
14 years 9 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
HUC
2009
Springer
15 years 3 months ago
2009
Springer
Intelligibility can help expose the inner workings and inputs of context-aware applications that tend to be opaque to users due to their implicit sensing and actions. However, use...
KR
1998
Springer
15 years 3 months ago
1998
Springer
Extended abduction introduced by Inoue and Sakama (1995) generalizes traditional abduction in the sense that it can compute negative explanations by removing hypotheses from a non...