{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/72054"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/72054","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Explanation-Based Learning via Constraint Posting and Propagation","abstract":"Researchers in a new subfield of Machine Learning called Explanation-Based Learning have begun to utilize explanations as a basis for powerful learning strategies. The fundamental idea is that explanations can be used to focus on essentials and to strip away extraneous details--obviating the need to search for generalizations based on similarities and differences among large numbers of examples.","abstract_html":"Researchers in a new subfield of Machine Learning called Explanation-Based Learning have begun to utilize explanations as a basis for powerful learning strategies. The fundamental idea is that explanations can be used to focus on essentials and to strip away extraneous details--obviating the need to search for generalizations based on similarities and differences among large numbers of examples.","abstract_has_math":false,"creators":["O'Rorke, Paul Vincent"],"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":null,"date_issued":"10000-01-01","date_published":"10000-01-01","updated_at":"2026-07-22T22:26:06Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8711844"],"render_values":[{"text":"(UMI)AAI8711844","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/72054","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["O'Rorke, Paul Vincent"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["10000-01-01","1987","2014-12-17T20:00:17Z"]},{"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":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/72054","(UMI)AAI8711844"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Researchers in a new subfield of Machine Learning called Explanation-Based Learning have begun to utilize explanations as a basis for powerful learning strategies. The fundamental idea is that explanations can be used to focus on essentials and to strip away extraneous details--obviating the need to search for generalizations based on similarities and differences among large numbers of examples.","This thesis presents an idealized model of explanation-based learning centered on the notion of constraint posting and propagation. In this paradigm, problems are solved by posting constraints (specifying more and more precise descriptions of solutions). Solutions are generalized by eliminating unnecessary constraints. This view of explanation-based generalization is shown to have advantages over back-propagation approaches to generalization.","The results of experiments which demonstrate the power of the learning method are also presented. One experiment compares the performances of non-learning, rote-learning, and EBL versions of Newell, Shaw, and Simon's LOGIC-THEORIST on problems from Whitehead and Russell's Principia Mathematica. Another experiment involves an interactive automated apprentice called LA.","Made available in DSpace on 2014-12-17T20:00:17Z (GMT). No. of bitstreams: 1 8711844.pdf: 5828062 bytes, checksum: 270759bc165a702a784ac229a6ba37e4 (MD5) Previous issue date: 1987","Embargo set by: Seth Robbins for item 72222 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","193 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987."]},{"key":"dc:title","label":"Title","values":["Explanation-Based Learning via Constraint Posting and Propagation"]}]}],"canonical_facts":{"dc:creator":["O'Rorke, Paul Vincent"],"dc:date":["10000-01-01","1987","2014-12-17T20:00:17Z"],"dc:description":["Researchers in a new subfield of Machine Learning called Explanation-Based Learning have begun to utilize explanations as a basis for powerful learning strategies. The fundamental idea is that explanations can be used to focus on essentials and to strip away extraneous details--obviating the need to search for generalizations based on similarities and differences among large numbers of examples.","This thesis presents an idealized model of explanation-based learning centered on the notion of constraint posting and propagation. In this paradigm, problems are solved by posting constraints (specifying more and more precise descriptions of solutions). Solutions are generalized by eliminating unnecessary constraints. This view of explanation-based generalization is shown to have advantages over back-propagation approaches to generalization.","The results of experiments which demonstrate the power of the learning method are also presented. One experiment compares the performances of non-learning, rote-learning, and EBL versions of Newell, Shaw, and Simon's LOGIC-THEORIST on problems from Whitehead and Russell's Principia Mathematica. Another experiment involves an interactive automated apprentice called LA.","Made available in DSpace on 2014-12-17T20:00:17Z (GMT). No. of bitstreams: 1 8711844.pdf: 5828062 bytes, checksum: 270759bc165a702a784ac229a6ba37e4 (MD5) Previous issue date: 1987","Embargo set by: Seth Robbins for item 72222 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","193 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987."],"dc:identifier":["http://hdl.handle.net/2142/72054","(UMI)AAI8711844"],"dc:subject":["Computer Science"],"dc:title":["Explanation-Based Learning via Constraint Posting and Propagation"],"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:26:06Z"}