Saturation-based Theorem Proving: Past Successes and Future Potential

Ganzinger, Harald

doi:10.1007/3-540-61511-3_64

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Saturation-based Theorem Proving: Past Successes and Future Potential

MPS-Authors

/persons/resource/persons44474

Ganzinger, Harald
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dwBMb
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Ganzinger, H. (1996). Saturation-based Theorem Proving: Past Successes and Future Potential. In M. A. McRobbie, & J. K. Slaney (Eds.), Automated Deduction - Cade-13 (pp. 1-1). Berlin: Springer.

Cite as: https://hdl.handle.net/21.11116/0000-000E-4420-1

Abstract

There is no abstract available