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