Close category search window
 

Ternary Boolean algebra unification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Wilkerson, R. ; Dept. of Comput. Sci., Missouri Univ., Rolla, MO, USA ; Murphy, D. ; Jenness, J. ; Pinet, B.
more authors

In order to unify terms in a ternary Boolean algebra (TBA), the authors exploit the properties of complete commutativity and pseudoassociativity and develop an E-unification algorithm for the equational theory E consisting of the axioms which define these two properties. The algorithm is for the most part a modification of J. Siekmann's (1979) C-unification algorithm, which is itself an extension of J. Robinson's (1965) unification algorithm for first-order terms. However, in the case of TBA terms, it is necessary to account for the possible rearrangement of subterms due to the effect of the pseudoassociative law. The algorithm for finding such rearrangements is based on both the pseudoassociative law and complete commutativity

Published in:
Applied Computing, 1990., Proceedings of the 1990 Symposium on

Date of Conference: 5-6 Apr 1990

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.