See this document in CiteSeerX!

Extending the Reach of Proof Planning by  (Make Corrections)  
Randomization and Restart Techniques Andreas Meier, Carla P. Gomes, and...



  Home/Search   Context   Related

 
View or download:
cs.bham.ac.uk/pub/...gomesmelis.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.bham.ac.uk/~mmk/events/ijca... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Proof planning provides a powerful theorem proving framework. (Update)


Similar documents (at the sentence level):
72.0%:   Extending the Reach of Proof Planning by Randomization and.. - Meier, Gomes, Melis (2001)   (Correct)
8.7%:   Randomization and Heavy-Tailed Behavior in Proof Planning - Meier (2000)   (Correct)
6.8%:   Randomization and Restarts in Proof Planning - Meier, Gomes, Melis (2001)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Exploring the Domain of Residue Classes - Meier, Pollet, Sorge (2000)   (Correct)
0.2:   Classifying Isomorphic Residue Classes - Meier, Pollet, Sorge (2001)   (Correct)
0.2:   Article Submitted to Journal of Symbolic Computation - Comparing Approaches To (2002)   (Correct)

Similar documents based on text:   More   All
0.6:   Heavy-Tailed Behavior and Randomization in Proof Planning - Meier, Gomes, Melis (2001)   (Correct)
0.3:   Proof Planning with Multiple Strategies - Melis, Meier (1999)   (Correct)
0.3:   Towards Extending Domain Representations - Meier, al. (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ randomization-extending,
  author = "Randomization And Restart",
  title = "Extending the Reach of Proof Planning by",
  url = "citeseer.ist.psu.edu/636138.html" }
Citations (may not include all citations):
891   STRIPS: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971
505   Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable, Allen et al. - 1986
294   Isabelle: a Generic Theorem Prover (context) - Paulson - 1994
226   The Use of Explicit Plans to Guide Inductive Proofs - Bundy - 1988
143   The Coq proof assistant user's guide (context) - Dowek, Felty et al. - 1991
126   Introduction to HOL (context) - Gordon, Melham - 1993
41   Integrating Computer Algebra Into Proof Planning - Kerber, Kohlhase et al. - 1998
38   Knowledge-based proof planning (context) - Melis, Siekmann - 1999
18   mega: Towards a mathematical assistant - Benzm, Cheikhrouhou et al. - 1997
14   Randomization in backtrack search: Exploiting heavy-tailed p.. (context) - Gomes, Selman et al. - 1998
12   OR-Parallel theorem proving with random competition (context) - Ertel - 1992
10   Exploring the domain of residue classes - Meier, Pollet et al. - 2000
9   Non-Trivial Computations in Proof Planning (context) - Sorge - 2000
7   Heavy-tailed phenomena in satis ability and constraint satis.. (context) - Gomes, Selman et al. - 2000
4   available at http://www (context) - Meier, heavy-tailed et al. - 2000

Documents on the same site (http://www.cs.bham.ac.uk/~mmk/events/ijcar01-future/):   More
[] or SUCCESS is Not Enough: Current Technology and Future.. - Schumann, Robinson   (Correct)
Automated Deduction Techniques for the Management of.. - Baumgartner   (Correct)
Automated Theorem Discovery: A Future Direction for Theorem Provers - Colton   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC