The term rewriting approach to automated theorem proving (Q4015952)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 70121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The term rewriting approach to automated theorem proving |
scientific article; zbMATH DE number 70121 |
Statements
The term rewriting approach to automated theorem proving (English)
0 references
10 November 1992
0 references
equational logic
0 references
termination
0 references
completion
0 references
inductive theorems
0 references
equational rewriting
0 references
equational unification
0 references
Horn clause logic with equality
0 references
conditional rewriting
0 references
refutation
0 references
first order logic with equality
0 references
paramodulation
0 references
Boolean ring
0 references
