1532 search results - page 7 / 307 » The Symbol Grounding Problem |
108
Voted
COGSCI
2008
15 years 3 months ago
2008
fs Between Grounded and Abstract Representations: Evidence From Algebra Problem Solving Kenneth R. Koedingera, Martha W. Alibalib, Mitchell J. Nathanc a Human
174
click to vote
MST
2006
15 years 3 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
139
click to vote
CORR
1999
Springer
15 years 3 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
108
Voted
TRANSCI
1998
15 years 3 months ago
1998
121
Voted
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...