1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/doc-isac/tactics.tex	Tue Sep 17 09:50:52 2013 +0200
     1.3 @@ -0,0 +1,26 @@
     1.4 +\chapter{\isac s tactics}
     1.5 +
     1.6 +\begin{description}
     1.7 +\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.
     1.8 +\item{\bf Init\_Proof} generates a proof tree with an empty model.
     1.9 +\item{\bf Model\_Problem problem} determines a problemtype (eventually found in the hierarchy) to be used for modeling.
    1.10 +\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).
    1.11 +\item{\bf Specify\_Theory theory, Specify\_Problem problem, Specify\_Method method} specifies the respective element of the knowledgebase.
    1.12 +\item{\bf Refine\_Problem problem} searches for a matching problem in the hierarchy below 'problem'.
    1.13 +\item{\bf Apply\_Method method} finishes the model and specification phase and starts the solve phase. 
    1.14 +\item{\bf Free\_Solve} initiates the solve phase without guidance by a method.
    1.15 +\item{\bf Rewrite theorem} applies 'theorem' to the current formula and transforms it accordingly (if possible -- otherwise error). 
    1.16 +\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)
    1.17 +\item{\bf Rewrite\_Set ruleset} similar to 'Rewrite', but applies a whole set of theorems ('ruleset').
    1.18 +\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.
    1.19 +\item{\bf Calculate operation} calculates the result of numerals w.r.t. 'operation' (plus, minus, times, cancel, pow, sqrt) within the current formula.
    1.20 +\item{\bf Substitute substitution} applies 'substitution' to the current formula and transforms it accordingly.
    1.21 +\item{\bf Take formula} starts a new sequence of calculations on 'formula' within an already ongoing calculation. 
    1.22 +\item{\bf Subproblem (theory, problem)} initiates a subproblem within a calculation.
    1.23 +\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. 
    1.24 +\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.
    1.25 +\item{\bf Check\_elementwise assumptions} w.r.t. the current formula which comprises elements in a list.
    1.26 +\item{\bf Or\_to\_List} transforms a conjunction of equations to a list of equations (a questionable tactic in equation solving).
    1.27 +\item{\bf Check\_postcond:} check the current formula w.r.t. the postcondition on finishing the resepctive (sub)problem. 
    1.28 +\item{\bf End\_Proof} finishes a proof and delivers a result only if 'Check\_postcond' has been successful before.
    1.29 +\end{description}
    1.30 \ No newline at end of file