布尔环和阿贝尔群自由扩展中的统一

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science Pub Date : 1988-07-05 DOI:10.1109/LICS.1988.5110

Alexandre Boudet, J. Jouannaud, M. Schmidt-Schauß

{"title":"布尔环和阿贝尔群自由扩展中的统一","authors":"Alexandre Boudet, J. Jouannaud, M. Schmidt-Schauß","doi":"10.1109/LICS.1988.5110","DOIUrl":null,"url":null,"abstract":"A complete unification algorithm is presented for the combination of two arbitrary equational theories E in T(F,X) and E/sup 1/ in T(F',X), where F and F' denote two disjoint sets of function symbols. The method adapts to unification of infinite trees. It is applied to two well-known open problems, when E is the theory of Boolean rings or the theory of Abelian groups, and E is the free theory. The interest to Boolean rings originates in VSLI verification.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Unification in free extensions of Boolean rings and Abelian groups\",\"authors\":\"Alexandre Boudet, J. Jouannaud, M. Schmidt-Schauß\",\"doi\":\"10.1109/LICS.1988.5110\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A complete unification algorithm is presented for the combination of two arbitrary equational theories E in T(F,X) and E/sup 1/ in T(F',X), where F and F' denote two disjoint sets of function symbols. The method adapts to unification of infinite trees. It is applied to two well-known open problems, when E is the theory of Boolean rings or the theory of Abelian groups, and E is the free theory. The interest to Boolean rings originates in VSLI verification.<<ETX>>\",\"PeriodicalId\":425186,\"journal\":{\"name\":\"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1988.5110\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1988.5110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

给出了两个任意方程理论E in T(F,X)和E/sup 1/ in T(F'，X)组合的完全统一算法，其中F和F'表示两个不相交的函数符号集。该方法适用于无限树的统一。它应用于两个著名的开放问题，当E是布尔环理论或阿贝尔群理论，E是自由理论。对布尔环的兴趣起源于VSLI验证。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Unification in free extensions of Boolean rings and Abelian groups

A complete unification algorithm is presented for the combination of two arbitrary equational theories E in T(F,X) and E/sup 1/ in T(F',X), where F and F' denote two disjoint sets of function symbols. The method adapts to unification of infinite trees. It is applied to two well-known open problems, when E is the theory of Boolean rings or the theory of Abelian groups, and E is the free theory. The interest to Boolean rings originates in VSLI verification.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science

自引率

0.00%

发文量