We present two implementation enhancements for the Boolean satisfiability problem and one visualization technique. The first is an expansion to a tri-nary logic system with a commit phase. The three states are (1) true, (2) false, and (3) don't care. We abstracted the operations of AND and OR to this hyperlogic system in a novel way. The commit phase works on one variable at a time and transitions values from temporary to permanent whenever possible. We viewed tri-state logic as a hyperspace above the binary (Boolean) logic. The second improvement is algorithmic. We modified the semantics of the classic 3 Conjunctive Normal Form Problem in order to develop a polynomial time algorithm for a simplified normal form - avoiding the need to examine all combinatoric limitations. In particular, we abandoned 3 CNF and used an unstructured left to right associativity. We do not claim that this new semantic is comprehensive. We do claim that it is simpler. Lastly, we introduced a node analogy to help us understand the algorithm itself.
","abstract_html":"<p>We present two implementation enhancements for the Boolean satisfiability problem and one visualization technique. The first is an expansion to a tri-nary logic system with a commit phase. The three states are (1) true, (2) false, and (3) don't care. We abstracted the operations of AND and OR to this hyperlogic system in a novel way. The commit phase works on one variable at a time and transitions values from temporary to permanent whenever possible. We viewed tri-state logic as a hyperspace above the binary (Boolean) logic. The second improvement is algorithmic. We modified the semantics of the classic 3 Conjunctive Normal Form Problem in order to develop a polynomial time algorithm for a simplified normal form - avoiding the need to examine all combinatoric limitations. In particular, we abandoned 3 CNF and used an unstructured left to right associativity. We do not claim that this new semantic is comprehensive. We do claim that it is simpler. Lastly, we introduced a node analogy to help us understand the algorithm itself.</p>","abstract_has_math":false,"creators":["Byrd, Kevin Michael"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Masters Thesis","degree_discipline":"Computing","degree_department":null,"school":null,"contributors":["Louise Perkins"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-01T07:00:00Z","date_published":"2011-05-01T07:00:00Z","updated_at":"2026-07-24T05:44:58Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://aquila.usm.edu/masters_theses/421","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Louise Perkins"]},{"key":"dc:creator","label":"Author","values":["Byrd, Kevin Michael"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2018-11-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computing"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://aquila.usm.edu/masters_theses/421"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We present two implementation enhancements for the Boolean satisfiability problem and one visualization technique. The first is an expansion to a tri-nary logic system with a commit phase. The three states are (1) true, (2) false, and (3) don't care. We abstracted the operations of AND and OR to this hyperlogic system in a novel way. The commit phase works on one variable at a time and transitions values from temporary to permanent whenever possible. We viewed tri-state logic as a hyperspace above the binary (Boolean) logic. The second improvement is algorithmic. We modified the semantics of the classic 3 Conjunctive Normal Form Problem in order to develop a polynomial time algorithm for a simplified normal form - avoiding the need to examine all combinatoric limitations. In particular, we abandoned 3 CNF and used an unstructured left to right associativity. We do not claim that this new semantic is comprehensive. We do claim that it is simpler. Lastly, we introduced a node analogy to help us understand the algorithm itself.
"]},{"key":"dc:title","label":"Title","values":["Tri-State Boolean Satisfiability with Commit: An Efficient Partial Solution Using Hyperlogic"]}]}],"canonical_facts":{"dc:contributor":["Louise Perkins"],"dc:creator":["Byrd, Kevin Michael"],"dc:date.available":["2018-11-01T07:00:00Z"],"dc:description.abstract":["We present two implementation enhancements for the Boolean satisfiability problem and one visualization technique. The first is an expansion to a tri-nary logic system with a commit phase. The three states are (1) true, (2) false, and (3) don't care. We abstracted the operations of AND and OR to this hyperlogic system in a novel way. The commit phase works on one variable at a time and transitions values from temporary to permanent whenever possible. We viewed tri-state logic as a hyperspace above the binary (Boolean) logic. The second improvement is algorithmic. We modified the semantics of the classic 3 Conjunctive Normal Form Problem in order to develop a polynomial time algorithm for a simplified normal form - avoiding the need to examine all combinatoric limitations. In particular, we abandoned 3 CNF and used an unstructured left to right associativity. We do not claim that this new semantic is comprehensive. We do claim that it is simpler. Lastly, we introduced a node analogy to help us understand the algorithm itself.
"],"dc:identifier":["https://aquila.usm.edu/masters_theses/421"],"dc:title":["Tri-State Boolean Satisfiability with Commit: An Efficient Partial Solution Using Hyperlogic"],"thesis:degree_discipline":["Computing"],"thesis:degree_level":["Masters Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-07-24T05:44:58Z"}