On the Complexity of Boolean Unification

Franz Baader
On the Complexity of Boolean Unification
Technical Report, LuFg Theoretical Computer Science, RWTH Aachen, Germany, volume LTCS-97-03, 1997. LTCS-Report

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

@techreport{ Baader-LTCS-97-03,
  author = {F. {Baader}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-97-03},
  title = {On the Complexity of Boolean Unification},
  type = {LTCS-Report},
  year = {1997},
}

On the Complexity of Boolean Unification

On the Complexity of Boolean Unification

Franz BaaderFranz Baader