Abstract
Saturation means to compute the closure of a given set of formulas under a given set of inference rules. Resolution, Knuth/Bendix completion, and Superposition are major examples of saturation-based, automated theorem proving methods. More recently, considerable progress has made in this area. New theoretical insight has been gained. In particular the nature of redundancy and of mechanisms for avoiding redundancy is now better understood. This has many applications, both in theory and in practice. New provers based on these ideas are emerging and seem to perform well, outperforming existing automated provers in many respects. The talk surveys some of the theoretical results, describes experience gained from experimentation, and outlines problems and potential for future research.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganzinger, H. (1996). Saturation-based theorem proving: Past successes and future potential. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_64
Download citation
DOI: https://doi.org/10.1007/3-540-61511-3_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61511-8
Online ISBN: 978-3-540-68687-3
eBook Packages: Springer Book Archive