Skip to main content
SpringerLink
Log in

Higher Order Rippling in IsaPlanner

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3223))

Included in the following conference series:

Abstract

We present an account of rippling with proof critics suitable for use in higher order logic in Isabelle/IsaPlanner. We treat issues not previously examined, in particular regarding the existence of multiple annotations during rippling. This results in an efficient mechanism for rippling that can conjecture and prove needed lemmas automatically as well as present the resulting proof plans as Isar style proof scripts.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Basin, D., Walsh, T.: A calculus for and termination of rippling. JAR 16(1-2), 147–180 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Boulton, R., Slind, K., Bundy, A., Gordon, M.: An interface between CLAM and HOL. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol. 1479, pp. 87–104. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Boyer, R.S., Moore, J.S.: A Computational Logic Handbook. Perspectives in Computing 23, Academic Press Inc. (1988)

    Google Scholar 

  4. Bundy, A.: Proof planning. In: Drabble, B. (ed.) AIPS 1996, pp. 261–267 (1996)

    Google Scholar 

  5. Bundy, A., Stevens, A., van Harmelen, F., Ireland, A., Smaill, A.: Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence 62, 185–253 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cantu, F., Bundy, A., Smaill, A., Basin, D.: Experiments in automating hardware verification using inductive proof planning. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 94–108. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  7. Charniak, E., Riesbeck, C., McDermott, D., Meehan, J.: Artificial Intelligence Programming. Lawrence Erlbaum Associates, Mahwah (1980)

    MATH  Google Scholar 

  8. Dennis, L.A., Smaill, A.: Ordinal arithmetic: A case study for rippling in a higher order domain. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, pp. 185–200. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Dixon, L., Fleuriot, J.D.: IsaPlanner: A prototype proof planner in Isabelle. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 279–283. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Hutter, D.: Annotated reasoning. Annals of Mathematics and Artificial Intelligence 29(l-4), 183–222 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hutter, D., Kohlhase, M.: A colored version of the lambda-calculus. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 291–305. Springer, Heidelberg (1997)

    Google Scholar 

  12. Ireland, A., Bundy, A.: Productive use of failure in inductive proof. Journal of Automated Reasoning 16(l-2), 79–lll (1996)

    Google Scholar 

  13. Lacey, D., Richardson, J.D.C., Smaill, A.: Logic program synthesis in a higher order setting. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 87–100. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Maclean, E., Fleuriot, J., Smaill, A.: Proof-planning non-standard analysis. In: The 7th International Symposium, on AI and Mathematics (2002)

    Google Scholar 

  15. Paulson, L.C.: Isabelle: A generic theorem prover. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  16. Pientka, B., Kreitz, C.: Automating inductive specification proofs in NuPRL. Fundamenta Mathematicae 34, 1–20 (1998)

    Google Scholar 

  17. Richardson, J., Bundy, A.: Proof planning methods as schemas. Symbolic Computation 11, 1-000 (1999)

    Google Scholar 

  18. Slind, K.: Derivation and use of induction schemes in higher-order logic. In: Gunter, E.L., Felty, A.P. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 275–290. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  19. Smaill, A., Green, I.: Higher-order annotated terms for proof search. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 399–413. Springer, Heidelberg (1996)

    Google Scholar 

  20. Wenzel, M.: Isar - a generic interpretative approach to readable formal proof documents. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 167–184. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics, University of Edinburgh, Appleton Tower, Crighton Street, Edinburgh, EH8 9LE, UK

    Lucas Dixon & Jacques Fleuriot

Authors
  1. Lucas Dixon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Fleuriot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, University of Utah,  

    Konrad Slind

  2. Electrical and Computer Engineering Department, Utah State University, 4120 Old Main Hill, 84341, Logan, UT, USA

    Annette Bunker

  3. School of Computing, Univ. of Utah, 84112, Salt Lake City, UT, USA

    Ganesh Gopalakrishnan

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dixon, L., Fleuriot, J. (2004). Higher Order Rippling in IsaPlanner . In: Slind, K., Bunker, A., Gopalakrishnan, G. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2004. Lecture Notes in Computer Science, vol 3223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30142-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30142-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23017-5

  • Online ISBN: 978-3-540-30142-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation