Module Msat_sat.Int_litSource

The module defining formulas

SAT Formulas

This modules implements formuals adequate for use in a pure SAT Solver. Atomic formuals are represented using integers, that should allow near optimal efficiency (both in terms of space and time).

This modules implements the requirements for implementing an SAT Solver.

include Msat.Solver_intf.FORMULA
Sourcetype t

The type of atomic formulas over terms.

Sourceval equal : t -> t -> bool

Equality over formulas.

Sourceval 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.

Sourceval neg : t -> t

Formula negation

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.

Sourceval make : int -> t

Make a proposition from an integer.

Sourceval to_int : t -> int
Sourceval fresh : unit -> t

Make a fresh atom

Sourceval compare : t -> t -> int

Compare atoms

Sourceval sign : t -> bool

Is the given atom positive ?

Sourceval apply_sign : bool -> t -> t

apply_sign b is the identity if b is true, and the negation function if b is false.

Sourceval set_sign : bool -> t -> t

Return the atom with the sign set.