What is the inverse method? (Q908895): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00245018 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2055466270 / rank | |||
Normal rank |
Latest revision as of 10:00, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | What is the inverse method? |
scientific article |
Statements
What is the inverse method? (English)
0 references
1989
0 references
The inverse method is a method of theorem proving in predicate calculus, invented by S. Maslov in 1964. It uses a special normal form of the formula, unification and search for contradiction much like the resolution method. The derivable objects, superclauses, are disjunctions of conjunctions. There are two derivation rules, A) generating tautologies from unifiable parts of the formula, and B), close to clash- resolution: \[ \frac{A_ 1\vee D_ 1,...,A_ n\vee D_ n}{sD_ 1\vee...\vee sD_ n}s\quad =\quad MGU(A_ 1,...,A_ n). \] The difference between the presented view of the inverse method and the traditional view is explained. The difference would, however, be substantial, if ordinary clause form, not the form with superclauses were used. The inverse method is also treated in a paper by \textit{N. K. Zamov} [Ann. Pure Appl. Logic 42, No.2, 165-194 (1989; Zbl 0692.03009)].
0 references
inverse method
0 references
theorem proving in predicate calculus
0 references
resolution
0 references
superclauses
0 references