References in zbMATH (referenced in 18 articles )

Showing results 1 to 18 of 18.
Sorted by year (citations)

  1. Cruanes, Simon: Superposition with structural induction (2017)
  2. Aoto, Takahito: Sound lemma generation for proving inductive validity of equations (2008)
  3. Autexier, Serge; Benzmüller, Christoph; Dietrich, Dominik; Meier, Andreas; Wirth, Claus-Peter: A generic modular data structure for proof attempts alternating on ideas and granularity (2006)
  4. Walther, Christoph; Schweitzer, Stephan: Reasoning about incompletely defined programs (2005)
  5. Kohlhase, Michael; Franke, Andreas: MBase: Representing knowledge and context for the integration of mathematical software systems (2001)
  6. Walther, Christoph; Kolbe, Thomas: On terminating lemma speculations. (2000)
  7. Walther, C.; Kolbe, T.: Proving theorems by reuse (2000)
  8. Ahrendt, Wolfgang; Beckert, Bernhard; Hähnle, Reiner; Menzel, Wolfram; Reif, Wolfgang; Schellhorn, Gerhard; Schmitt, Peter H.: Integrating automated and interactive theorem proving (1998)
  9. Kolbe, Thomas; Brauburger, Jürgen: \textscPlagiator-- a learning prover (1997)
  10. Basin, David A.; Walsh, Toby: A calculus for and termination of rippling (1996)
  11. Bronsard, Francois; Reddy, Uday S.; Hasker, Robert W.: Induction using term orders (1996)
  12. Hutter, Dieter; Sengler, Claus: INKA: the next generation (1996)
  13. Kraan, Ina; Basin, David; Bundy, Alan: Middle-out reasoning for synthesis and induction (1996)
  14. Sengler, Claus: Termination of algorithms over non-freely generated data types (1996)
  15. Bronsard, Francois; Reddy, Uday S.; Hasker, Robert W.: Induction using term orderings (1994)
  16. Hutter, Dieter: Synthesis of induction orderings for existence proofs (1994)
  17. Barnett, Richard; Basin, David; Hesketh, Jane: A recursion planning analysis of inductive completion (1993)
  18. Protzen, Martin: Disproving conjectures (1992)