INDUCING FUNCTIONS IN ROBOT DOMAINS

dc.contributor.authorPauli, Davideng
dc.contributor.authorMacDonald, Bruceeng
dc.date.accessioned2008-02-26T22:37:43Z
dc.date.available2008-02-26T22:37:43Z
dc.date.computerscience1999-05-27eng
dc.date.issued1988-01-01eng
dc.description.abstractThis paper describes a reimplementation of a function induction algorithm that is part of Peter Andreae's robot procedure learning system NODDY. Results are given, the implementation is compared to Andreae's version, and the BACON and COPER systems are compared to both. The discussion focuses on the representation of knowledge--in particular on the representation of inverse operators and the induced expression--and the strength of argument typing.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1988-296-08eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30890
dc.identifier.urihttp://hdl.handle.net/1880/45570
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleINDUCING FUNCTIONS IN ROBOT DOMAINSeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1988-296-08.pdf
Size:
1.28 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description: