reference:rule_method
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| reference:rule_method [2011/06/13 22:01] – created 178.26.109.100 | reference:rule_method [2011/06/22 12:27] (current) – [Example] 131.246.161.187 | ||
|---|---|---|---|
| Line 12: | Line 12: | ||
| Then, '' | Then, '' | ||
| - | * [[unification|Unify]] $C$ and $Q$. The application fails if there is no unifiert; otherwise, let $U$ be this unifier. | + | * [[unification|Unify]] $C$ and $Q$. The application fails if there is no unifier; otherwise, let $U$ be this unifier. |
| * Remove the old subgoal and create one new subgoal \\ \\ $\quad\bigwedge x_1 \dots x_k : [|\ U(A_1); \dots ; U(A_m)\ |] \Longrightarrow U(P_k)$ \\ \\ for each $k = 1, \dots, n$. | * Remove the old subgoal and create one new subgoal \\ \\ $\quad\bigwedge x_1 \dots x_k : [|\ U(A_1); \dots ; U(A_m)\ |] \Longrightarrow U(P_k)$ \\ \\ for each $k = 1, \dots, n$. | ||
| ==== Example ==== | ==== Example ==== | ||
| + | Assume we have a goal | ||
| + | |||
| + | $\quad[|\ A |] \Longrightarrow A \vee B$ | ||
| + | |||
| + | Applying '' | ||
| + | |||
| + | $\quad [|\ A\ |] \Longrightarrow A$ | ||
| + | |||
| + | which can obviously be solved by one application of '' | ||
| + | |||
| ==== Non-Example ==== | ==== Non-Example ==== | ||
| Line 23: | Line 33: | ||
| With '' | With '' | ||
| apply (rule_tac ident1=" | apply (rule_tac ident1=" | ||
| - | This means that the variables | + | This means that the variable |
| + | |||
| + | === rule(k) === | ||
| + | Oftentimes, a rule application results in several subgoals that can directly be solved by '' | ||
| ==== Relatives ==== | ==== Relatives ==== | ||
reference/rule_method.1307995264.txt.gz · Last modified: by 178.26.109.100
