Date of Submission

Spring 2021

Academic Program

Computer Science

Project Advisor 1

Robert McGrail

Abstract/Artist's Statement

The long-range goal of this project is to develop an algorithm to decide whether two terms are unifiable over the theory of quandles. First, it is shown that the general E-unification reduces to the E-matching problem due to the right-cancellation axioms of quandles. The E-matching process takes the general narrowing approach to equational matching. However, a naive application of narrowing is, at best, recursively enumerable and hence will not terminate given terms that do not match. This modification of narrowing places a hard limit on the use of the delta rules of the term rewriting system for quandles to ensure termination. It is implemented in the SWI-Prolog logic programming language. The question remains open as to whether the imposed limits still allow the program to find a unifier for all matching pairs.

Open Access Agreement

Open Access

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

This work is protected by a Creative Commons license. Any use not permitted under that license is prohibited.