Corpus ID: 116807073

Simultaneous Rigid E-Unification is not so Simple

@inproceedings{Degtyarev1995SimultaneousRE,
  title={Simultaneous Rigid E-Unification is not so Simple},
  author={A. Degtyarev and Yuri V. Matiyasevich},
  year={1995}
}
Simultaneous rigid E-uni cation has been introduced in the area of theorem proving with equality. It is used in extension procedures, like the tableau method or the connection method. Many articles in this area tacitly assume the existence of an algorithm for simultaneous rigid E-uni cation. There were several faulty proofs of the decidability of this problem. In this article we prove several results about the simultaneous rigid E-uni cation. Two results are reductions of known problems to… Expand
11 Citations
Uniform representation of recursively enumerable sets with simultaneous rigid E-unification
  • 14
E-uniication with One Variable
  • Yuri GurevichyComputing
  • 1997
The Decidability of Simultaneous Rigid E-Unification with One Variable
  • 20
  • PDF
Herbrand's Theorem and Equational Reasoning: Problems and Solutions
  • 21
  • PDF
Simultaneous Rigid E-unification and other Decision Problems Related to the Herbrand Theorem
  • A. Voronkov
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1999
  • 10
  • PDF
On the Complexity of Linear Arithmetic with Divisibility
  • 16
  • PDF
On Simultaneous Rigid E-Unification
  • 20
  • Highly Influenced
  • PDF
Some Undecidable Problems Related to the Herbrand Theorem
  • UppsalaUSA Swedengurevich
  • 1997
  • 6
  • PDF
...
1
2
...

References

SHOWING 1-2 OF 2 REFERENCES
Type inference and semi-unification
  • 54
  • PDF
Automated Theorem Proving
  • W. Bibel
  • Engineering, Computer Science
  • Artificial Intelligence / Künstliche Intelligenz
  • 1987
  • 414
  • Highly Influential