E-unification with Constants vs. General E-unification
- 94 Downloads
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.
KeywordsE-unification with constants General E-unification Combination problem
Unable to display preview. Download preview PDF.
- 2.Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1999)Google Scholar
- 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
- 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.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.Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley (2001)Google Scholar
- 8.Kapur, D., Narendran, P.: Double-exponential complexity of computing a complete set of AC-unifiers. In: LICS, Santa Cruz, CA (1992)Google Scholar
- 11.The RTA List of Open Problems: http://rtaloop.pps.jussieu.fr/. Accessed 15 September 2008