A Framework of Refutational Theorem Proving for Saturation−Based Decision Procedures
Automated state-of-the-art theorem provers are typically optimised for particular strategies, and there are only limited number of options that can be set by the user. Probably because of this, the general conditions on applicability of saturation-based calculi have not been thoroughly investigated....
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Record |
| Publicerad: |
Max−Planck−Institut für Informatik
2005
|