29908 search results - page 600 / 5982 » On the Complexity of |
156
click to vote
IUI
1993
ACM
15 years 11 months ago
1993
ACM
We examine the need for plan inference in intelligent help mechanisms. We argue that previous approaches have drawbacks that need to be overcome to make plan inference useful. Fir...
150
click to vote
MFCS
1993
Springer
15 years 11 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
208
click to vote
ECAI
1992
Springer
15 years 11 months ago
1992
Springer
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
