{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/41757"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/41757","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Analogical representation in temporal, spatial, and mnemonic reasoning","abstract":"The traditional Euclidean approach to problem solving in AI has always designed representations for a domain and then spent considerable effort on the methods of efficiently searching the representation in order to extract the desired information. We feel that the emphasis in problem solving should be on the automated construction of the knowledge representation and not on the searching of the representation. This thesis proposes and implements an alternative approach: that of analogical representation. Analogical representation differs from the Euclidean methodology in that it creates a representation for the data from which the acquisition of information is done by simple 'observation.' It is not our goal to propose a system that reduces the NP-hard problem of temporal reasoning to a lower complexity. Our approach simply minimizes the number of times that we must pay the exponential expense. Furthermore, the representation can encode uncertainty and unknownness in an efficient manner. This allows for 'intelligent' creation of a representation and removes the 'mindless' mechanical search techniques from information retrieval, placing the computational effort where it should be: on representation construction.","abstract_html":"The traditional Euclidean approach to problem solving in AI has always designed representations for a domain and then spent considerable effort on the methods of efficiently searching the representation in order to extract the desired information. We feel that the emphasis in problem solving should be on the automated construction of the knowledge representation and not on the searching of the representation. This thesis proposes and implements an alternative approach: that of analogical representation. Analogical representation differs from the Euclidean methodology in that it creates a representation for the data from which the acquisition of information is done by simple 'observation.' It is not our goal to propose a system that reduces the NP-hard problem of temporal reasoning to a lower complexity. Our approach simply minimizes the number of times that we must pay the exponential expense. Furthermore, the representation can encode uncertainty and unknownness in an efficient manner. This allows for 'intelligent' creation of a representation and removes the 'mindless' mechanical search techniques from information retrieval, placing the computational effort where it should be: on representation construction.","abstract_has_math":false,"creators":["Hostetter, Michael"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Computer Science and Applications","degree_department":"Computer Science and Applications","school":null,"contributors":[],"advisors":[],"committee_chairs":["Roach, John W."],"committee_members":["Ehrich, Roger W.","Nutter, Jane Terry"],"year":1990,"date_issued":"1990-01-05","date_published":"1990-01-05","updated_at":"2026-07-22T22:18:58Z","subjects":[],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-03242009-040545"],"render_values":[{"text":"etd-03242009-040545","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/41757","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Roach, John W."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Ehrich, Roger W.","Nutter, Jane Terry"]},{"key":"dc:contributor.department","label":"Department","values":["Computer Science and Applications"]},{"key":"dc:creator","label":"Author","values":["Hostetter, Michael"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T21:32:13Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T21:32:13Z","2009-03-24"]},{"key":"dc:date.issued","label":"Date","values":["1990-01-05"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science and Applications"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-03242009-040545"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/41757"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The traditional Euclidean approach to problem solving in AI has always designed representations for a domain and then spent considerable effort on the methods of efficiently searching the representation in order to extract the desired information. We feel that the emphasis in problem solving should be on the automated construction of the knowledge representation and not on the searching of the representation. This thesis proposes and implements an alternative approach: that of analogical representation. Analogical representation differs from the Euclidean methodology in that it creates a representation for the data from which the acquisition of information is done by simple 'observation.' It is not our goal to propose a system that reduces the NP-hard problem of temporal reasoning to a lower complexity. Our approach simply minimizes the number of times that we must pay the exponential expense. Furthermore, the representation can encode uncertainty and unknownness in an efficient manner. This allows for 'intelligent' creation of a representation and removes the 'mindless' mechanical search techniques from information retrieval, placing the computational effort where it should be: on representation construction."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["BTD"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Analogical representation in temporal, spatial, and mnemonic reasoning"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Roach, John W."],"dc:contributor.committeemember":["Ehrich, Roger W.","Nutter, Jane Terry"],"dc:contributor.department":["Computer Science and Applications"],"dc:creator":["Hostetter, Michael"],"dc:date.accessioned":["2014-03-14T21:32:13Z"],"dc:date.available":["2014-03-14T21:32:13Z","2009-03-24"],"dc:date.issued":["1990-01-05"],"dc:description.abstract":["The traditional Euclidean approach to problem solving in AI has always designed representations for a domain and then spent considerable effort on the methods of efficiently searching the representation in order to extract the desired information. We feel that the emphasis in problem solving should be on the automated construction of the knowledge representation and not on the searching of the representation. This thesis proposes and implements an alternative approach: that of analogical representation. Analogical representation differs from the Euclidean methodology in that it creates a representation for the data from which the acquisition of information is done by simple 'observation.' It is not our goal to propose a system that reduces the NP-hard problem of temporal reasoning to a lower complexity. Our approach simply minimizes the number of times that we must pay the exponential expense. Furthermore, the representation can encode uncertainty and unknownness in an efficient manner. This allows for 'intelligent' creation of a representation and removes the 'mindless' mechanical search techniques from information retrieval, placing the computational effort where it should be: on representation construction."],"dc:description.degree":["Master of Science"],"dc:format.medium":["BTD"],"dc:format.mimetype":["application/pdf"],"dc:identifier.other":["etd-03242009-040545"],"dc:identifier.uri":["http://hdl.handle.net/10919/41757"],"dc:language.iso":["en"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Analogical representation in temporal, spatial, and mnemonic reasoning"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Computer Science and Applications"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:18:58Z"}