MPI-I-97-2-012. December 1997, 18 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
We refine Brand's method for eliminating equality axioms by
imposingeordering constraints on
auxiliary variables introduced during the transformation process
avoiding certain transformations of
positive equations with a variable on the right-hand side.
The refinements are both of theoretical and practical interest.
the second refinement is implemented in Setheo
and appears to be critical for that prover's
performance on equational problems.
The correctness of this variant of Brand's method was an open problem
that is solved by the more general results in the present paper.
The experimental results we obtained from a
prototype implementation of our proposed method for the model elimination prover
Protein also show some dramatic improvements of the proof search.
Ordering constraints have already been widely used in
equational theorem provers based on paramodulation.
We prove the correctness of our refinements
of Brand's method by establishing a suitable connection
to basic paramodulation calculi and
thereby shed new light on the connection
between different approaches to equational theorem proving.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|