Unification in boolean rings

Ursula Martin, Tobias Nipkow

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

A simple unification algorithm for terms containing variables, constants and the set operators intersection and symmetric difference is presented. The solution is straightforward because the algebraic structure under consideration is a boolean ring. The main part of the algorithm is finding a particular solution which is then substituted into a general formula to yield a single most general unifier. The combination with other equational theories is briefly considered but even for simple cases the extension seems non-trivial.

Original languageEnglish
Title of host publication8th International Conference on Automated Deduction - Proceedings
EditorsJorg H. Siekmann
PublisherSpringer Verlag
Pages506-513
Number of pages8
ISBN (Print)9783540167808
DOIs
StatePublished - 1986
Externally publishedYes
Event8th International Conference on Automated Deduction, 1986 - Oxford, United Kingdom
Duration: 27 Jul 19861 Aug 1986

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume230 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Automated Deduction, 1986
Country/TerritoryUnited Kingdom
CityOxford
Period27/07/861/08/86

Fingerprint

Dive into the research topics of 'Unification in boolean rings'. Together they form a unique fingerprint.

Cite this