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.
|Title of host publication||Unknown Host Publication Title|
|Number of pages||7|
|State||Published - 1987|