Abstract / Description of output
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 language | English |
|---|---|
| Pages (from-to) | 381-396 |
| Number of pages | 16 |
| Journal | Journal of Automated Reasoning |
| Volume | 4 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Dec 1988 |