parameter sintax added to axiom statement

[helm.git] / helm / software / components / ng_paramodulation / index.ml

diff --git a/helm/software/components/ng_paramodulation/index.ml b/helm/software/components/ng_paramodulation/index.ml
index 3c203d3a7131e7ce1d2411f950975a29c19d9753..36c9dd75e693ec51cf5e168995563113c2b92f66 100644 (file)
--- a/helm/software/components/ng_paramodulation/index.ml
+++ b/helm/software/components/ng_paramodulation/index.ml
@@ -11,8 +11,10 @@
 
 (* $Id$ *)
 
-module Index(B : Terms.Blob) = struct
+module Index(B : Orderings.Blob) = struct
   module U = FoUtils.Utils(B)
+  module Unif = FoUnif.Founif(B)
+  module Pp = Pp.Pp(B)
 
   module ClauseOT =
     struct 
@@ -42,10 +44,10 @@ module Index(B : Terms.Blob) = struct
       let path_string_of =
         let rec aux arity = function
           | Terms.Leaf a -> [Constant (a, arity)]
-          | Terms.Var i -> assert (arity = 0); [Variable]
+          | Terms.Var i -> (* assert (arity = 0); *) [Variable]
+         (* FIXME : should this be allowed or not ? 
           | Terms.Node (Terms.Var _::_) ->
-             (* FIXME : should this be allowed or not ? *)
-             assert false
+             assert false *)
           | Terms.Node ([] | [ _ ] ) -> assert false
           | Terms.Node (Terms.Node _::_) -> assert false             
           | Terms.Node (hd::tl) ->
@@ -78,21 +80,34 @@ module Index(B : Terms.Blob) = struct
       type data = ClauseSet.elt and 
       type dataset = ClauseSet.t
     = Make(FotermIndexable)(ClauseSet)
-
-  let index_unit_clause t = function
+  
+  let process op t = function
     | (_,Terms.Equation (l,_,_,Terms.Gt),_,_) as c -> 
-          DT.index t l (Terms.Left2Right, c)
+        op t l (Terms.Left2Right, c)
     | (_,Terms.Equation (_,r,_,Terms.Lt),_,_) as c -> 
-          DT.index t r (Terms.Right2Left, c)
-    | (_,Terms.Equation (l,r,_,Terms.Incomparable),_,_) as c ->  
-          DT.index  
-           (DT.index t l (Terms.Left2Right, c))
-           r (Terms.Right2Left, c)
+        op t r (Terms.Right2Left, c)
+    | (_,Terms.Equation (l,r,_,Terms.Incomparable),vl,_) as c ->
+        op (op t l (Terms.Left2Right, c))
+          r (Terms.Right2Left, c)
+    | (_,Terms.Equation (l,r,_,Terms.Invertible),vl,_) as c ->
+       op t l (Terms.Left2Right, c)
     | (_,Terms.Equation (_,r,_,Terms.Eq),_,_)  -> assert false
     | (_,Terms.Predicate p,_,_) as c ->
-          DT.index t p (Terms.Nodir, c)
+        op t p (Terms.Nodir, c)
   ;;
 
+  let index_unit_clause = 
+    process DT.index 
+ 
+  let remove_unit_clause =
+    process DT.remove_index 
+
+  let fold = DT.fold 
+
+  let elems index =
+    DT.fold index (fun _ dataset acc -> ClauseSet.union dataset acc)
+      ClauseSet.empty
+    
   type active_set = B.t Terms.unit_clause list * DT.t
 
 end