Abstract
We discuss the benefits of complete unsound inference procedures for efficient methods of disproof. We give a framework for converting a sound and complete saturation-based inference procedure into successive unsound and complete procedures, that serve as successive approximations to the theory. The idea is to successively add new statements in such a way that the inference procedure will halt. Then the satisfiability is evaluated over a stronger theory. This gives an over-approximation to the given theory. We show how to successively compute better over-approximations. Similarly, a sound an incomplete theorem prover will give an under-approximation. In our framework, we succesively compute better over and under-approximations in this way.
We illustrate this framework with Knuth-Bendix Completion, and show that in some theories this method becomes a decision procedure. Then we illustrate the framework with a new method for the (nonground) word problem, based on Congruence Closure. We show a class where this becomes a decision procedure. Also, we show that this new inference system is interesting in its own right. Given a particular goal, in many cases we can halt the procedure at some point and say that all the equations for solving the goal have been generated already. This is generally not possible in Knuth-Bendix Completion.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Autexier, S., Schurmann, C.: Disproving false conjectures. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 33–48. Springer, Heidelberg (2003)
Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 2, vol. I, pp. 19–99. Elsevier Science, Amsterdam (2001)
Bachmair, L., Dershowitz, N., Plaisted, D.: Completion without Failure, vol. II. Academic Press, London (1989)
Bachmair, L., Tiwari, A.: Abstract congruence closure and specializations. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 64–78. Springer, Heidelberg (2000)
Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: IEEE Symposium on Logic in Computer Science, Ottawa, Ont, pp. 55–64 (June 2003)
Kapur, D.: Shostaks congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 23–37. Springer, Heidelberg (1997)
Lynch, C., Morawska, B.: Approximating e-unification. In: 15th Annual Workshop on Unification Theory, Siena, Italy (2001)
McCune, W.: Solution of the robbins problem. Journal of Automated Reasoning 19(3), 263–276 (1997)
Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 7, vol. I, pp. 371–443. Elsevier Science, Amsterdam (2001)
Nieuwenhuis, R.: Complexity analysis by basic paramodulation. Information and Computation 147, 1–21 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lynch, C. (2004). Unsound Theorem Proving. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-30124-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23024-3
Online ISBN: 978-3-540-30124-0
eBook Packages: Springer Book Archive