src/Pure/search.ML
author oheimb
Fri Jan 28 11:23:41 2000 +0100 (2000-01-28)
changeset 8149 941afb897532
parent 5956 ab4d13e9e77a
child 9094 530e7a33b3dd
permissions -rw-r--r--
added tacticals DETERM_UNTIL and DETERM_UNTIL_SOLVED
paulson@1588
     1
(*  Title: 	search
paulson@1588
     2
    ID:         $Id$
paulson@1588
     3
    Author: 	Lawrence C Paulson and Norbert Voelker
paulson@1588
     4
paulson@1588
     5
Search tacticals
paulson@1588
     6
*)
paulson@1588
     7
paulson@2672
     8
infix 1 THEN_MAYBE THEN_MAYBE';
paulson@2672
     9
paulson@1588
    10
signature SEARCH =
paulson@1588
    11
  sig
paulson@2869
    12
  val DEEPEN  	        : int*int -> (int->int->tactic) -> int -> int -> tactic
paulson@2869
    13
paulson@2672
    14
  val THEN_MAYBE	: tactic * tactic -> tactic
paulson@2672
    15
  val THEN_MAYBE'	: ('a -> tactic) * ('a -> tactic) -> ('a -> tactic)
paulson@2672
    16
paulson@1588
    17
  val trace_DEPTH_FIRST	: bool ref
paulson@1588
    18
  val DEPTH_FIRST	: (thm -> bool) -> tactic -> tactic
paulson@1588
    19
  val DEPTH_SOLVE	: tactic -> tactic
paulson@1588
    20
  val DEPTH_SOLVE_1	: tactic -> tactic
paulson@1588
    21
  val ITER_DEEPEN	: (thm->bool) -> (int->tactic) -> tactic
paulson@1588
    22
  val THEN_ITER_DEEPEN	: tactic -> (thm->bool) -> (int->tactic) -> tactic
paulson@1588
    23
paulson@1588
    24
  val has_fewer_prems	: int -> thm -> bool   
paulson@1588
    25
  val IF_UNSOLVED	: tactic -> tactic
oheimb@5754
    26
  val SOLVE		: tactic -> tactic
oheimb@8149
    27
  val DETERM_UNTIL_SOLVED: tactic -> tactic
paulson@1588
    28
  val trace_BEST_FIRST	: bool ref
paulson@1588
    29
  val BEST_FIRST	: (thm -> bool) * (thm -> int) -> tactic -> tactic
paulson@1588
    30
  val THEN_BEST_FIRST	: tactic -> (thm->bool) * (thm->int) -> tactic
paulson@1588
    31
			  -> tactic
paulson@1588
    32
  val trace_ASTAR	: bool ref
paulson@1588
    33
  val ASTAR	        : (thm -> bool) * (int->thm->int) -> tactic -> tactic
paulson@1588
    34
  val THEN_ASTAR	: tactic -> (thm->bool) * (int->thm->int) -> tactic
paulson@1588
    35
			  -> tactic
paulson@1588
    36
  val BREADTH_FIRST	: (thm -> bool) -> tactic -> tactic
wenzelm@5693
    37
  val QUIET_BREADTH_FIRST	: (thm -> bool) -> tactic -> tactic
paulson@1588
    38
  end;
paulson@1588
    39
paulson@1588
    40
structure Search : SEARCH = 
paulson@1588
    41
struct
paulson@1588
    42
paulson@1588
    43
(**** Depth-first search ****)
paulson@1588
    44
paulson@1588
    45
val trace_DEPTH_FIRST = ref false;
paulson@1588
    46
paulson@1588
    47
(*Searches until "satp" reports proof tree as satisfied.
paulson@1588
    48
  Suppresses duplicate solutions to minimize search space.*)
paulson@1588
    49
fun DEPTH_FIRST satp tac = 
paulson@1588
    50
 let val tac = tracify trace_DEPTH_FIRST tac
paulson@1588
    51
     fun depth used [] = None
paulson@1588
    52
       | depth used (q::qs) =
wenzelm@4270
    53
	  case Seq.pull q of
