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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

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

Through your library

Similar books and articles

The Synthesis of Logic Programs From Inductive Proofs.Alan Bundy, Smaill & Geraint A. Wiggins - 1990 - Department of Artificial Intelligence, University of Edinburgh.
Using Failure to Guide Inductive Proof.Andrew Ireland & Alan Bundy - 1992 - Department of Artificial Intelligence, University of Edinburgh.
What inductive explanations could not be.John Dougherty - 2018 - Synthese 195 (12):5473-5483.
Non-Formal Properties of Real Mathematical Proofs.Jean Paul van Bendegem - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:249-254.
Probabilistic Proofs and the Collective Epistemic Goals of Mathematicians.Don Fallis - 2011 - In Hans Bernhard Schmid, Daniel Sirtes & Marcel Weber (eds.), Collective Epistemology. Heusenstamm, Germany: Ontos. pp. 157-175.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,389,208)

6 months
3 (#980,137)

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.
Supporting the formal verification of mathematical texts.Claus Zinn - 2006 - Journal of Applied Logic 4 (4):592-621.
Proving theorems by reuse.Christoph Walther & Thomas Kolbe - 2000 - Artificial Intelligence 116 (1-2):17-66.

Add more citations