MPI-I-2009-RG1-002. April 2009, 28 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
Sophisticated reductions are of particular importance for progress in
theorem proving. We consider the powerful reduction rule Contextual
in connection with the superposition calculus.
If considered in its most general form the applicability of contextual
not decidable. We develop an instance of contextual rewriting where
becomes decidable while preserving a great deal of its simplification power.
A sophisticated implementation of the rule in SPASS reveals its
Our contextual rewriting instance is feasible in the sense that it can
be executed on
the overall TPTP resulting in a gain of solved problems and new
solutions to a
number of problems that could not be solved by theorem provers so far.
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|