Feature-Based Learning of Search-Guiding Heuristics for Theorem Proving

Automated reasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have many shortcomings. The use of machinedlearning techniques is acknowledged as promising, but difficult to apply in the area of theorem proving. We propose here to learn searchdguiding heuristics by employing features in a simple, yet effective manner. Features are used to adapt a heuristic to a solved source problem. The adapted heuristic can then be utilized profitably for solving related target problems. Experiments have demonstrated that the approach allows a theorem prover to prove hard problems that were out of reach before.

[1]  Matthias Fuchs,et al.  High Performance ATP Systems by Combining Several AI Methods , 1997, IJCAI.

[2]  Thomas Kolbe Patching proofs for reuse , 1995 .

[3]  Erica Melis,et al.  A Model of Analogy-Driven Proof-Plan Construction , 1995, IJCAI.

[4]  Matthias Fuchs Learning search heuristics for automated deduction , 1997 .

[5]  Bishop Brock,et al.  Analogical Reasoning and Proof Discovery , 1988, CADE.

[6]  Matthias Fuchs,et al.  DISCOUNT: A SYstem for Distributed Equational Deduction , 1995, RTA.

[7]  Matthias Fuchs Automatic Selection of Search-guiding Heuristics for Theorem Proving , 1998 .

[8]  Thomas Ellman,et al.  Explanation-based learning: a survey of programs and perspectives , 1989, CSUR.

[9]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.

[10]  Jörg Denzinger,et al.  Learning Domain Knowledge to Improve Theorem Proving , 1996, CADE.

[11]  Wolfgang Ertel,et al.  Automatic Acquisition of Search Guiding Heuristics , 1990, CADE.

[12]  Tony R. Martinez,et al.  Instance-Based Learning with Genetically Derived Attribute Weights , 1996 .

[13]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[14]  Christoph Weidenbach,et al.  SPASS & FLOTTER Version 0.42 , 1996, CADE.

[15]  Jihoon Yang,et al.  Feature Subset Selection Using a Genetic Algorithm , 1998, IEEE Intell. Syst..

[16]  Thomas Kolbe,et al.  Patching Proofs for Reuse (Extended Abstract) , 1995, ECML.

[17]  Matthias Fuchs,et al.  Applying Case-Based Reasoning to Automated Deduction , 1997, ICCBR.

[18]  Matthias Fuchs A Feature-Based Learning Method for Theorem Proving , 1998, AAAI/IAAI.

[19]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[20]  Marc Fuchs,et al.  Flexible Proof-Replay with Heuristics , 1997, EPIA.

[21]  Larry Wos The resonance strategy , 1995 .

[22]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, CADE.

[23]  Matthias Fuchs Flexible Re-enactment of Proofs , 1997, EPIA.

[24]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[25]  Alan Bundy,et al.  The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.

[26]  Thomas Hillenbrand,et al.  On Gaining Efficiency in Completion-Based Theorem Proving , 1996, RTA.

[27]  Thomas Kolbe,et al.  Reusing Proofs , 1994, ECAI.

[28]  Matthias Fuchs,et al.  Experiments in the Heuristic Use of Past Proof Experience , 1996, CADE.