1532 search results - page 46 / 307 » The Symbol Grounding Problem |
133
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
123
Voted
IJDAR
2000
15 years 3 months ago
2000
: In this paper, we consider the general problem of technical document interpretation, applied to the documents of the French Telephonic Operator, France Telecom. More precisely, w...
105
click to vote
CAV
2009
Springer
16 years 4 months ago
2009
Springer
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...
181
click to vote
CONSTRAINTS
1998
15 years 3 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
116
click to vote
WEA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...