Skip to content

Commit

Permalink
Review changes
Browse files Browse the repository at this point in the history
  • Loading branch information
Halbaroth committed Jan 3, 2024
1 parent 1cd1fbe commit e5c81f1
Show file tree
Hide file tree
Showing 2 changed files with 12 additions and 4 deletions.
8 changes: 6 additions & 2 deletions src/lib/reasoners/sat_solver_sig.ml
Original file line number Diff line number Diff line change
Expand Up @@ -110,13 +110,17 @@ module type S = sig
(** [optimize env ~is_max o] registers the expression [o] as an objective
function.
The solver will try to maximize [o] if [is_max] is [true]. Otherwise,
it will try to minimize it.
After optimization, the value of this objective is returned by
[get_objectives]. *)

val unsat : t -> Expr.gformula -> Explanation.t
(** [unsat env f size] checks the unsatisfiability of [f] in [env].
(** [unsat env f] checks the unsatisfiability of [f] in [env].
@raise I_dont_know when the proof tree's height reaches [size].
@raise I_dont_know if the solver cannot prove the unsatisfiability
of [env].
@raise Sat if [f] is satisfiable in [env]. *)

val reset_refs : unit -> unit
Expand Down
8 changes: 6 additions & 2 deletions src/lib/reasoners/sat_solver_sig.mli
Original file line number Diff line number Diff line change
Expand Up @@ -90,13 +90,17 @@ module type S = sig
(** [optimize env ~is_max o] registers the expression [o] as an objective
function.
The solver will try to maximize [o] if [is_max] is [true]. Otherwise,
it will try to minimize it.
After optimization, the value of this objective is returned by
[get_objectives]. *)

val unsat : t -> Expr.gformula -> Explanation.t
(** [unsat env f size] checks the unsatisfiability of [f] in [env].
(** [unsat env f] checks the unsatisfiability of [f] in [env].
@raise I_dont_know when the proof tree's height reaches [size].
@raise I_dont_know if the solver cannot prove the unsatisfiability
of [env].
@raise Sat if [f] is satisfiable in [env]. *)

val reset_refs : unit -> unit
Expand Down

0 comments on commit e5c81f1

Please sign in to comment.