纯量子方程理论的终止和合流项改写系统

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI:10.1109/SYNASC.2018.00035

Robert W. McGrail, Thuy Trang Nguyen, Thanh Thuy Trang Tran, A. Tripathi

{"title":"纯量子方程理论的终止和合流项改写系统","authors":"Robert W. McGrail, Thuy Trang Nguyen, Thanh Thuy Trang Tran, A. Tripathi","doi":"10.1109/SYNASC.2018.00035","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Terminating and Confluent Term Rewriting System for the Pure Equational Theory of Quandles\",\"authors\":\"Robert W. McGrail, Thuy Trang Nguyen, Thanh Thuy Trang Tran, A. Tripathi\",\"doi\":\"10.1109/SYNASC.2018.00035\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":273805,\"journal\":{\"name\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2018.00035\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2018.00035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文给出了一阶量子方程理论的终止性和合流性的项改写系统。因此，它具有唯一的范式，并因此编码了一个双重身份的决策过程。然而，在最坏的情况下，计算这个术语重写系统的标准形式的问题是EXP困难。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

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 term rewriting system is, in worst case, EXP hard.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

自引率

0.00%

发文量