1532 search results - page 8 / 307 » The Symbol Grounding Problem |
Publication
Most implementations of the language Refal represent ground expressions by doubly-linked lists, which results in low-cost concatenation. On the other hand, that representation nece...
163
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
101
click to vote
EPIA
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Robots need to ground their external vocabulary and internal symbols in observations of the world. In recent works, this problem has been approached through combinations ...
AAMAS
2005
Springer
15 years 3 months ago
2005
Springer
The ability to determine a sequence of actions in order to reach a particular goal is of utmost importance to mobile robots. One major problem with symbolic planning approaches re...
LICS
2003
IEEE
15 years 2 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...