Special Cases and Substitutes for Rigid E-Unification

@article{Plaisted2000SpecialCA,
  title={Special Cases and Substitutes for Rigid E-Unification},
  author={David A. Plaisted},
  journal={Applicable Algebra in Engineering, Communication and Computing},
  year={2000},
  volume={10},
  pages={97-152}
}
The simultaneous rigid E-unification problem arises naturally in theorem proving with equality. This problem has recently been shown to be undecidable. This raises the question whether simultaneous rigid E-unification can usefully be applied to equality theorem proving. We give some evidence in the affirmative, by presenting a number of common special cases in which a decidable version of this problem suffices for theorem proving with equality. We also present some general decidable methods of… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
12 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

To appear in Proc

  • Science Department, June
  • CSL’95
  • 1995

RigidE-unifiability is DEXPTIME-complete

  • J. Goubault
  • Proceedings of the 9th Annual IEEE Symposium on…
  • 1994

Andrews: Theorem proving via general matings

  • P B.
  • J. Associ. Comput. Machinery
  • 1981

Similar Papers

Loading similar papers…