Skip to main content
SpringerLink
Log in

E-unification with Constants vs. General E-unification

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

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 E 1 and E 2 over disjoint signatures, such that E 1-unification with constants and E 2-unification with constants are decidable, but (E 1 ∪ E 2)-unification with constants is undecidable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baader, F., Büttner, W.: Unification in commutative idempotent monoids. Theor. Comput. Sci. 56, 345–353 (1988)

    Article  MATH  Google Scholar 

  2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1999)

  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. Baader, F., Schulz, K.U.: Unification in the union of disjoint equational theories: combining decision procedures. J. Symbol. Comput. 21, 211–243 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) A Chapter in Handbook of Automated Reasoning. Elsevier/MIT Press (2001)

  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)

  7. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley (2001)

  8. Kapur, D., Narendran, P.: Double-exponential complexity of computing a complete set of AC-unifiers. In: LICS, Santa Cruz, CA (1992)

  9. Narendran, P., Otto, F.: Single versus simultaneous equational unification and equational unification for variable-permuting theories. J. Autom. Reason. 19, 87–115 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. J. ACM 27(2), 356–364 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  11. The RTA List of Open Problems: http://rtaloop.pps.jussieu.fr/. Accessed 15 September 2008

  12. Schmidt-Schauss, M.: Unification in a combination of arbitrary disjoint equational theories. J. Symbol. Comput. 8(1/2), 51–99 (1989)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, ul. Joliot-Curie 15, 50-383, Wrocław, Poland

    Jan Otop

Authors
  1. Jan Otop
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jan Otop.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Otop, J. E-unification with Constants vs. General E-unification. J Autom Reasoning 48, 363–390 (2012). https://doi.org/10.1007/s10817-010-9201-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-010-9201-2

Keywords

Search

Navigation