A Terminating and Confluent Term Rewriting System for the Pure Equational Theory of Quandles

This article presents a term rewriting system for the first-order equational theory of quandles that is both terminating and confluent. As a consequence, it has unique normal forms and so encodes a decision procedure for quandle identities. However, the problem of computing a normal form for this te...

Full description

Saved in:
Bibliographic Details
Published in2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) pp. 157 - 163
Main Authors McGrail, Robert W., Nguyen, Thuy Trang, Tran, Thanh Thuy Trang, Tripathi, Arti
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2018
Subjects
confluence
Contracts
Mathematical model
quandle
Scientific computing
Solid modeling
Strain
strong normalization
Term rewriting systems
Visualization
Online AccessGet full text

Cover

More Information
Summary:This article presents a term rewriting system for the first-order equational theory of quandles that is both terminating and confluent. As a consequence, it has unique normal forms and so encodes a decision procedure for quandle identities. However, the problem of computing a normal form for this term rewriting system is, in worst case, EXP hard.
DOI:10.1109/SYNASC.2018.00035