simon/sidekick
1
0
Fork 0
mirror of https://github.com/c-cube/sidekick.git synced 2025-12-06 11:15:43 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

Better doc for theory interface

Browse source
This commit is contained in:
Guillaume Bury 2014-11-12 21:29:15 +01:00
parent 752fcbe2ba
commit ec32a67e54
1 changed files with 11 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
sat/theory_intf.ml
View file

@ -27,6 +27,11 @@ module type S = sig
get : int -> formula; get : int -> formula;
push : formula -> formula list -> proof -> unit; push : formula -> formula list -> proof -> unit;
} }
(** The type for a slice of litterals to assume/propagate in the theory.
[get] operations should only be used for integers [ start <= i < start + length].
The semantic for push is the following :
[push f \[a1; a2;... ; an\] p] shoudl be so that p is a proof of
a1 /\ a2 /\ ... /\ an => f. *)
type level type level
(** The type for levels to allow backtracking. *) (** The type for levels to allow backtracking. *)
@ -34,9 +39,10 @@ module type S = sig
type res = type res =
| Sat of level | Sat of level
| Unsat of formula list * proof | Unsat of formula list * proof
(** Type returned by the theory, either the current set of assumptions is satisfiable, (** Type returned by the theory, either the current set of assumptions is satisfiable,
or it is not, in which case an unsatisfiable clause (hopefully minimal) is returned. or it is not, in which case a tautological clause (hopefully minimal) is returned.
Formulas in the unsat clause must come from the current set of assumptions. *) Formulas in the unsat clause must come from the current set of assumptions, i.e
must have been encountered in a slice. *)
val dummy : level val dummy : level
(** A dummy level. *) (** A dummy level. *)
@ -47,10 +53,10 @@ module type S = sig
val assume : slice -> res val assume : slice -> res
(** Assume the formulas in the slice, possibly pushing new formulas to be propagated, (** Assume the formulas in the slice, possibly pushing new formulas to be propagated,
and returns the new level of the theory. *) and returns the result of the new assumptions. *)
val backtrack : level -> unit val backtrack : level -> unit
(** Backtrack to the given level (excluded). After a call to [backtrack l], the theory should be in the (** Backtrack to the given level. After a call to [backtrack l], the theory should be in the
same state as when it returned the value [l], *) same state as when it returned the value [l], *)
end end