(** @return sorted list of theorem URIs, first URIs in the least have higher
* relevance *)
-val cmatch: dbh:Dbi.connection -> Cic.term -> string list
+val cmatch: dbd:Mysql.dbd -> ?facts:bool -> Cic.term -> string list
(** as cmatch, but returned list is not sorted but rather tagged with
* relevance information: higher the tag, higher the relevance *)
-val cmatch': dbh:Dbi.connection -> Cic.term -> (int * string) list
+val cmatch': dbd:Mysql.dbd -> ?facts:bool -> Cic.term -> (int * string) list
type where = [ `Conclusion | `Statement ] (** signature matching extent *)
(** @param where defaults to `Conclusion *)
val sigmatch:
- dbh:Dbi.connection ->
- ?where:where -> term_signature ->
+ dbd:Mysql.dbd ->
+ ?facts:bool ->
+ ?where:where ->
+ term_signature ->
(int * string) list
(** {2 Constraint engine} *)
* @param full_card cardinality condition on the whole statement
* @return list of URI satisfying given constraints *)
val at_least:
- dbh:Dbi.connection ->
+ dbd:Mysql.dbd ->
?concl_card:cardinality_condition ->
?full_card:cardinality_condition ->
MetadataTypes.constr list ->
(** @param where defaults to `Conclusion *)
val at_most:
- dbh:Dbi.connection ->
+ dbd:Mysql.dbd ->
?where:where -> StringSet.t ->
(string -> bool)