@mastersthesis{Wischnewski2007,
TITLE = {Contextual Rewriting in {SPASS}},
AUTHOR = {Wischnewski, Patrick},
LANGUAGE = {eng},
LOCALID = {Local-ID: C12573CC004A8E26-4510F08E286235C1C12573D4004FF8F5-Wischnewski2007},
SCHOOL = {Universit{\"a}t des Saarlandes},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2007},
DATE = {2007},
ABSTRACT = {First-order theorem proving with equality is undecidable, in general. However, it is semi-decidable in the sense that it is refutationally complete. The basis for a (semi)-decision procedure for first-order clauses with equality is a calculus composed of inference and reduction rules. The inference rules of the calculus generate new clauses whereas the reduction rules delete clauses or transform them into simpler ones. If, in particular, strong reduction rules are available, decidability of certain subclasses of first-order logic can be shown. Hence, sophisticated reductions are essential for progress in automated theorem proving. In this thesis we consider the superposition calculus and in particular the sophisticated reduction rule Contextual Rewriting. However, it is in general undecidable whether contextual rewriting can be applied. Therefore, to make the rule applicable in practice, it has to be further refined. In this work we develop an instance of contextual rewriting which effectively performs contextual rewriting and we implement this in the theorem prover Spass.},
}