PLANNER: A Language for Manipulating Models and Proving Theorems in a Robot

dc.creator	Hewitt, Carl
dc.date	2004-10-04T14:44:07Z
dc.date	2004-10-04T14:44:07Z
dc.date	1970-08-01
dc.date.accessioned	2013-10-09T02:43:43Z
dc.date.available	2013-10-09T02:43:43Z
dc.date.issued	2013-10-09
dc.identifier	AIM-168
dc.identifier	http://hdl.handle.net/1721.1/6171
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	PLANNER is a language for proving theorems and manipulating models in a robot. The language is built out of a number of problem-solving primitives together with a hierarchical control structure. Statements can be asserted and perhaps later withdrawn as the state of the world changes. Conclusions can be drawn from these various changes in state. Goals can be established and dismissed when they are satisfied. The deductive system of PLANNER is subordinate to the hierarchical control structure in order to make the language efficient. The use of a general-purpose matching language makes the deductive system more powerful. The language is being applied to solve problems faced by a robot and as a semantic base for English.
dc.description	Revised
dc.format	81485104 bytes
dc.format	5850343 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-168
dc.title	PLANNER: A Language for Manipulating Models and Proving Theorems in a Robot

Files in this item

Files	Size	Format	View
There are no files associated with this item.