package msat

  1. Overview
  2. Docs
Library containing a SAT solver that can be parametrized by a theory

Install

Dune Dependency

Authors

Maintainers

Sources

v0.8.1.tar.gz
md5=70159e4db67c5b3118fd765c478ffac8
sha512=dc92ad406270bac92caf9451bfeef6e396f0fed3af7cab102c6d2d2e09cc256cbbf728c2025e1cf6d9662a3eb0425aad75fe7f41d9413dccf1d520b38f964ef1

doc/msat.backend/Msat_backend/Dedukti/Make/argument-1-S/Formula/index.html

Module S.Formula

formulas

type t

The type of atomic formulas over terms.

val equal : t -> t -> bool

Equality over 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.

Printing function used among other thing for debugging.

val neg : t -> t

Formula negation

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.

OCaml

Innovation. Community. Security.