Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for equational theories. In this paper we present a new abstract framework for the utilization of completion procedures as semidecision procedures for theorem proving. The key idea in our approach is that a semidecision process should be target-oriented, i.e. keep into account the target theorem to be proved. For the inference rules of a completion procedure, we present target-oriented schemes of contraction inference rules, i.e. inference rules that delete sentences which are redundant for proving the target. For the search plan, we give a target-oriented, definition of fairness, according to which not all critical pairs need to be considered. We prove that our notion of fairness, together with the refutational completeness of the inference rules, is sufficient for a completion procedure to be a semidecision procedure. By relaxing the requirement of considering all critical pairs, our target-oriented framework should be more suitable for designing efficient procedures for theorem proving. The generation of decision procedures is included as a special side-effect and all the results of the classical approach to completion are re-obtained in our framework. The application of completion to disprove inductive conjectures, i.e. the so called inductionless induction method, is also covered as a semidecision process. Finally, we present according to our framework, some equational completion procedures based on Unfailing Knuth-Bendix completion.
In REF , we used it to study refutational completeness of the inference mechanism and fairness of the search plan.
Towards a foundation of completion procedures as semidecision procedures
Theor. Comput. Sci.
Theor. Comput. Sci.
Mathematics Computer Science