Rippling: A heuristic for guiding inductive proofs

Artificial Intelligence 62 (2):185-253 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,060

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2020-12-22

Downloads
13 (#1,401,552)

6 months
4 (#978,602)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Induction and Skolemization in saturation theorem proving.Stefan Hetzl & Jannik Vierling - 2023 - Annals of Pure and Applied Logic 174 (1):103167.
Proving theorems by reuse.Christoph Walther & Thomas Kolbe - 2000 - Artificial Intelligence 116 (1-2):17-66.
Supporting the formal verification of mathematical texts.Claus Zinn - 2006 - Journal of Applied Logic 4 (4):592-621.

Add more citations