module Consolidation_tree:sig
..end
type 'a
value = private {
|
value : |
|
hypothesis : |
|
dependencies : |
type
t = private {
|
property : |
|
state : |
|
mutable status : |
typeforest =
t list
val get_all : unit -> forest
val get : Property.t -> t
type
vertex =
| |
Property of |
| |
State of |
| |
Status of |
val state_of_vertex : vertex -> State.t
type
edge =
| |
And |
| |
Or |
module G:Graph.Sig.G
with type V.t = vertex and type E.label = edge and type E.t = vertex * edge * vertex
val get_full_graph : unit -> G.t
val get_graph : Property.t -> G.t
val dump : G.t -> string -> unit