paulson@1588
    54
	      None         => depth used qs
paulson@1588
    55
	    | Some(st,stq) => 
paulson@1588
    56
		if satp st andalso not (gen_mem eq_thm (st, used))
wenzelm@4270
    57
		then Some(st, Seq.make
paulson@1588
    58
			         (fn()=> depth (st::used) (stq::qs)))
paulson@1588
    59
		else depth used (tac st :: stq :: qs)
wenzelm@4270
    60
  in  traced_tac (fn st => depth [] ([Seq.single st]))  end;
paulson@1588
    61
paulson@1588
    62
paulson@1588
    63
paulson@1588
    64
(*Predicate: Does the rule have fewer than n premises?*)
paulson@1588
    65
fun has_fewer_prems n rule = (nprems_of rule < n);
paulson@1588
    66
paulson@1588
    67
(*Apply a tactic if subgoals remain, else do nothing.*)
paulson@1588
    68
val IF_UNSOLVED = COND (has_fewer_prems 1) all_tac;
paulson@1588
    69
oheimb@5754
    70
(*Force a tactic to solve its goal completely, otherwise fail *)
oheimb@5754
    71
fun SOLVE tac = tac THEN COND (has_fewer_prems 1) all_tac no_tac;
oheimb@5754
    72
oheimb@8149
    73
(*Force repeated application of tactic until goal is solved completely *)
oheimb@8149
    74
val DETERM_UNTIL_SOLVED = DETERM_UNTIL (has_fewer_prems 1);
oheimb@8149
    75
paulson@2672
    76
(*Execute tac1, but only execute tac2 if there are at least as many subgoals
paulson@2672
    77
  as before.  This ensures that tac2 is only applied to an outcome of tac1.*)
paulson@3538
    78
fun (tac1 THEN_MAYBE tac2) st = 
paulson@3538
    79
    (tac1  THEN  COND (has_fewer_prems (nprems_of st)) all_tac tac2)  st;
paulson@2672
    80
paulson@2672
    81
