{"title":"语义融合测试和补全方法","authors":"David A. Plaisted","doi":"10.1016/S0019-9958(85)80005-X","DOIUrl":null,"url":null,"abstract":"<div><p>We present semantic methods for showing that a term-rewriting system is confluent. We also present methods for completing a given term-rewriting system to obtain an equivalent confluent system. These methods differ from the well-known and widely studied Knuth-Bendix method in that they emphasize semantics rather than syntax. Also, they often require more user interaction than the purely syntactic Knuth-Bendix method. The concept of “ground confluence” is discussed; methods for demonstrating ground confluence are also given. We give decision procedures for some sub-problems that arise in this method.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80005-X","citationCount":"144","resultStr":"{\"title\":\"Semantic confluence tests and completion methods\",\"authors\":\"David A. Plaisted\",\"doi\":\"10.1016/S0019-9958(85)80005-X\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We present semantic methods for showing that a term-rewriting system is confluent. We also present methods for completing a given term-rewriting system to obtain an equivalent confluent system. These methods differ from the well-known and widely studied Knuth-Bendix method in that they emphasize semantics rather than syntax. Also, they often require more user interaction than the purely syntactic Knuth-Bendix method. The concept of “ground confluence” is discussed; methods for demonstrating ground confluence are also given. We give decision procedures for some sub-problems that arise in this method.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80005-X\",\"citationCount\":\"144\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S001999588580005X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S001999588580005X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
We present semantic methods for showing that a term-rewriting system is confluent. We also present methods for completing a given term-rewriting system to obtain an equivalent confluent system. These methods differ from the well-known and widely studied Knuth-Bendix method in that they emphasize semantics rather than syntax. Also, they often require more user interaction than the purely syntactic Knuth-Bendix method. The concept of “ground confluence” is discussed; methods for demonstrating ground confluence are also given. We give decision procedures for some sub-problems that arise in this method.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
