|
agriesma@308
|
1 |
\begin{description}
|
|
agriesma@308
|
2 |
\item{\bf Init\_Proof\_Hid (dialogmode, formalization, specification)} transfers the arguments to the math engine, the latter two in order to solve the example automatically. The tactic is not intended to be used by the student; it generates a proof tree with an empty model.
|
|
agriesma@308
|
3 |
\item{\bf Init\_Proof} generates a proof tree with an empty model.
|
|
agriesma@308
|
4 |
\item{\bf Model\_Problem problem} determines a problemtype (eventually found in the hierarchy) to be used for modeling.
|
|
agriesma@308
|
5 |
\item{\bf Add\_Given, Add\_Find, Add\_Relation formula} inputs a formula to the respective field in a model (necessary as long as there is no facility for the user to input formula directly, and not only select the respective tactic plus formula from a list).
|
|
agriesma@308
|
6 |
\item{\bf Specify\_Theory theory, Specify\_Problem problem, Specify\_Method method} specifies the respective element of the knowledgebase.
|
|
agriesma@308
|
7 |
\item{\bf Refine\_Problem problem} searches for a matching problem in the hierarchy below 'problem'.
|
|
agriesma@308
|
8 |
\item{\bf Apply\_Method method} finishes the model and specification phase and starts the solve phase.
|
|
agriesma@308
|
9 |
\item{\bf Free\_Solve} initiates the solve phase without guidance by a method.
|
|
agriesma@308
|
10 |
\item{\bf Rewrite theorem} applies 'theorem' to the current formula and transforms it accordingly (if possible -- otherwise error).
|
|
agriesma@308
|
11 |
\item{\bf Rewrite\_Asm theorem} is the same tactic as 'Rewrite', but stores an eventual assumption of the theorem (instead of evaluating the assumption, i.e. the condition)
|
|
agriesma@308
|
12 |
\item{\bf Rewrite\_Set ruleset} similar to 'Rewrite', but applies a whole set of theorems ('ruleset').
|
|
agriesma@308
|
13 |
\item{\bf Rewrite\_Inst (substitution, theorem), Rewrite\_Set\_Inst (substitution, ruleset)} similar to the respective tactics, but substitute a constant (e.g. a bound variable) in 'theorem' before application.
|
|
agriesma@308
|
14 |
\item{\bf Calculate operation} calculates the result of numerals w.r.t. 'operation' (plus, minus, times, cancel, pow, sqrt) within the current formula.
|
|
agriesma@308
|
15 |
\item{\bf Substitute substitution} applies 'substitution' to the current formula and transforms it accordingly.
|
|
agriesma@308
|
16 |
\item{\bf Take formula} starts a new sequence of calculations on 'formula' within an already ongoing calculation.
|
|
agriesma@308
|
17 |
\item{\bf Subproblem (theory, problem)} initiates a subproblem within a calculation.
|
|
agriesma@308
|
18 |
\item{\bf Function formula} calls a function, where 'formula' contains the function name, e.g. 'Function (solve $1+2x+3x^2=0\;\;\;x$)'. In this case the modelling and specification phases are suppressed by default, i.e. the solving phase of this subproblem starts immediately.
|
|
agriesma@308
|
19 |
\item{\bf Split\_And, Conclude\_And, Split\_Or, Conclude\_Or, Begin\_Trans, End\_Trans, Begin\_Sequ, End\_Sequ, Split\_Intersect, End\_Intersect} concern the construction of particular branches of the prooftree; usually suppressed by the dialog guide.
|
|
agriesma@308
|
20 |
\item{\bf Check\_elementwise assumptions} w.r.t. the current formula which comprises elements in a list.
|
|
agriesma@308
|
21 |
\item{\bf Or\_to\_List} transforms a conjunction of equations to a list of equations (a questionable tactic in equation solving).
|
|
agriesma@308
|
22 |
\item{\bf Check\_postcond:} check the current formula w.r.t. the postcondition on finishing the resepctive (sub)problem.
|
|
agriesma@308
|
23 |
\item{\bf End\_Proof} finishes a proof and delivers a result only if 'Check\_postcond' has been successful before.
|
|
agriesma@308
|
24 |
\end{description}
|