Fri, 28 Apr 1995 15:38:15 +0200 Added
nipkow [Fri, 28 Apr 1995 15:38:15 +0200] rev 1078
Added functor f() = struct end to hide functors to save space.
Fri, 28 Apr 1995 11:52:43 +0200 Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp [Fri, 28 Apr 1995 11:52:43 +0200] rev 1077
Renamed insert_kbrl to insert_tagged_brl and exported it. Now subgoals_of_brl calls nprems_of, which is faster than length o prems_of.
Fri, 28 Apr 1995 11:41:59 +0200 Modified proofs for new claset primitives. The problem is that they enforce
lcp [Fri, 28 Apr 1995 11:41:59 +0200] rev 1076
Modified proofs for new claset primitives. The problem is that they enforce the "most recent added rule has priority" policy more strictly now.
Fri, 28 Apr 1995 11:31:33 +0200 Modified proofs for new claset primitives. The problem is that they enforce
lcp [Fri, 28 Apr 1995 11:31:33 +0200] rev 1075
Modified proofs for new claset primitives. The problem is that they enforce the "most recent added rule has priority" policy more strictly now.
Fri, 28 Apr 1995 11:24:32 +0200 Modified proofs for new claset primitives. The problem is that they enforce
lcp [Fri, 28 Apr 1995 11:24:32 +0200] rev 1074
Modified proofs for new claset primitives. The problem is that they enforce the "most recent added rule has priority" policy more strictly now.
Fri, 28 Apr 1995 10:57:40 +0200 Recoded addSIs, etc., so that nets are built incrementally
lcp [Fri, 28 Apr 1995 10:57:40 +0200] rev 1073
Recoded addSIs, etc., so that nets are built incrementally instead of from scratch each time. The old approach used excessive time (>1 sec for adding a rule to ZF_cs) and probably excessive space. Now rep_claset includes all record fields. joinrules no longer sorts the rules on number of subgoals, since it does not see the full set of them; instead the number of subgoals modifies the priority.
(0) -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip