What You Always Wanted to Know about Rigid E-Unification

@article{Degtyarev1998WhatYA,
  title={What You Always Wanted to Know about Rigid E-Unification},
  author={Anatoli Degtyarev and Andrei Voronkov},
  journal={Journal of Automated Reasoning},
  year={1998},
  volume={20},
  pages={47-80}
}
This paper solves an open problem posed by a number of researchers: the construction of a complete calculus for matrix-based methods with rigid E-unification. The use of rigid E-unification and simultaneous rigid E-unification for such methods was proposed by Gallier et al., in 1987. After our proof of the undecidability of simultaneous rigid E-unification in 1995. (Degtyarev and Voronkov, 1996d), it became clear that one should look for more refined techniques to deal with equality in matrix… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 60 references

Special Cases and Substitutes for Rigid E-Unification

Applicable Algebra in Engineering, Communication and Computing • 2000
View 9 Excerpts
Highly Influenced

First-Order Logic and Automated Theorem Proving

Graduate Texts in Computer Science • 1996
View 8 Excerpts
Highly Influenced

A Complete Connection Calculus with Rigid E-Unification

JELIA • 1994
View 7 Excerpts
Highly Influenced

Equality elimination for semantic tableaux, UPMAIL

A. Degtyarev, A. Voronkov
Technical Report 90, • 1994
View 10 Excerpts
Highly Influenced

Rigid E-Unifiability is DEXPTIME-Complete

View 4 Excerpts
Highly Influenced

Equality reasoning and sequent-based methods

A. Degtyarev, A. Voronkov
Handbook of Automated Reasoning, Elsevier Science, • 1998

Similar Papers

Loading similar papers…