1532 search results - page 6 / 307 » The Symbol Grounding Problem |
IAT
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we present a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
FSTTCS
2001
Springer
15 years 1 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
AIPS
2009
14 years 10 months ago
2009
Solving real-world problems using symbolic planning often requires a simplified formulation of the original problem, since certain subproblems cannot be represented at all or only...
CAISE
2006
Springer
15 years 1 months ago
2006
Springer
symbol systems and the world. In the case of problem frames the symbol systems are abstractions of the problems that an IS will solve rather than sentences, and the world is the pr...
ALT
2000
Springer
15 years 1 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...