UNIFICATION IN FREE DISTRIBUTIVE LATTICES

Authors
GERHARD JA PETRICH M
Citation
Ja. Gerhard et M. Petrich, UNIFICATION IN FREE DISTRIBUTIVE LATTICES, Theoretical computer science, 126(2), 1994, pp. 237-257
Citations number
5
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
126
Issue
2
Year of publication
1994
Pages
237 - 257
Database
ISI
SICI code
0304-3975(1994)126:2<237:UIFDL>2.0.ZU;2-R
Abstract
For a pair of words in any free distributive lattice, a procedure is g iven which decides whether they can be unified. Bases for all unifiers are found in the case where the two words to be unified are AND-words (or by duality OR-words). The cases where the total number of generat ors is at most three are discussed in detail. This includes all the po ssible combinations of constants and variables. Bases for the unifiers are given in all these cases.