{"title":"On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity","authors":"P. Narendran, Andrew M. Marshall, B. Mahapatra","doi":"10.4204/EPTCS.42.5","DOIUrl":null,"url":null,"abstract":"We prove that the Tiden and Arnborg algorithm for equational unification modulo one-sided distributivity is not polynomial time bounded as previously thought. A set of counterexamples is developed that demonstrates that the algorithm goes through exponentially many steps.","PeriodicalId":164988,"journal":{"name":"UNIF","volume":"151 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"UNIF","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.42.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
We prove that the Tiden and Arnborg algorithm for equational unification modulo one-sided distributivity is not polynomial time bounded as previously thought. A set of counterexamples is developed that demonstrates that the algorithm goes through exponentially many steps.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
