Generic induction proofs
We summarize a number of new results concerning inductive-theorem proving in the area of design specifications using Horn logic with equality. Induction is explicit here because induction orderings must be integrated into the specification. However, the proofs need less guidance if the specification is ground confluent and strongly terminating. Calculi for verifying these conditions are presented along with a list of useful applications.
KeywordsInference Rule Horn Clause Proof Obligation Ground Term Logical Atom
Unable to display preview. Download preview PDF.
- [DJ 90]N. Dershowitz, J.-P. Jouannaud, Rewrite Systems, in: J. van Leeuwen, Handbook of Theoretical Computer Science, Elsevier (1990) 243–320Google Scholar
- [Duf 91]D. Duffy, Principles of Automated Theorem Proving, John Wiley & Sons 1991Google Scholar
- [EM 85]H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1, Springer 1985Google Scholar
- [Pad 88]P. Padawitz, Computing in Horn Clause Theories, Springer 1988Google Scholar
- [Pad 91]P. Padawitz, Inductive Expansion: A Calculus for Verifying and Synthesizing Functional and Logic programs, Journal of Automated Reasoning 7 (1991) 27–103Google Scholar
- [Pad 91a]P. Padawitz, Reduction and Narrowing for Horn Clause Theories, The Computer Journal 34 (1991) 42–51Google Scholar
- [Pad 92]P. Padawitz, Deduction and Declarative Programming, Cambridge University Press 1992Google Scholar
- [Pad 92a]P. Padawitz, EXPANDER: User's Manual, Universität Dortmund 1992Google Scholar
- [Wir 90]M. Wirsing, Algebraic Specification, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier (1990) 675–788Google Scholar