1532 search results - page 107 / 307 » The Symbol Grounding Problem |
109
click to vote
ACL
1992
15 years 5 months ago
1992
This paper presents a connectionist syntactic parser which uses Structure Unification Grammar as its grammatical framework. The parser is implemented in a connectionist architectu...
105
click to vote
FUIN
2006
15 years 4 months ago
2006
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
113
click to vote
TCS
2008
15 years 4 months ago
2008
We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
132
click to vote
SLOGICA
2008
15 years 2 months ago
2008
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
125
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Given an AWGN channel, we look at the problem of designing a source controlled binary antipodal signaling system for transmitting blocks of binary symbols generated either by a...