Proof planning with multiple strategies
暂无分享,去创建一个
[1] Eugene Fink,et al. Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..
[2] Geoff Sutcliffe,et al. Smart Selective Competition Parallelism ATP , 1999, FLAIRS Conference.
[3] Ian Green,et al. System description : Proof planning in higher-order logic with λ Clam , 1998 .
[4] Tara A. Estlin,et al. An Argument for a Hybrid HTN/Operator-Based Approach to Planning , 1997, ECP.
[5] Erica Melis,et al. A proof presentation suitable for teaching proofs , 1999 .
[6] Richard E. Korf,et al. Planning as Search: A Quantitative Approach , 1987, Artif. Intell..
[7] Alan Bundy,et al. The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.
[8] David Ruby,et al. Learning Subgoal Sequences for Planning , 1989, IJCAI.
[9] Andreas Wolf. Strategy Selection for Automated Theorem Proving , 1998, AIMSA.
[10] Hantao Zhang,et al. SEM: a System for Enumerating Models , 1995, IJCAI.
[11] Erica Melis,et al. A Model of Analogy-Driven Proof-Plan Construction , 1995, IJCAI.
[12] Craig A. Knoblock. Automatically Generating Abstractions for Planning , 1994, Artif. Intell..
[13] Eugene Fink,et al. How to Solve It Automatically: Selection Among Problem Solving Methods , 1998, AIPS.
[14] Erica Melis,et al. Knowledge-Based Proof Planning , 1999, Artif. Intell..
[15] Robert S. Boyer,et al. Computer Proofs of Limit Theorems , 1971, IJCAI.
[16] S. Kambhampati,et al. Universal classical planner: an algorithm for unifying state-space and plan-space planning , 1996 .
[17] Earl D. Sacerdoti,et al. Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.
[18] Barbara Hayes-Roth,et al. A Blackboard Architecture for Control , 1985, Artif. Intell..
[19] David A. Plaisted,et al. Theorem Proving with Abstraction , 1981, Artif. Intell..
[20] E. Melis. Island Planning and Refinement , 1996 .
[21] Edmund H. Durfee,et al. Incremental Planning to Control a Blackboard-based Problem Solver , 1986, AAAI.
[22] Erica Melis,et al. Flexibly Interleaving Processes , 1999, ICCBR.
[23] Oren Etzioni,et al. PRODIGY4.0: The Manual and Tutorial , 1992 .
[24] Dieter Hutter,et al. Equational proof-planning by dynamic abstraction , 1997 .
[25] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.
[26] Volker Sorge,et al. Agent based mathematical reasoning , 1999, Calculemus.
[27] Volker Sorge,et al. Omega: Towards a Mathematical Assistant , 1997, CADE.
[28] Andrew Ireland,et al. The Use of Planning Critics in Mechanizing Inductive Proofs , 1992, LPAR.
[29] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[30] David E. Wilkins,et al. A Multiagent Planning Architecture , 1998, AIPS.
[31] Manuela M. Veloso,et al. The Need for Different Domain-independent Heuristics , 1994, AIPS.
[32] Thomas Hillenbrand,et al. System Description: Waldmeister - Improvements in Performance and Ease of Use , 1999, CADE.
[33] Frank van Harmelen,et al. Rippling: A Heuristic for Guiding Inductive Proofs , 1993, Artif. Intell..
[34] William McCune,et al. OTTER 1.0 Users' Guide , 1990 .
[35] Johann Schumann. SiCoTHEO - Simple competitive parallel theorem provers based on SETHEO , 1997, Parallel Processing for Artificial Intelligence 3.
[36] David E. Wilkins,et al. A Call for Knowledge-Based Planning , 2001, AI Mag..
[37] Subbarao Kambhampati,et al. Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..
[38] A. Meier,et al. Proof Planning with Multiple Strategies II , 1999 .
[39] Stephen Fickas,et al. The Design and an Example Use of Hearsay-III , 1981, IJCAI.
[40] Daniel S. Weld. An Introduction to Least Commitment Planning , 1994, AI Mag..
[41] David Kelley. A theory of abstraction. , 1984 .
[42] Jörg Denzinger,et al. Cooperation of Heterogeneous Provers , 1999, IJCAI.
[43] Adele E. Howe,et al. Exploiting Competitive Planner Performance , 1999, ECP.
[44] Simon Colton,et al. Employing Theory Formation to Guide Proof Planning , 2002, AISC.
[45] Robert Gardner,et al. Introduction To Real Analysis , 1994 .
[46] Manuela M. Veloso,et al. Planning and Learning by Analogical Reasoning , 1994, Lecture Notes in Computer Science.
[47] Simon Colton,et al. Automated Theory Formation in Pure Mathematics , 2002, Distinguished dissertations.
[48] Andreas Meier. System description : TRAMP transformation of machine-found proofs into natural deduction proofs at the assertion level , 2000 .
[49] Austin Tate,et al. Generating Project Networks , 1977, IJCAI.
[50] Erica Melis. The "Limit" Domain , 1998, AIPS.
[51] Alan H. Schoenfeld,et al. Mathematical Problem Solving , 1985 .
[52] Alan Bundy. A Critique of Proof Planning , 2002, Computational Logic: Logic Programming and Beyond.
[53] Erica Melis,et al. AI-Techniques in Proof Planning , 1998, ECAI.