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