Hyperparamodulation: a refinement of paramodulation
A refinement of paramodulation, called hyperparamodulation, is the focus of attention in this paper. Clauses obtained by the use of this inference rule are in effect the result of a sequence of paramodulations into one common nucleus. Among the interesting properties of hyperparamodulation are: first, clauses are chosen from among the input and designated as nuclei or into clauses for paramodulation; second, terms in the nucleus are starred to restrict the domain of generalized equality substitution; third, total control is thus iteratively established over all possible targets for paramodulation during the entire run of the theorem-proving program; and fourth, application of demodulation is suspended until the hyperparamodulation completes. In contrast to these four properties which are reminiscent of the spirit of hyper-resolution, the following differences exist: first, the nucleus and the starred terms therein, which are analogous to negative literals, are determined by the user rather than by syntax; second, rather than restricting the choice of nucleus to mixed clauses, any input clause can be designated as a nucleus; and third, while hyper-resolution requires inferred clauses to be positive, no corresponding requirement exists for clauses inferred by hyperparamodulation.
- Research Organization:
- Argonne National Lab., IL (USA)
- DOE Contract Number:
- W-31-109-ENG-38
- OSTI ID:
- 6417947
- Report Number(s):
- CONF-8007106-1; ON: DE81023533
- Resource Relation:
- Conference: 5. conference on automated deduction, Savoi, France, 8 Jul 1980
- Country of Publication:
- United States
- Language:
- English
Similar Records
OTTER2. Resolution Style Theorem Prover
OTTER2