{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/23440"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/23440","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Representation and automatic synthesis of reaction plans","abstract":"\"Rather than committing to a particular future course of events, reaction plans prescribe reactions to be used if various situations should occur. In this respect reaction plans are closely related to both production systems and process control programs. The \"\"Universal Plans\"\" representation is an extreme member of the class of reaction plans, making no assumptions whatever about the future. This Dissertation introduces Universal Plans and shows how they can be automatically constructed from a declarative description of the effects of individual actions.\"","abstract_html":""Rather than committing to a particular future course of events, reaction plans prescribe reactions to be used if various situations should occur. In this respect reaction plans are closely related to both production systems and process control programs. The ""Universal Plans"" representation is an extreme member of the class of reaction plans, making no assumptions whatever about the future. This Dissertation introduces Universal Plans and shows how they can be automatically constructed from a declarative description of the effects of individual actions."","abstract_has_math":false,"creators":["Schoppers, Marcel Joachim"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T14:14:15Z","date_published":"2011-05-07T14:14:15Z","updated_at":"2026-07-22T22:25:22Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1989 Schoppers, Marcel Joachim"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9011008","(UMI)AAI9011008"],"render_values":[{"text":"AAI9011008","href":null,"code":true},{"text":"(UMI)AAI9011008","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/23440","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Schoppers, Marcel Joachim"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T14:14:15Z","10000-01-01","1989"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1989 Schoppers, Marcel Joachim"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9011008","(UMI)AAI9011008","http://hdl.handle.net/2142/23440"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["\"Rather than committing to a particular future course of events, reaction plans prescribe reactions to be used if various situations should occur. In this respect reaction plans are closely related to both production systems and process control programs. The \"\"Universal Plans\"\" representation is an extreme member of the class of reaction plans, making no assumptions whatever about the future. This Dissertation introduces Universal Plans and shows how they can be automatically constructed from a declarative description of the effects of individual actions.\"","\"Even before there has been any planning, the Universal Plans executor will be able--in most situations, and with searching--to find something to do next. Of course, the reaction suggested by such an \"\"unplanned plan\"\" might be both too late and seriously wrong. Universal Plans at this stage of inexperience might be regarded as \"\"muddling along\"\". The planner solves search problems and avoids pitfalls for the executor by adding new rules to the rulebase initially received as the domain description. The planner's additions are best regarded as advice for the plan executor.\"","\"Because Universal Plans are highly conditional, almost all the effects of any plan are conditional. Further, the conditional effects of plans can be conveniently controlled by limiting the circumstances in which a plan is allowed to execute. This possibility gives rise to a new planning technique I call \"\"confinement\"\" that is capable of solving even mutual goal conflicts without interleaving the goal trees of the interacting subplans. This has several important consequences. (1) Subplans can now be reused without modification: a plan that achieves P $\\wedge$ Q utilizes in a straightforward way the subplans that achieve P and Q separately. Thus the Universal Plans representation is also a programming language with an effect-preserving composition construct. (2) Because Universal Plans are reactive rather than predictive, the planner is liberated from part of the classical frame problem (the part recently renamed the \"\"persistence\"\" or \"\"inertia\"\" problem).\"","Made available in DSpace on 2011-05-07T14:14:15Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9011008.pdf: 9711450 bytes, checksum: 5add6ce9d382f837d91f709d82d82d79 (MD5) Previous issue date: 1989","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T15:04:29Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:30:49-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Representation and automatic synthesis of reaction plans"]}]}],"canonical_facts":{"dc:creator":["Schoppers, Marcel Joachim"],"dc:date":["2011-05-07T14:14:15Z","10000-01-01","1989"],"dc:description":["\"Rather than committing to a particular future course of events, reaction plans prescribe reactions to be used if various situations should occur. In this respect reaction plans are closely related to both production systems and process control programs. The \"\"Universal Plans\"\" representation is an extreme member of the class of reaction plans, making no assumptions whatever about the future. This Dissertation introduces Universal Plans and shows how they can be automatically constructed from a declarative description of the effects of individual actions.\"","\"Even before there has been any planning, the Universal Plans executor will be able--in most situations, and with searching--to find something to do next. Of course, the reaction suggested by such an \"\"unplanned plan\"\" might be both too late and seriously wrong. Universal Plans at this stage of inexperience might be regarded as \"\"muddling along\"\". The planner solves search problems and avoids pitfalls for the executor by adding new rules to the rulebase initially received as the domain description. The planner's additions are best regarded as advice for the plan executor.\"","\"Because Universal Plans are highly conditional, almost all the effects of any plan are conditional. Further, the conditional effects of plans can be conveniently controlled by limiting the circumstances in which a plan is allowed to execute. This possibility gives rise to a new planning technique I call \"\"confinement\"\" that is capable of solving even mutual goal conflicts without interleaving the goal trees of the interacting subplans. This has several important consequences. (1) Subplans can now be reused without modification: a plan that achieves P $\\wedge$ Q utilizes in a straightforward way the subplans that achieve P and Q separately. Thus the Universal Plans representation is also a programming language with an effect-preserving composition construct. (2) Because Universal Plans are reactive rather than predictive, the planner is liberated from part of the classical frame problem (the part recently renamed the \"\"persistence\"\" or \"\"inertia\"\" problem).\"","Made available in DSpace on 2011-05-07T14:14:15Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9011008.pdf: 9711450 bytes, checksum: 5add6ce9d382f837d91f709d82d82d79 (MD5) Previous issue date: 1989","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T15:04:29Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:30:49-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9011008","(UMI)AAI9011008","http://hdl.handle.net/2142/23440"],"dc:language":["eng"],"dc:rights":["Copyright 1989 Schoppers, Marcel Joachim"],"dc:subject":["Computer Science"],"dc:title":["Representation and automatic synthesis of reaction plans"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:22Z"}