Learning hierarchical decomposition rules for planning : an inductive logic programming approach Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/v405sg34h

Descriptions

Attribute NameValues
Creator
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2009-01-29T22:40:44Z (GMT). No. of bitstreams: 1 Chandrasekhara_Reddy.pdf: 858199 bytes, checksum: 3786d294a149714a67b3d897b2b8d679 (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-01-29T22:38:47Z (GMT) No. of bitstreams: 1 Chandrasekhara_Reddy.pdf: 858199 bytes, checksum: 3786d294a149714a67b3d897b2b8d679 (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-01-29T22:40:44Z (GMT) No. of bitstreams: 1 Chandrasekhara_Reddy.pdf: 858199 bytes, checksum: 3786d294a149714a67b3d897b2b8d679 (MD5)
  • description.provenance : Submitted by Philip Vue (vuep@onid.orst.edu) on 2009-01-29T22:14:22Z No. of bitstreams: 1 Chandrasekhara_Reddy.pdf: 858199 bytes, checksum: 3786d294a149714a67b3d897b2b8d679 (MD5)

Relationships

In Administrative Set:
Last modified: 11/06/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items