Hubert Comon-Lundh, Marianne Haberstrau, J. Jouannaud
{"title":"浅方程理论中的可决问题","authors":"Hubert Comon-Lundh, Marianne Haberstrau, J. Jouannaud","doi":"10.1109/LICS.1992.185538","DOIUrl":null,"url":null,"abstract":"Results for syntactic theories are generalized to shallow theories. The main technique used is the computation by ordered completion techniques of conservative extensions of the starting shallow presentation which are, respectively, ground convergent, syntactic, and cycle-syntactic. In all cases, the property that variables occur at depth at most one appears to be crucial. shallow theories thus emerge as a fundamental nontrivial, union-closed subclass of equational theories for which all important questions are decidable.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"3 1","pages":"255-265"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Decidable problems in shallow equational theories\",\"authors\":\"Hubert Comon-Lundh, Marianne Haberstrau, J. Jouannaud\",\"doi\":\"10.1109/LICS.1992.185538\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Results for syntactic theories are generalized to shallow theories. The main technique used is the computation by ordered completion techniques of conservative extensions of the starting shallow presentation which are, respectively, ground convergent, syntactic, and cycle-syntactic. In all cases, the property that variables occur at depth at most one appears to be crucial. shallow theories thus emerge as a fundamental nontrivial, union-closed subclass of equational theories for which all important questions are decidable.<<ETX>>\",\"PeriodicalId\":6412,\"journal\":{\"name\":\"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"3 1\",\"pages\":\"255-265\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1992.185538\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1992.185538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Results for syntactic theories are generalized to shallow theories. The main technique used is the computation by ordered completion techniques of conservative extensions of the starting shallow presentation which are, respectively, ground convergent, syntactic, and cycle-syntactic. In all cases, the property that variables occur at depth at most one appears to be crucial. shallow theories thus emerge as a fundamental nontrivial, union-closed subclass of equational theories for which all important questions are decidable.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
