Unification in Boolean rings

Ursula Martin, Tobias Nipkow

Research output: Contribution to journalArticlepeer-review

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.
Original languageEnglish
Pages (from-to)381-396
Number of pages16
JournalJournal of Automated Reasoning
Volume4
Issue number4
DOIs
Publication statusPublished - 1 Dec 1988

Fingerprint

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

Cite this