论文信息 - S I S Randomization and Heavy-tailed Behavior in Proof Planning - 字舞流文

S I S Randomization and Heavy-tailed Behavior in Proof Planning

Erica Melis | Andreas Meier | A. Meier | E. Melis

[1] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[2] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.

[3] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

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

[5] Amy P. Felty,et al. The Coq proof assistant user's guide : version 5.6 , 1990 .

[6] Alan Bundy,et al. Middle-Out Reasoning for Logic Program Synthesis , 1993, ICLP.

[7] Wolfgang Ertel,et al. Optimal parallelization of Las Vegas algorithms , 1993, Forschungsberichte, TU Munich.

[8] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .

[9] David A. Redfern,et al. The Maple Handbook: Maple V Release 3 , 1995 .

[10] Volker Sorge,et al. ΩMEGA : Towards a mathematical assistant , 1997 .

[11] Bart Selman,et al. Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[12] Erica Melis. The "Limit" Domain , 1998, AIPS.

[13] Bart Selman,et al. Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems , 1998, AIPS.

[14] Erica Melis,et al. Knowledge-Based Proof Planning , 1999, Artif. Intell..

[15] Erica Melis,et al. Proof planning with multiple strategies , 2000, Artif. Intell..

[16] A. Meier,et al. Exploring properties of residue classes , 2001 .