fun (tac1 THEN_MAYBE' tac2) x = tac1 x THEN_MAYBE tac2 x;
paulson@2672
    82
paulson@1588
    83
(*Tactical to reduce the number of premises by 1.
paulson@1588
    84
  If no subgoals then it must fail! *)
paulson@3538
    85
fun DEPTH_SOLVE_1 tac st = st |>
paulson@1588
    86
    (case nprems_of st of
paulson@1588
    87
	0 => no_tac
paulson@3538
    88
      | n => DEPTH_FIRST (has_fewer_prems n) tac);
paulson@1588
    89
paulson@1588
    90
(*Uses depth-first search to solve ALL subgoals*)
paulson@1588
    91
val DEPTH_SOLVE = DEPTH_FIRST (has_fewer_prems 1);
paulson@1588
    92
paulson@1588
    93
paulson@1588
    94
paulson@2869
    95
(**** Iterative deepening with pruning ****)
paulson@1588
    96
paulson@1588
    97
fun has_vars (Var _) = true
paulson@1588
    98
  | has_vars (Abs (_,_,t)) = has_vars t
paulson@1588
    99
  | has_vars (f$t) = has_vars f orelse has_vars t
paulson@1588
   100
  | has_vars _ = false;
paulson@1588
   101
paulson@1588
   102
(*Counting of primitive inferences is APPROXIMATE, as the step tactic
paulson@1588
   103
  may perform >1 inference*)
paulson@1588
   104
paulson@1588
   105
(*Pruning of rigid ancestor to prevent backtracking*)
paulson@1588
   106
fun prune (new as (k', np':int, rgd', stq), qs) = 
paulson@1588
   107
    let fun prune_aux (qs, []) = new::qs
paulson@1588
   108
          | prune_aux (qs, (k,np,rgd,q)::rqs) =
paulson@1588
   109
	      if np'+1 = np andalso rgd then
paulson@1588
   110
		  (if !trace_DEPTH_FIRST then
paulson@1588
   111
		       writeln ("Pruning " ^ 
paulson@1588
   112
				string_of_int (1+length rqs) ^ " levels")
paulson@1588
   113
		   else ();
paulson@1588
   114
		   (*Use OLD k: zero-cost solution; see Stickel, p 365*)
paulson@1588
   115
		   (k, np', rgd', stq) :: qs)
paulson@1588
   116
	      else prune_aux ((k,np,rgd,q)::qs, rqs)
paulson@1588
   117
        fun take ([], rqs) = ([], rqs)
paulson@1588
   118
	  | take (arg as ((k,np,rgd,stq)::qs, rqs)) = 
paulson@1588
   119
	        if np' < np then take (qs, (k,np,rgd,stq)::rqs)
paulson@1588
   120
		            else arg
paulson@1588
   121
    in  prune_aux (take (qs, []))  end;
paulson@1588
   122
paulson@1588
   123
paulson@1588
   124
(*Depth-first iterative deepening search for a state that satisfies satp
paulson@1588
   125
  tactic tac0 sets up the initial goal queue, while tac1 searches it.
paulson@1588
   126
  The solution sequence is redundant: the cutoff heuristic makes it impossible
paulson@1588
   127
  to suppress solutions arising from earlier searches, as the accumulated cost
paulson@1588
   128
  (k) can be wrong.*)
paulson@1588
   129
fun THEN_ITER_DEEPEN tac0 satp tac1 = traced_tac (fn st => 
paulson@1588
   130
 let val countr = ref 0
paulson@1588
   131
     and tf = tracify trace_DEPTH_FIRST (tac1 1)
paulson@1588
   132
     and qs0 = tac0 st
paulson@1588
   133
     (*bnd = depth bound; inc = estimate of increment required next*)
paulson@1588
   134
     fun depth (bnd,inc) [] = 
paulson@1588
   135
	     (writeln (string_of_int (!countr) ^ 
paulson@1588
   136
		       " inferences so far.  Searching to depth " ^ 
paulson@1588
   137
		       string_of_int bnd);
paulson@1588
   138
	      (*larger increments make it run slower for the hard problems*)
paulson@1588
   139
	      depth (bnd+inc, 10)) [(0, 1, false, qs0)]
paulson@1588
   140
       | depth (bnd,inc) ((k,np,rgd,q)::qs) =
paulson@1588
   141
	  if k>=bnd then depth (bnd,inc) qs
paulson@1588
   142
          else
paulson@1588
   143
	  case (countr := !countr+1;
paulson@1588
   144
		if !trace_DEPTH_FIRST then
paulson@1588
   145
		    writeln (string_of_int np ^ 
paulson@1588
   146
			     implode (map (fn _ => "*") qs))
paulson@1588
   147
		else ();
wenzelm@4270
   148
		Seq.pull q) of
paulson@1588
   149
	     None         => depth (bnd,inc) qs
paulson@1588
   150
	   | Some(st,stq) => 
paulson@1588
   151
	       if satp st	(*solution!*)
wenzelm@4270
   152
	       then Some(st, Seq.make
paulson@1588
   153
			 (fn()=> depth (bnd,inc) ((k,np,rgd,stq)::qs)))
paulson@1588
   154
paulson@1588
   155
	       else 
paulson@1588
   156
               let val np' = nprems_of st
paulson@1588
   157
		     (*rgd' calculation assumes tactic operates on subgoal 1*)
paulson@1588
   158
                   val rgd' = not (has_vars (hd (prems_of st)))
paulson@1588
   159
                   val k' = k+np'-np+1  (*difference in # of subgoals, +1*)
paulson@1588
   160
               in  if k'+np' >= bnd 
paulson@2143
   161
		   then depth (bnd, Int.min(inc, k'+np'+1-bnd)) qs
paulson@1588
   162
		   else if np' < np (*solved a subgoal; prune rigid ancestors*)
paulson@1588
   163
                   then depth (bnd,inc) 
paulson@1588
   164
		         (prune ((k', np', rgd', tf st), (k,np,rgd,stq) :: qs))
paulson@1588
   165
	           else depth (bnd,inc) ((k', np', rgd', tf st) :: 
paulson@1588
   166
					 (k,np,rgd,stq) :: qs)
paulson@1588
   167
	       end
paulson@1588
   168
  in depth (0,5) [] end);
paulson@1588
   169
paulson@1588
   170
val ITER_DEEPEN = THEN_ITER_DEEPEN all_tac;
paulson@1588
   171
paulson@1588
   172
paulson@2869
   173
(*Simple iterative deepening tactical.  It merely "deepens" any search tactic
paulson@2869
   174
  using increment "inc" up to limit "lim". *)
paulson@2869
   175
fun DEEPEN (inc,lim) tacf m i = 
paulson@3538
   176
  let fun dpn m st = st |> (if has_fewer_prems i st then no_tac
paulson@3538
   177
			    else if m>lim then 
paulson@3538
   178
				(writeln "Giving up..."; no_tac)
paulson@3538
   179
				 else (writeln ("Depth = " ^ string_of_int m);
paulson@3538
   180
				       tacf m i  ORELSE  dpn (m+inc)))
paulson@2869
   181
  in  dpn m  end;
paulson@2869
   182
paulson@1588
   183
(*** Best-first search ***)
paulson@1588
   184
paulson@1588
   185
val trace_BEST_FIRST = ref false;
paulson@1588
   186
paulson@1588
   187
(*Insertion into priority queue of states *)
paulson@1588
   188
fun insert (nth: int*thm, []) = [nth]
paulson@1588
   189
  | insert ((m,th), (n,th')::nths) = 
paulson@1588
   190
      if  n<m then (n,th') :: insert ((m,th), nths)
paulson@1588
   191
      else if  n=m andalso eq_thm(th,th')
paulson@1588
   192
              then (n,th')::nths
paulson@1588
   193
              else (m,th)::(n,th')::nths;
paulson@1588
   194
paulson@1588
   195
(*For creating output sequence*)
paulson@1588
   196
fun some_of_list []     = None
wenzelm@4270
   197
  | some_of_list (x::l) = Some (x, Seq.make (fn () => some_of_list l));
paulson@1588
   198
paulson@1588
   199
paulson@1588
   200
(*Best-first search for a state that satisfies satp (incl initial state)
paulson@1588
   201
  Function sizef estimates size of problem remaining (smaller means better).
paulson@1588
   202
  tactic tac0 sets up the initial priority queue, while tac1 searches it. *)
paulson@1588
   203
fun THEN_BEST_FIRST tac0 (satp, sizef) tac1 = 
paulson@1588
   204
  let val tac = tracify trace_BEST_FIRST tac1
paulson@1588
   205
      fun pairsize th = (sizef th, th);
paulson@1588
   206
      fun bfs (news,nprfs) =
paulson@1588
   207
	   (case  partition satp news  of
paulson@1588
   208
		([],nonsats) => next(foldr insert
paulson@1588
   209
					(map pairsize nonsats, nprfs)) 
paulson@1588
   210
	      | (sats,_)  => some_of_list sats)
paulson@1588
   211
      and next [] = None
paulson@1588
   212
        | next ((n,prf)::nprfs) =
paulson@1588
   213
	    (if !trace_BEST_FIRST 
paulson@1588
   214
	       then writeln("state size = " ^ string_of_int n ^ 
paulson@1588
   215
		         "  queue length =" ^ string_of_int (length nprfs))  
paulson@1588
   216
               else ();
wenzelm@4270
   217
	     bfs (Seq.list_of (tac prf), nprfs))
wenzelm@4270
   218
      fun btac st = bfs (Seq.list_of (tac0 st),  [])
paulson@1588
   219
  in traced_tac btac end;
paulson@1588
   220
paulson@1588
   221
(*Ordinary best-first search, with no initial tactic*)
paulson@1588
   222
val BEST_FIRST = THEN_BEST_FIRST all_tac;
paulson@1588
   223
paulson@1588
   224
(*Breadth-first search to satisfy satpred (including initial state) 
paulson@1588
   225
  SLOW -- SHOULD NOT USE APPEND!*)
wenzelm@5693
   226
fun gen_BREADTH_FIRST message satpred (tac:tactic) = 
wenzelm@4270
   227
  let val tacf = Seq.list_of o tac;
paulson@1588
   228
      fun bfs prfs =
paulson@1588
   229
	 (case  partition satpred prfs  of
paulson@1588
   230
	      ([],[]) => []
paulson@1588
   231
	    | ([],nonsats) => 
wenzelm@5956
   232
		  (message("breadth=" ^ string_of_int(length nonsats));
paulson@2672
   233
		   bfs (List.concat (map tacf nonsats)))
paulson@1588
   234
	    | (sats,_)  => sats)
wenzelm@4270
   235
  in (fn st => Seq.of_list (bfs [st])) end;
paulson@1588
   236
wenzelm@5956
   237
val BREADTH_FIRST = gen_BREADTH_FIRST writeln;
wenzelm@5693
   238
val QUIET_BREADTH_FIRST = gen_BREADTH_FIRST (K ());
wenzelm@5693
   239
paulson@1588
   240
paulson@1588
   241
(*  Author: 	Norbert Voelker, FernUniversitaet Hagen
paulson@1588
   242
    Remarks:    Implementation of A*-like proof procedure by modification
paulson@1588
   243
		of the existing code for BEST_FIRST and best_tac so that the 
paulson@1588
   244
		current level of search is taken into account.
paulson@1588
   245
*)		
paulson@1588
   246
paulson@1588
   247
(*Insertion into priority queue of states, marked with level *)
paulson@1588
   248
fun insert_with_level (lnth: int*int*thm, []) = [lnth]
paulson@1588
   249
  | insert_with_level ((l,m,th), (l',n,th')::nths) = 
paulson@1588
   250
      if  n<m then (l',n,th') :: insert_with_level ((l,m,th), nths)
paulson@1588
   251
      else if  n=m andalso eq_thm(th,th')
paulson@1588
   252
              then (l',n,th')::nths
paulson@1588
   253
              else (l,m,th)::(l',n,th')::nths;
paulson@1588
   254
paulson@1588
   255
(*For creating output sequence*)
paulson@1588
   256
fun some_of_list []     = None
wenzelm@4270
   257
  | some_of_list (x::l) = Some (x, Seq.make (fn () => some_of_list l));
paulson@1588
   258
paulson@1588
   259
val trace_ASTAR = ref false; 
paulson@1588
   260
paulson@1588
   261
fun THEN_ASTAR tac0 (satp, costf) tac1 = 
paulson@1588
   262
  let val tf = tracify trace_ASTAR tac1;   
paulson@1588
   263
      fun bfs (news,nprfs,level) =
paulson@1588
   264
      let fun cost thm = (level, costf level thm, thm)
paulson@1588
   265
      in (case  partition satp news  of
paulson@1588
   266
            ([],nonsats) 
paulson@1588
   267
		 => next (foldr insert_with_level (map cost nonsats, nprfs))
paulson@1588
   268
          | (sats,_)  => some_of_list sats)
paulson@1588
   269
      end and    
paulson@1588
   270
      next []  = None
paulson@1588
   271
        | next ((level,n,prf)::nprfs)  =
paulson@1588
   272
            (if !trace_ASTAR 
paulson@1588
   273
               then writeln("level = " ^ string_of_int level ^
paulson@1588
   274
			 "  cost = " ^ string_of_int n ^ 
paulson@1588
   275
                         "  queue length =" ^ string_of_int (length nprfs))  
paulson@1588
   276
               else ();
wenzelm@4270
   277
             bfs (Seq.list_of (tf prf), nprfs,level+1))
wenzelm@4270
   278
      fun tf st = bfs (Seq.list_of (tac0 st), [], 0)
paulson@1588
   279
  in traced_tac tf end;
paulson@1588
   280
paulson@1588
   281
(*Ordinary ASTAR, with no initial tactic*)
paulson@1588
   282
val ASTAR = THEN_ASTAR all_tac;
paulson@1588
   283
paulson@1588
   284
end;
paulson@1588
   285
paulson@1588
   286
open Search;