{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/9232"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/9232","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Simplification Infrastructure for an Implementation of the Chiron Logic","abstract":"<p>p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 11.5px Times}</p> <p>Simplification is an important and heavily used facility in many mathematical software</p> <p>systems including both computer algebra systems and computer theorem proving systems. The objective of the MathScheme project is to develop a new generation of mechanized mathematic systems that combines the advantages of both computer algebra and computer theorem proving. Serving as the underlying logic of MathScheme, Chiron is used to formalize mathematics in our project. Therefore, we want to build a simplifier that simplifies Chiron expressions for the MathScheme project. This thesis presents the design and implementation of a simplification infrastructure that allows users to build their own simplifiers. This framework can be viewed as a customizable simplifier. It provides a set of simplification strategies and mechanisms for managing contexts. The rules module of this framework allows future developers to define new simplification rules and add them into the rule library. Using different strategies and optional arguments, developers can build simplifiers that work in various ways. The ultimate goal of this framework is to provide a powerful tool with good flexibility so that other people can use it as a handy building block or an experimental environment in the future development and application of MathScheme.</p>","abstract_html":"&lt;p&gt;p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 11.5px Times}&lt;/p&gt; &lt;p&gt;Simplification is an important and heavily used facility in many mathematical software&lt;/p&gt; &lt;p&gt;systems including both computer algebra systems and computer theorem proving systems. The objective of the MathScheme project is to develop a new generation of mechanized mathematic systems that combines the advantages of both computer algebra and computer theorem proving. Serving as the underlying logic of MathScheme, Chiron is used to formalize mathematics in our project. Therefore, we want to build a simplifier that simplifies Chiron expressions for the MathScheme project. This thesis presents the design and implementation of a simplification infrastructure that allows users to build their own simplifiers. This framework can be viewed as a customizable simplifier. It provides a set of simplification strategies and mechanisms for managing contexts. The rules module of this framework allows future developers to define new simplification rules and add them into the rule library. Using different strategies and optional arguments, developers can build simplifiers that work in various ways. The ultimate goal of this framework is to provide a powerful tool with good flexibility so that other people can use it as a handy building block or an experimental environment in the future development and application of MathScheme.&lt;/p&gt;","abstract_has_math":false,"creators":["Zhang, Yin Han"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing and Software","school":null,"contributors":[],"advisors":["Farmer, William M."],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-09-23","date_published":"2010-09-23","updated_at":"2026-11-18T19:31:49Z","subjects":["Computer Engineering","Computer Sciences","Software Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/10630"],"render_values":[{"text":"https://doi.org/10.71548/10630","href":"https://doi.org/10.71548/10630","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/4373","5392","2041498"],"render_values":[{"text":"opendissertations/4373","href":null,"code":true},{"text":"5392","href":null,"code":true},{"text":"2041498","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/9232","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/9232","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F9232","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Farmer, William M."]},{"key":"dc:contributor.department","label":"Department","values":["Computing and Software"]},{"key":"dc:creator","label":"Author","values":["Zhang, Yin Han"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:46:18Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:46:18Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2011-06-01"]},{"key":"dc:date.issued","label":"Date","values":["2010-09-23"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Engineering","Computer Sciences","Software Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/4373","5392","2041498"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/9232","https://doi.org/10.71548/10630"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 11.5px Times}</p> <p>Simplification is an important and heavily used facility in many mathematical software</p> <p>systems including both computer algebra systems and computer theorem proving systems. The objective of the MathScheme project is to develop a new generation of mechanized mathematic systems that combines the advantages of both computer algebra and computer theorem proving. Serving as the underlying logic of MathScheme, Chiron is used to formalize mathematics in our project. Therefore, we want to build a simplifier that simplifies Chiron expressions for the MathScheme project. This thesis presents the design and implementation of a simplification infrastructure that allows users to build their own simplifiers. This framework can be viewed as a customizable simplifier. It provides a set of simplification strategies and mechanisms for managing contexts. The rules module of this framework allows future developers to define new simplification rules and add them into the rule library. Using different strategies and optional arguments, developers can build simplifiers that work in various ways. The ultimate goal of this framework is to provide a powerful tool with good flexibility so that other people can use it as a handy building block or an experimental environment in the future development and application of MathScheme.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Computer Science (MCS)"]},{"key":"dc:title","label":"Title","values":["Simplification Infrastructure for an Implementation of the Chiron Logic"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Farmer, William M."],"dc:contributor.department":["Computing and Software"],"dc:creator":["Zhang, Yin Han"],"dc:date.accessioned":["2014-06-18T16:46:18Z"],"dc:date.available":["2014-06-18T16:46:18Z"],"dc:date.created":["2011-06-01"],"dc:date.issued":["2010-09-23"],"dc:description.abstract":["<p>p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 11.5px Times}</p> <p>Simplification is an important and heavily used facility in many mathematical software</p> <p>systems including both computer algebra systems and computer theorem proving systems. The objective of the MathScheme project is to develop a new generation of mechanized mathematic systems that combines the advantages of both computer algebra and computer theorem proving. Serving as the underlying logic of MathScheme, Chiron is used to formalize mathematics in our project. Therefore, we want to build a simplifier that simplifies Chiron expressions for the MathScheme project. This thesis presents the design and implementation of a simplification infrastructure that allows users to build their own simplifiers. This framework can be viewed as a customizable simplifier. It provides a set of simplification strategies and mechanisms for managing contexts. The rules module of this framework allows future developers to define new simplification rules and add them into the rule library. Using different strategies and optional arguments, developers can build simplifiers that work in various ways. The ultimate goal of this framework is to provide a powerful tool with good flexibility so that other people can use it as a handy building block or an experimental environment in the future development and application of MathScheme.</p>"],"dc:description.degree":["Master of Computer Science (MCS)"],"dc:identifier.other":["opendissertations/4373","5392","2041498"],"dc:identifier.uri":["http://hdl.handle.net/11375/9232","https://doi.org/10.71548/10630"],"dc:subject":["Computer Engineering","Computer Sciences","Software Engineering"],"dc:title":["Simplification Infrastructure for an Implementation of the Chiron Logic"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:31:49Z"}