{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/21384"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/21384","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Domain-based program synthesis using planning and derivational analogy","abstract":"In this thesis, I propose a domain-based, integrated framework for program synthesis that emphasizes the reuse of software components and past experience in solving problems. A crucial component of the framework is a concept dictionary that contains a description of domain related components. This forms a basis for communicating with a user in a high-level, application-oriented terms; for constructing generic, problem-solving rules, and for reasoning by analogy. The other components of the framework include a library of reusable subroutines, cliches, and derivation histories of previously solved problems, a layered rulebase, a hierarchical planner, and an analogical reasoner based on Carbonell's derivational analogy paradigm.","abstract_html":"In this thesis, I propose a domain-based, integrated framework for program synthesis that emphasizes the reuse of software components and past experience in solving problems. A crucial component of the framework is a concept dictionary that contains a description of domain related components. This forms a basis for communicating with a user in a high-level, application-oriented terms; for constructing generic, problem-solving rules, and for reasoning by analogy. The other components of the framework include a library of reusable subroutines, cliches, and derivation histories of previously solved problems, a layered rulebase, a hierarchical planner, and an analogical reasoner based on Carbonell's derivational analogy paradigm.","abstract_has_math":false,"creators":["Bhansali, Sanjay"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Harandi, Mehdi T."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T13:07:06Z","date_published":"2011-05-07T13:07:06Z","updated_at":"2026-07-22T22:25:17Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1991 Bhansali, Sanjay"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9136544","(UMI)AAI9136544"],"render_values":[{"text":"AAI9136544","href":null,"code":true},{"text":"(UMI)AAI9136544","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/21384","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Harandi, Mehdi T."]},{"key":"dc:creator","label":"Author","values":["Bhansali, Sanjay"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:07:06Z","10000-01-01","1991"]},{"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 1991 Bhansali, Sanjay"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9136544","(UMI)AAI9136544","http://hdl.handle.net/2142/21384"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this thesis, I propose a domain-based, integrated framework for program synthesis that emphasizes the reuse of software components and past experience in solving problems. A crucial component of the framework is a concept dictionary that contains a description of domain related components. This forms a basis for communicating with a user in a high-level, application-oriented terms; for constructing generic, problem-solving rules, and for reasoning by analogy. The other components of the framework include a library of reusable subroutines, cliches, and derivation histories of previously solved problems, a layered rulebase, a hierarchical planner, and an analogical reasoner based on Carbonell's derivational analogy paradigm.","The planner uses the rulebase and the library to decompose a given problem in a top-down manner and synthesize a plan for solving it. The layered structure of the rule-base ensures that efficient plans are preferred over inefficient ones, and the changes needed to synthesize programs for a different domain are minimal. The analogical reasoner complements the role of the planner. It uses a set of heuristics to retrieve a problem from the derivation history library that is analogous to a current problem, and replays the derivation of the retrieved problem to synthesize a program for the current problem. A solved problem is stored back into the derivation history library, and may be used to solve a different problem in a future context.","A prototype system, APU, based on the above framework has been implemented for the domain of UNIX programming. We describe a set of experiments designed to test the performance of APU, and provide empirical results demonstrating the feasibility and usefulness of the approach.","Made available in DSpace on 2011-05-07T13:07:06Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9136544.pdf: 6890368 bytes, checksum: e87b29a6acbd4fdacf00e587222cf90b (MD5) Previous issue date: 1991","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:50:25Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:23:02-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":["Domain-based program synthesis using planning and derivational analogy"]}]}],"canonical_facts":{"dc:contributor":["Harandi, Mehdi T."],"dc:creator":["Bhansali, Sanjay"],"dc:date":["2011-05-07T13:07:06Z","10000-01-01","1991"],"dc:description":["In this thesis, I propose a domain-based, integrated framework for program synthesis that emphasizes the reuse of software components and past experience in solving problems. A crucial component of the framework is a concept dictionary that contains a description of domain related components. This forms a basis for communicating with a user in a high-level, application-oriented terms; for constructing generic, problem-solving rules, and for reasoning by analogy. The other components of the framework include a library of reusable subroutines, cliches, and derivation histories of previously solved problems, a layered rulebase, a hierarchical planner, and an analogical reasoner based on Carbonell's derivational analogy paradigm.","The planner uses the rulebase and the library to decompose a given problem in a top-down manner and synthesize a plan for solving it. The layered structure of the rule-base ensures that efficient plans are preferred over inefficient ones, and the changes needed to synthesize programs for a different domain are minimal. The analogical reasoner complements the role of the planner. It uses a set of heuristics to retrieve a problem from the derivation history library that is analogous to a current problem, and replays the derivation of the retrieved problem to synthesize a program for the current problem. A solved problem is stored back into the derivation history library, and may be used to solve a different problem in a future context.","A prototype system, APU, based on the above framework has been implemented for the domain of UNIX programming. We describe a set of experiments designed to test the performance of APU, and provide empirical results demonstrating the feasibility and usefulness of the approach.","Made available in DSpace on 2011-05-07T13:07:06Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9136544.pdf: 6890368 bytes, checksum: e87b29a6acbd4fdacf00e587222cf90b (MD5) Previous issue date: 1991","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:50:25Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:23:02-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":["AAI9136544","(UMI)AAI9136544","http://hdl.handle.net/2142/21384"],"dc:language":["eng"],"dc:rights":["Copyright 1991 Bhansali, Sanjay"],"dc:subject":["Computer Science"],"dc:title":["Domain-based program synthesis using planning and derivational analogy"],"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:17Z"}