X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Fng_paramodulation%2Fterms.mli;h=93f106a4f1c9e8c8464a1582a13d6d0a4c79d6c8;hb=1bcb1921390d24e02d716614648e749bac6f5933;hp=c16b6f9b7212dd564aa07c67b4a39a1ee8eb86e6;hpb=6b0a195b180e3526af7b55771b2df7b10acd7c30;p=helm.git diff --git a/helm/software/components/ng_paramodulation/terms.mli b/helm/software/components/ng_paramodulation/terms.mli index c16b6f9b7..93f106a4f 100644 --- a/helm/software/components/ng_paramodulation/terms.mli +++ b/helm/software/components/ng_paramodulation/terms.mli @@ -18,10 +18,13 @@ type 'a foterm = type 'a substitution = (int * 'a foterm) list -type comparison = Lt | Eq | Gt | Incomparable +type comparison = Lt | Eq | Gt | Incomparable | Invertible -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 = @@ -49,9 +52,27 @@ type 'a unit_clause = type 'a passive_clause = int * 'a unit_clause (* weight * equation *) +val is_eq_clause : 'a unit_clause -> bool +val vars_of_term : 'a foterm -> int list + module M : Map.S with type key = int -type 'a bag = 'a unit_clause M.t +type 'a bag = int (* max ID *) + * (('a unit_clause * bool * int) M.t) + +(* also gives a fresh ID to the clause *) + val add_to_bag : + 'a unit_clause -> 'a bag -> + 'a bag * 'a unit_clause + + val replace_in_bag : + 'a unit_clause * bool * int -> 'a bag -> + 'a bag + + val get_from_bag : + int -> 'a bag -> 'a unit_clause * bool * int + + val empty_bag : 'a bag module type Blob = sig @@ -62,14 +83,17 @@ module type Blob = type t val eq : t -> t -> bool val compare : t -> t -> int - val is_eq_predicate : t -> bool + val eqP : t (* TODO: consider taking in input an imperative buffer for Format * val pp : Format.formatter -> t -> unit * *) + val is_eq : t foterm -> (t foterm * t foterm * t foterm) option val pp : t -> string - val embed : t -> t foterm + type input + val embed : input -> t foterm (* saturate [proof] [type] -> [proof] * [type] *) - val saturate : t -> t -> t foterm * t foterm + val saturate : input -> input -> t foterm * t foterm + end