Download:
|
by U Niv, Erica Melis, Erica Melis, Andreas Meier, Andreas Meier
http://www.ags.uni-sb.de/~ameier/publications/SR-99-06.ps.gz
Add To MetaCart
Abstract:
Humans have different problem solving strategies at their disposal and they can flexibly employ several strategies when solving a complex problem, whereas previous planning and theorem proving systems typically employ a single strategy or a hard coded combination of a few strategies. We introduce multi-strategy proof planning that allows to combine a number of strategies and to switch between them in a planning process. Thereby proof planning becomes more robust since it does not necessarily fail if one problem solving mechanism fails. Rather it can reason about preference of strategies and about failures. Moreover, our strategies provide a means for structuring the vast amount of knowledge such that the planner can cope with an otherwise overwhelming knowledge in mathematics. Since different strategies can employ different algorithms it is possible to combine precondition satisfaction planning with other algorithms that refine or modify a plan. The multi-strategy proof planning is implemented in the system MULTI which has a blackboard architecture. 1
Citations
|
263
|
Otter 3.0 Reference Manual and Guide
– McCune
- 1994
|
|
234
|
An Introduction to Least Commitment Planning
– Weld
- 1994
|
|
205
|
A blackboard architecture for control
– Hayes-Roth
- 1985
|
|
93
|
Experiments with proof plans for induction
– Bundy, Harmelen, et al.
- 1991
|
|
84
|
Knowledge-Based Proof Planning
– Melis, Siekmann
- 1999
|
|
70
|
The Elements of Real Analysis
– Bartle, ed
- 1976
|
|
49
|
A Multiagent Planning Architecture
– Wilkins, Myers
- 1998
|
|
48
|
Conditional, Probabilistic Planning: A Unifying Algorithm and Effective Search Control Mechanisms
– Onder, Pollack
- 1999
|
|
45
|
Universal Classical Planner: An algorithm for unifying state-space and plan-space planning
– Kambhampati, Srivastava
- 1995
|
|
39
|
Provably bounded optimal agents
– Russell, Subramanian, et al.
- 1993
|
|
34
|
Passive and active decision postponement in plan generation
– Joslin, Pollack
- 1995
|
|
34
|
Flaw Selection Strategies for Partial-Order Planning
– Pollack, Joslin, et al.
- 1997
|
|
26
|
Mathematical problem solving
– Schoenfeld
- 1985
|
|
20
|
Cooperation of heterogeneous provers
– Denzinger, Fuchs
- 1999
|
|
20
|
The "limit" domain
– Melis
- 1998
|
|
12
|
How to solve it automatically: Selection among problem-solving methods
– Fink
- 1998
|
|
8
|
Integrating diverse reasoning methods in the BB1 blackboard control architecture
– Johnson, Hayes-Roth
- 1987
|
|
8
|
Combining Proof Planning with Constraint Solving
– Melis
- 1998
|
|
4
|
Proof planning with multiple strategies II
– Melis, Meier
- 1999
|
|
4
|
Flexibly interleaving processes
– Melis, Ullrich
- 1999
|
|
2
|
Solving complex tasks through extraction of subproblems
– Koehler
- 1998
|
