Abstract
QuodLibet is a tactic-based inductive theorem proving system that meets today’s standard requirements for theorem provers such as a command interpreter, a sophisticated graphical user interface, and a carefully programmed inference machine kernel that guarantees soundness. In essence, it is the synergetic combination of the features presented in the following sections that makes QuodLibet a system quite useful in practice; and we hope that it is actuallyas you like it, which is the Latin “quod libet” translated into English. We start by presenting some of the design goals that have guided the development of QuodLibet. Note that the system is not intended to pursue the push bottom technology for inductive theorem proving, but to manage more complicated proofs by an effective interplay between interaction and automation.
This is a preview of subscription content, log in via an institution to check access.
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
Bachmair, L.: Proof By Consistency in Equational Theories. In: 3rd IEEE symposium on Logic In Computer Sci., pp. 228–233. IEEE Press, Los Alamitos (1988)
Boyer, R.S., Strother Moore, J.: A Computational Logic Handbook. Academic Press, London (1988)
Kapur, D., Musser, D.R., Nie, X.: An Overview of the Tecton Proof System. Theoretical Computer Sci. 133, 307–339 (1994)
Kühler, U.: A Tactic-Based Inductive Theorem Prover for Data Types with Partial Operations. Ph.D. thesis, Infix, Sankt Augustin (2000)
Kühler, U., Wirth, C.-P.: Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 38–52. Springer, Heidelberg (1997)
Protzen, M.: Lazy Generation of Induction Hypotheses. In: Bundy, A. (ed.) CADE 1994. LNCS (LNAI), vol. 814, pp. 42–56. Springer, Heidelberg (1994)
Walther, C.: Mathematical Induction. In: Gabbay, D.M., Hogger, C.J., Alan Robinson, J. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 2, pp. 127–228, 1993. Clarendon Press, Oxford (1994)
Wirth, C.-P.: Descente Infinie + Deduction. Report 737/2000, FB Informatik, Univ. Dortmund. Extd. version, November 17 (December 02, 2002), http://ags.uni-sb.de/~cp/p/tab99/new.html
Wirth, C.-P., Gramlich, B.: A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications. J. Symbolic Computation 17, 51–90 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avenhaus, J., Kühler, U., Schmidt-Samoa, T., Wirth, CP. (2003). How to Prove Inductive Theorems? QuodLibet!. In: Baader, F. (eds) Automated Deduction – CADE-19. CADE 2003. Lecture Notes in Computer Science(), vol 2741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45085-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-45085-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40559-7
Online ISBN: 978-3-540-45085-6
eBook Packages: Springer Book Archive