Type of Document Dissertation Author Alvin, Christopher Thomas URN etd-06182015-152532 Title Synthesis With Hypergraphs Degree Doctor of Philosophy (Ph.D.) Department Computer Science Advisory Committee
Advisor Name Title Mukhopadhyay, Supratik Committee Chair Busch, Konstantin Committee Member Lawson, Jimmie D Committee Member MacGregor, S Kim Dean's Representative Keywords
- problem synthesis
- solution synthesis
- molecular synthesis
- knowledge representation
Date of Defense 2015-05-06 Availability unrestricted AbstractMany problems related to synthesis with intelligent tutoring may be phrased as program
synthesis problems using AI-style search and formal reasoning techniques. The first two
results in this dissertation focus on problem synthesis as an aspect of intelligent tutoring
systems applied to STEM-based education frameworks, specifically high school geometry.
Given a geometric figure as input, our technique constructs a hypergraph representing
logical deduction of facts, and then traverses the hypergraph to synthesize problems and
their corresponding solutions.
Using similar techniques, our third result is focused on exhaustive synthesis of molecules.
This synthesis process involves bonding sets of basic, molecular `fragments' according to
chemical constraints to create molecules of increasing size. For each input set of fragments, synthesis results in a significant set of molecules. Due to big data constraints we give special consideration in how to construct a corresponding molecular hypergraph based on a target, template molecule. Synthesis of the target molecule in a laboratory environment then corresponds to any path in the molecular hypergraph from the set of fragments to the target molecule.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access alvin_diss.pdf 1.25 Mb 00:05:47 00:02:58 00:02:36 00:01:18 00:00:06
If you have questions or technical problems, please Contact LSU-ETD Support.