Sciweavers

1532 search results - page 5 / 307
» The Symbol Grounding Problem
Sort
View
BIRTHDAY
2010
Springer
14 years 10 months ago
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
Dexter Kozen
AMAST
1997
Springer
15 years 1 months ago
Symbolic Bisimulation for Full LOTOS
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is de ned, following the approach taken for message passing CCS in HL95a], altered to take account of th...
Carron Shankland, Muffy Thomas
AIPS
2007
14 years 11 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
ISCI
2000
100views more  ISCI 2000»
14 years 9 months ago
A neurobiological interpretation of semiotics: meaning, representation, and information
The branch of semiotics called semantics deals with the relation between meanings and representations, widely known as the symbol grounding problem. The other branches of semiotic...
Walter J. Freeman