Reifying Robots

a reading group

 Wednesdays, 3:15 - 4:30, NE43-941


To reify is "to convert mentally into a thing", according to the OED.  What does it mean, computationally, for a robot to reify something?  What kinds of advantages and disadvantages do representations that reify offer the builders of robots?  Can we have first-order representations that admit uncertainty and still maintain moderately tractable planning, learning, and inference?  Can we extract such representations from the visual signal?

We'll try to understand these questions and more in a reading group. 

Everyone is welcome, independent of representation-religious preference.
 
 


Reading for Wednesday, December 15

A Computational Model for Visual Selection, Y. Amit and D. Geman.


Previous readings:


Possible future readings:

Grounded Symbolic Computation between Heterogeneous Cooperating Robots David Jung and Alexander Zelinsky Autonomous Robots vol 8 no 3, 2000 Stuff on probabilistic logic programming Edwin de Jong thesis The Ballard et al. paper is at the following URL: ftp://ftp.cs.rochester.edu/pub/u/rao/papers/bbs96.ps.Z