package msat
Library containing a SAT solver that can be parametrized by a theory
Install
Dune Dependency
Authors
Maintainers
Sources
v0.8.2.tar.gz
md5=c02d63bf45357aa1d1b85846da373f48
sha512=e6f0d7f6e4fe69938ec2cc3233b0cb72dd577bfb4cc4824afe8247f5db0b6ffea2d38d73a65e7ede500d21ff8db27ed12f2c4f3245df4451d02864260ae2ddaf
doc/msat.backend/Msat_backend/Coq/Make/argument-1-S/Formula/index.html
Module S.Formula
formulas
val hash : t -> int
Hashing function for formulas. Should be such that two formulas equal according to Expr_intf.S.equal
have the same hash.
val pp : t Msat.Solver_intf.printer
Printing function used among other thing for debugging.
val norm : t -> t * Msat.Solver_intf.negated
Returns a 'normalized' form of the formula, possibly negated (in which case return Negated
). norm
must be so that a
and neg a
normalise to the same formula, but one returns Negated
and the other Same_sign
.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>