Index of modules


B
Backend_intf
Backend interface

D
Dedukti
Deduki backend for proofs
Dot
Dot backend for proofs
DummyTheory [Solver]
Simple case where the theory is empty and the proof type is the one given in the formula interface

E
Expr [Sat]
The module defining formulas
Expr_intf
Mcsat expressions
External
mSAT safe interface

F
Formula [Expr_intf.S]
Formula_intf
SMT formulas

I
Internal
mSAT core

L
Log
Logging function, for debugging

M
Make [Sat]
A functor that can generate as many solvers as needed.
Make [Dedukti]
Functor to generate a backend to output proofs for the dedukti type checker.
Make [Dot]
Functor for making a module to export proofs to the DOT format.
Make [Tseitin]
This functor provides an implementation of Tseitin's CNF conversion.
Make [Mcsolver]
Functor to create a solver parametrised by the atomic formulas and a theory.
Make [Solver]
Functor to create a SMT Solver parametrised by the atomic formulas and a theory.
Make [External]
Functor to make a safe external interface.
Make [Internal]
Make [Res]
Functor to create a module building proofs from a sat-solver unsat trace.
McMake [Solver_types]
Functor to instantiate the types of clauses for a solver.
Mcsolver
Create McSat solver

P
Plugin_intf
McSat Theory
Proof [Internal.Make]
Proof [Solver_intf.S]
A module to manipulate proofs.

R
Res
Resolution proofs
Res_intf
Interface for proofs

S
Sat
Sat solver
SatMake [Solver_types]
Functor to instantiate the types of clauses for a solver.
Solver
Create SAT/SMT Solvers
Solver_intf
Interface for Solvers
Solver_types
Internal types (implementation)
Solver_types_intf
Internal types (interface)
St [Solver_intf.S]
WARNING: Very dangerous module that expose the internal representation used by the solver.
St [Res_intf.S]
Module defining atom and clauses

T
Term [Expr_intf.S]
Theory_intf
SMT Theory
Tseitin
Tseitin CNF conversion
Tseitin_intf
Interfaces for Tseitin's CNF conversion