|
|||||
|
|
The relative complexity of analytic tableaux and SL-resolution |
|
| Authors: | André Vellino |
| Institution: | (1) Computing Research Laboratory, Bell-Northern Research, Station C, P.O. Box 3511, K1Y 4H7 Ottawa, Ontario, CANADA |
| Abstract: | In this paper we describe an improvement of Smullyan's analytic tableau method for the propositional calculus-Improved Parent Clash Restricted (IPCR) tableau-and show that it is equivalent to SL-resolution in complexity. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |