Journal of Automated Reasoning

, Volume 48, Issue 3, pp 363–390 | Cite as

E-unification with Constants vs. General E-unification

Article

Abstract

We present a solution to Problem #66 from the RTA open problem list. The question is whether there exists an equational theory E such that E-unification with constants is decidable but general E-unification is undecidable. The answer is positive and we show such a theory. The problem has several equivalent formulations, therefore the solution has many consequences. Our result also shows, that there exist two theories E1 and E2 over disjoint signatures, such that E1-unification with constants and E2-unification with constants are decidable, but (E1 ∪ E2)-unification with constants is undecidable.

Keywords

E-unification with constants General E-unification Combination problem 

References

  1. 1.
    Baader, F., Büttner, W.: Unification in commutative idempotent monoids. Theor. Comput. Sci. 56, 345–353 (1988)MATHCrossRefGoogle Scholar
  2. 2.
    Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1999)Google Scholar
  3. 3.
    Baader, F., Schulz, K.: Unification in the union of disjoint equational theories: combining decision procedures. In: 11th CADE. LNCS, vol. 607. Springer, Saratoga Springs, NY (1992)Google Scholar
  4. 4.
    Baader, F., Schulz, K.U.: Unification in the union of disjoint equational theories: combining decision procedures. J. Symbol. Comput. 21, 211–243 (1996)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) A Chapter in Handbook of Automated Reasoning. Elsevier/MIT Press (2001)Google Scholar
  6. 6.
    Bürckert H.-J., Herold A., Schmidt-Schauss, M.: On equational theories, unification and decidability. In: Proc. of the 2nd RTA. LNCS, vol. 256, pp. 204-215. Springer-Verlag (1987)Google Scholar
  7. 7.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley (2001)Google Scholar
  8. 8.
    Kapur, D., Narendran, P.: Double-exponential complexity of computing a complete set of AC-unifiers. In: LICS, Santa Cruz, CA (1992)Google Scholar
  9. 9.
    Narendran, P., Otto, F.: Single versus simultaneous equational unification and equational unification for variable-permuting theories. J. Autom. Reason. 19, 87–115 (1997)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. J. ACM 27(2), 356–364 (1980)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    The RTA List of Open Problems: http://rtaloop.pps.jussieu.fr/. Accessed 15 September 2008
  12. 12.
    Schmidt-Schauss, M.: Unification in a combination of arbitrary disjoint equational theories. J. Symbol. Comput. 8(1/2), 51–99 (1989)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  1. 1.Institute of Computer ScienceUniversity of WrocławWrocławPoland

Personalised recommendations