X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Fng_paramodulation%2Fterms.mli;h=d7f4b74e30c99792ce39c936d16d0a279cfe8c09;hb=40ce8d1c14808ea7608ee2988bd9aba77ddf8200;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..d7f4b74e3 100644 --- a/helm/software/components/ng_paramodulation/terms.mli +++ b/helm/software/components/ng_paramodulation/terms.mli @@ -21,11 +21,17 @@ type 'a substitution = (int * 'a foterm) list type comparison = Lt | Eq | Gt | Incomparable type rule = SuperpositionRight | SuperpositionLeft | 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,14 @@ 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 + val embed : t -> t foterm + (* saturate [proof] [type] -> [proof] * [type] *) + val saturate : t -> t -> t foterm * t foterm 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 eq_literal : B.t literal -> B.t literal -> bool - val compare_literal : B.t literal -> B.t literal -> int - - 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