X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Fng_paramodulation%2Fterms.mli;h=f1eacb7346ae998bdb7e7ba8afe8da46e410cd69;hb=10a9a8c36ff36e6a53bda1ec3074cb2fac03da63;hp=47c2c6e40cda4e49e1bbb037c72aa8080c0fba39;hpb=b97a7976503b2d2e5cbc9199f848135a324775a8;p=helm.git

diff --git a/helm/software/components/ng_paramodulation/terms.mli b/helm/software/components/ng_paramodulation/terms.mli
index 47c2c6e40..f1eacb734 100644
--- a/helm/software/components/ng_paramodulation/terms.mli
+++ b/helm/software/components/ng_paramodulation/terms.mli
@@ -20,12 +20,18 @@ type 'a substitution = (int * 'a foterm) list
 
 type comparison = Lt | Eq | Gt | Incomparable
 
-type rule = SuperpositionRight | SuperpositionLeft | Demodulation
+type rule = Superposition | Demodulation
+
+(* A Discrimination tree is a map: foterm |-> (dir, clause) *)
 type direction = Left2Right | Right2Left | Nodir
+
 type position = int list
 
 type 'a proof =
-  | Exact of 'a
+  | Exact of 'a foterm
+         (* for theorems like T : \forall x. C[x] = D[x] the proof is 
+          * a foterm like (Node [ Leaf T ; Var i ]), while for the Goal
+          * it is just (Var g), i.e. the identity proof *)
   | Step of rule * int * int * direction * position * 'a substitution
          (* rule, eq1, eq2, direction of eq2, position, substitution *)
 
@@ -48,7 +54,7 @@ type 'a passive_clause = int * 'a unit_clause (* weight * equation *)
 
 module M : Map.S with type key = int 
 
-type 'a bag = 'a unit_clause M.t
+type 'a bag = 'a unit_clause M.t 
 
 module type Blob =
   sig
@@ -59,22 +65,17 @@ module type Blob =
     type t
     val eq : t -> t -> bool
     val compare : t -> t -> int
+    val eqP : t
     (* TODO: consider taking in input an imperative buffer for Format 
      *  val pp : Format.formatter -> t -> unit
      * *)
     val pp : t -> string
 
-    val embed : t -> t foterm * int list
-  end
-
-module Utils (B : Blob) :
-  sig
-    val eq_foterm : B.t foterm -> B.t foterm -> bool
-    val compare_foterm : B.t foterm -> B.t foterm -> int
+    val embed : t -> t foterm 
+    (* saturate [proof] [type] -> [proof] * [type] *)
+    val saturate : t -> t -> t foterm * t foterm
 
-    val eq_literal : B.t literal -> B.t literal -> bool
-    val compare_literal : B.t literal -> B.t literal -> int
+    val mk_proof : t bag -> int -> int list -> t
 
-    val eq_unit_clause : B.t unit_clause -> B.t unit_clause -> bool
-    val compare_unit_clause : B.t unit_clause -> B.t unit_clause -> int
   end
+