{"title":"用Knuth-Bendix顺序定向等式","authors":"Konstantin Korovin, A. Voronkov","doi":"10.1109/LICS.2003.1210047","DOIUrl":null,"url":null,"abstract":"Orientability of systems of equalities is the following problem: given a system of equalities s/sub 1/ /spl sime/ t/sub 1/, . . . , s/sub n/ /spl sime/ t/sub n/, does there exist a simplification ordering > which orients the system, that is for every i /spl isin/ {1, ..., n}, either s/sub i/ > t/sub i/ or t/sub i/ > s/sub i/. This problem can be used in rewriting for finding a canonical rewrite system for a system of equalities and in theorem proving for adjusting simplification orderings during completion. We prove that (rather surprisingly) the problem can be solved in polynomial time when we restrict ourselves to the Knuth-Bendix orderings.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Orienting equalities with the Knuth-Bendix order\",\"authors\":\"Konstantin Korovin, A. Voronkov\",\"doi\":\"10.1109/LICS.2003.1210047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Orientability of systems of equalities is the following problem: given a system of equalities s/sub 1/ /spl sime/ t/sub 1/, . . . , s/sub n/ /spl sime/ t/sub n/, does there exist a simplification ordering > which orients the system, that is for every i /spl isin/ {1, ..., n}, either s/sub i/ > t/sub i/ or t/sub i/ > s/sub i/. This problem can be used in rewriting for finding a canonical rewrite system for a system of equalities and in theorem proving for adjusting simplification orderings during completion. We prove that (rather surprisingly) the problem can be solved in polynomial time when we restrict ourselves to the Knuth-Bendix orderings.\",\"PeriodicalId\":280809,\"journal\":{\"name\":\"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2003.1210047\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2003.1210047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Orientability of systems of equalities is the following problem: given a system of equalities s/sub 1/ /spl sime/ t/sub 1/, . . . , s/sub n/ /spl sime/ t/sub n/, does there exist a simplification ordering > which orients the system, that is for every i /spl isin/ {1, ..., n}, either s/sub i/ > t/sub i/ or t/sub i/ > s/sub i/. This problem can be used in rewriting for finding a canonical rewrite system for a system of equalities and in theorem proving for adjusting simplification orderings during completion. We prove that (rather surprisingly) the problem can be solved in polynomial time when we restrict ourselves to the Knuth-Bendix orderings.