{"title":"项重写系统的排序","authors":"N. Dershowitz","doi":"10.1109/SFCS.1979.32","DOIUrl":null,"url":null,"abstract":"Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of \"simplification orderings\", orderings in which any term that is homeomorphically embeddable in another is smaller than the other. A particularly useful class of simplification orderings, the \"recursive path orderings\", is defined. Several examples of the use of such orderings in termination proofs are given.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"784","resultStr":"{\"title\":\"Orderings for term-rewriting systems\",\"authors\":\"N. Dershowitz\",\"doi\":\"10.1109/SFCS.1979.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of \\\"simplification orderings\\\", orderings in which any term that is homeomorphically embeddable in another is smaller than the other. A particularly useful class of simplification orderings, the \\\"recursive path orderings\\\", is defined. Several examples of the use of such orderings in termination proofs are given.\",\"PeriodicalId\":311166,\"journal\":{\"name\":\"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1979-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"784\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1979.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1979.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of "simplification orderings", orderings in which any term that is homeomorphically embeddable in another is smaller than the other. A particularly useful class of simplification orderings, the "recursive path orderings", is defined. Several examples of the use of such orderings in termination proofs are given.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
