{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/44687"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/44687","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Planning with hypothetical reasoning","abstract":"A planner driven by a causal theory and based on hypothetical reasoning is constructed and discussed. The task is approached from the fundamentals of time and event logics, and causality, resulting in a planner suitable for modeling a wide variety of realistic problem domains, and capable of reasoning in an intuitive manner about dynamic domains. The underlying causal theory drives the planning process directly and, in conjunction with the uniform representation of time and causal facts, allows elegant solutions to planning problems. A new type of planning problem, the indirect goal problem, is identified and solved It is also shown that previous planners cannot solve this type of problem. The frame problem is discussed in detail, and given a computational definition, suitable for allowing objective comparison between different approaches. The hypothetical reasoning approach is shown to allow an elegant solution to the frame problem appropriate for planning systems.","abstract_html":"A planner driven by a causal theory and based on hypothetical reasoning is constructed and discussed. The task is approached from the fundamentals of time and event logics, and causality, resulting in a planner suitable for modeling a wide variety of realistic problem domains, and capable of reasoning in an intuitive manner about dynamic domains. The underlying causal theory drives the planning process directly and, in conjunction with the uniform representation of time and causal facts, allows elegant solutions to planning problems. A new type of planning problem, the indirect goal problem, is identified and solved It is also shown that previous planners cannot solve this type of problem. The frame problem is discussed in detail, and given a computational definition, suitable for allowing objective comparison between different approaches. The hypothetical reasoning approach is shown to allow an elegant solution to the frame problem appropriate for planning systems.","abstract_has_math":false,"creators":["Pendergraft, James O."],"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":["Nutter, Jane Terry","Kervick, Daniel M."],"year":1988,"date_issued":"1988-08-05","date_published":"1988-08-05","updated_at":"2026-07-22T22:20:18Z","subjects":[],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-09082012-040532"],"render_values":[{"text":"etd-09082012-040532","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/44687","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":["Nutter, Jane Terry","Kervick, Daniel M."]},{"key":"dc:contributor.department","label":"Department","values":["Computer Science and Applications"]},{"key":"dc:creator","label":"Author","values":["Pendergraft, James O."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T21:45:15Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T21:45:15Z","2012-09-08"]},{"key":"dc:date.issued","label":"Date","values":["1988-08-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: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-09082012-040532"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/44687"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A planner driven by a causal theory and based on hypothetical reasoning is constructed and discussed. The task is approached from the fundamentals of time and event logics, and causality, resulting in a planner suitable for modeling a wide variety of realistic problem domains, and capable of reasoning in an intuitive manner about dynamic domains. The underlying causal theory drives the planning process directly and, in conjunction with the uniform representation of time and causal facts, allows elegant solutions to planning problems. A new type of planning problem, the indirect goal problem, is identified and solved It is also shown that previous planners cannot solve this type of problem. The frame problem is discussed in detail, and given a computational definition, suitable for allowing objective comparison between different approaches. The hypothetical reasoning approach is shown to allow an elegant solution to the frame problem appropriate for planning systems."]},{"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":["Planning with hypothetical reasoning"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Roach, John W."],"dc:contributor.committeemember":["Nutter, Jane Terry","Kervick, Daniel M."],"dc:contributor.department":["Computer Science and Applications"],"dc:creator":["Pendergraft, James O."],"dc:date.accessioned":["2014-03-14T21:45:15Z"],"dc:date.available":["2014-03-14T21:45:15Z","2012-09-08"],"dc:date.issued":["1988-08-05"],"dc:description.abstract":["A planner driven by a causal theory and based on hypothetical reasoning is constructed and discussed. The task is approached from the fundamentals of time and event logics, and causality, resulting in a planner suitable for modeling a wide variety of realistic problem domains, and capable of reasoning in an intuitive manner about dynamic domains. The underlying causal theory drives the planning process directly and, in conjunction with the uniform representation of time and causal facts, allows elegant solutions to planning problems. A new type of planning problem, the indirect goal problem, is identified and solved It is also shown that previous planners cannot solve this type of problem. The frame problem is discussed in detail, and given a computational definition, suitable for allowing objective comparison between different approaches. The hypothetical reasoning approach is shown to allow an elegant solution to the frame problem appropriate for planning systems."],"dc:description.degree":["Master of Science"],"dc:format.medium":["BTD"],"dc:format.mimetype":["application/pdf"],"dc:identifier.other":["etd-09082012-040532"],"dc:identifier.uri":["http://hdl.handle.net/10919/44687"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Planning with hypothetical 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:20:18Z"}