Blocksworld using astar search is backtracking required

Val safe_steps_tac : ntext -> int -> tactic Val unsafe_step_tac : ntext -> int -> tactic Val dup_step_tac : ntext -> int -> tactic

Val deepen_tac : ntext -> int -> int -> tactic Val depth_tac : ntext -> int -> int -> tactic Val slow_best_tac : ntext -> int -> tactic Val first_best_tac : ntext -> int -> tactic Val slow_astar_tac : ntext -> int -> tactic Val addDs : ntext * thm list -> ntext val addEs : ntext * thm list -> ntext val addIs : ntext * thm list -> ntext val addSDs : ntext * thm list -> ntext val addSEs : ntext * thm list -> ntext val addSIs : ntext * thm list -> ntext val delrules : ntext * thm list -> ntext val addSWrapper : ntext * (string * ( ntext -> wrapper ) ) -> ntext val delSWrapper : ntext * string -> ntext val addWrapper : ntext * (string * ( ntext -> wrapper ) ) -> ntext val delWrapper : ntext * string -> ntext val addSbefore : ntext * (string * ( ntext -> int -> tactic ) ) -> ntext val addSafter : ntext * (string * ( ntext -> int -> tactic ) ) -> ntext val addbefore : ntext * (string * ( ntext -> int -> tactic ) ) -> ntext val addafter : ntext * (string * ( ntext -> int -> tactic ) ) -> ntext val addD2 : ntext * (string * thm ) -> ntext val addE2 : ntext * (string * thm ) -> ntext val addSD2 : ntext * (string * thm ) -> ntext val addSE2 : ntext * (string * thm ) -> ntext val appSWrappers : ntext -> wrapper val appWrappers : ntext -> wrapper val claset_of : ntext -> claset val put_claset : claset -> ntext -> ntext val map_theory_claset : ( ntext -> ntext ) -> theory -> theory Type claset val print_claset : ntext -> unit Substitution in the hypotheses assumed to be safe! *) end signature BASIC_CLASSICAL = sig type wrapper = (int -> tactic ) -> int -> tactic *) (*higher precedence than := facilitates use of references*) infix 4 addSIs addSEs addSDs addIs addEs addDs delrulesДЄddSWrapper delSWrapper addWrapper delWrapperДЄddD2 addE2 addSD2 addSE2 signature CLASSICAL_DATA = sig val imp_elim : thm (* P -> Q => (~ R => P) => (Q => R) => R *) val not_elim : thm (* ~P => P => R *) val swap : thm (* ~ P => (~ R => P) => R *) val classical : thm (* (~ P => P) => P *) val sizef : thm -> int (* size function for BEST_FIRST, typically size_of_thm *) val hyp_subst_tacs : ( ntext -> int -> tactic ) list (* optional tactics for There should be no variables in the premises that are not in

Rules must be classified as intro, elim, safe, unsafe.ДЄ rule is unsafe unless it can be applied blindly without harmful results.ДЇor a rule to be safe, its premises and conclusion should be logicallyД®quivalent. Theorem prover for classical reasoning, including predicate calculus, set File вЂ№~~/src/Provers/classical.MLвЂє (* Title: Provers/classical.MLДЄuthor: Lawrence C Paulson, Cambridge University Computer Laboratory

Blocksworld using astar search is backtracking required