On the Complexity of Boolean Unification

Franz BaaderFranz Baader

Franz Baader
On the Complexity of Boolean Unification
Information Processing Letters, 67(4):215-220, 1998

Details
Bibtex

KurzfassungAbstract
Unification modulo the theory of Boolean algebras has been investigated by several autors. Nevertheless, the exact complexity of the decision problem for unification with constants and general unification was not known. In this research note, we show that the decision problem is $Pi^p_2$-complete for unification with constants and PSPACE-complete for general unification. In contrast, the decision problem for elementary unification (where the terms to be unified contain only symbols of the signature of Boolean algebras) is ``only NP-complete.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@article{ Baader-IPL-98,
  author = {F. {Baader}},
  journal = {Information Processing Letters},
  number = {4},
  pages = {215--220},
  title = {On the Complexity of {B}oolean Unification},
  volume = {67},
  year = {1998},
}