Abstract
The authors present a complete inference system for first-order theorem proving that is based on a canonical system for Boolean algebra. They also present a technique for proving the completeness of rewrite-based proof methods.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 331-337 |
| Number of pages | 7 |
| ISBN (Print) | 0818607939 |
| State | Published - 1987 |
| Externally published | Yes |