Unification in Primal Algebras

@inproceedings{Nipkow1988UnificationIP,
  title={Unification in Primal Algebras},
  author={Tobias Nipkow},
  booktitle={CAAP},
  year={1988}
}
Unification in primal algebras is shown to be unitary. Three different unification algorithms are investigated. The simplest one consists of computing all solutions and coding them up in a single vector of terms. The other two methods are generalizations of unification algorithms for Boolean algebras. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS

Equations in the algebra of logic

  • Proceedings 32nd IEEE International Symposium on Multiple-Valued Logic
  • 2002
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Lattice Functions and Equations

  • Discrete Mathematics and Theoretical Computer Science
  • 2001

ON EQUATIONS IN BOUNDED LATTICES

VIEW 2 EXCERPTS
CITES BACKGROUND

Boolean Unification - The Story So Far

  • J. Symb. Comput.
  • 1989
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES