首页 | 本学科首页   官方微博 | 高级检索  
     


Unification in Boolean rings
Authors:Ursula Martin  Tobias Nipkow
Affiliation:(1) Department of Computer Science, University of Manchester, M13 9PL Manchester, U.K.;(2) Present address: Department of Computer Science, Royal Holloway & Bedford New College, University of London, Egham Hill, TW20 0EX Egham, Surrey, U.K.;(3) Present address: Laboratory for Computer Science, MIT, 545 Technology Square, 01239 Cambridge, MA, U.S.A.
Abstract:We show that two Boolean terms which are unifiable have a most general unifier, which can be described using the terms themselves and a single unifier. Techniques for finding a single unifier are given.
Keywords:Boolean ring  Boolean algebra  unification  string equations
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号