1 (* Copyright (C) 2000-2002, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
27 let in_hypothesis = "'http://www.cs.unibo.it/helm/schemas/schema-helm#InHypothesis'" ;;
29 let main_hypothesis = "'http://www.cs.unibo.it/helm/schemas/schema-helm#MainHypothesis'" ;;
31 let main_conclusion = "'http://www.cs.unibo.it/helm/schemas/schema-helm#MainConclusion'" ;;
33 let in_conclusion = "'http://www.cs.unibo.it/helm/schemas/schema-helm#InConclusion'" ;;
35 let escape = Str.global_replace (Str.regexp_string "\'") "\\'";;
37 let hyp_const (conn:Mysql.dbd) uri =
38 let uri = escape uri in
39 (*query to obtain all the constants in the hypothesis and conclusion of the theorem*)
41 "select h_occurrence from refObj where source='"^uri^
42 "' and (h_position="^main_hypothesis^" or h_position="^in_hypothesis^
43 "or h_position="^main_conclusion^" or h_position="^in_conclusion^")" in
44 (* prerr_endline ("$$$$$$$$$$$$$$$"^query);*)
45 let result = Mysql.exec conn query in
46 (* now we transform the result in a set *)
48 match (Array.to_list a) with
50 | _ -> assert false in
51 let result = Mysql.map ~f:f result in
54 NewConstraints.StringSet.add uri set)
55 NewConstraints.StringSet.empty result
58 (* for each uri check if its costants are a subset of
59 const, the set of the costants of the proof *)
60 let filter_new_constants (conn:Mysql.dbd) const (_,uri) =
61 let hyp = hyp_const conn uri in
62 (* prerr_endline (NewConstraints.pp_StringSet hyp);*)
63 NewConstraints.StringSet.subset hyp const
69 let rec exec_query (conn:Mysql.dbd) uris k =
70 let add_must (n,from,where) uri =
71 let refObjn = "refObj" ^ (string_of_int n) in
73 [ refObjn^".h_occurrence = '" ^ uri ^ "'";
74 "("^refObjn^".h_position = " ^ main_conclusion^ " or "
75 ^refObjn^".h_position = " ^ in_conclusion^ " or "
76 ^refObjn^".h_position = " ^ main_hypothesis^ " or "
77 ^refObjn^".h_position = " ^ in_hypothesis^ ")"] in
79 if n = 0 then new_must@where
81 (refObjn^".source = refObj" ^ (string_of_int (n-1))
82 ^ ".source")::new_must@where in
83 (n+1,("refObj as "^refObjn)::from,where')
86 List.fold_left add_must (0,[],[]) uris in
89 ("no=" ^ (string_of_int k))::
90 ("no_concl_hyp.source = refObj0.source")::where
92 let from = String.concat "," from in
93 let where = String.concat " and " where in
94 let query = "select refObj0.source from " ^ from ^ " where " ^ where in
95 (* prerr_endline query;*)
100 let rec powerset_r set sub =
101 if (NewConstraints.StringSet.is_empty set) then sub
103 let a = NewConstraints.StringSet.min_elt set in
104 let newset = NewConstraints.StringSet.remove a set in
105 let newsub = NewConstraints.SetSet.union (NewConstraints.SetSet.add (NewConstraints.StringSet.singleton a)
106 (NewConstraints.SetSet.fold
107 (fun s t -> (NewConstraints.SetSet.add (NewConstraints.StringSet.add a s) t))
108 sub NewConstraints.SetSet.empty)) sub in
109 powerset_r newset newsub in
110 powerset_r set NewConstraints.SetSet.empty
113 let setset_to_listlist setset =
114 let listset = NewConstraints.SetSet.elements setset in
118 let el = NewConstraints.StringSet.elements set in
119 (List.length el, el)) listset in
120 (* ordered by descending cardinality *)
121 List.sort (fun (n,_) (m,_) -> m - n) res
123 let exist_element list_of_uris (_,uri) =
128 List.exists ex list_of_uris
132 let filter_uris (conn:Mysql.dbd) const uris =
133 let subsets_of_consts =
134 setset_to_listlist (powerset const) in
140 exec_query conn s m in
142 match (Array.to_list a) with
144 | _ -> assert false in
148 List.filter (exist_element uris_of_const) uris
153 else n*(power n (m-1))