package mc2
A mcsat-based SMT solver in pure OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
v0.1.tar.gz
md5=92de696251ec76fbf3eba6ee917fd80f
sha512=e88ba0cfc23186570a52172a0bd7c56053273941eaf3cda0b80fb6752e05d1b75986b01a4e4d46d9711124318e57cba1cd92d302e81d34f9f1ae8b49f39114f0
doc/mc2.propositional/Mc2_propositional/F/index.html
Module Mc2_propositional.F
Source
Formulas
Source
and view =
| True
| Lit of Mc2_core.atom
| Comb of combinator * t list
(*The type of arbitrary boolean formulas. Arbitrary boolean formulas can be built using functions in this module, and then converted to a CNF, which is a list of clauses that only use atomic formulas.
*)
atom p
builds the boolean formula equivalent to the atomic formula p
.
Creates the conjunction of a list of formulas. An empty conjunction is always satisfied.
Creates the disjunction of a list of formulas. An empty disjunction is never satisfied.
cnf f
returns a conjunctive normal form of f
under the form: a list (which is a conjunction) of lists (which are disjunctions) of atomic formulas.
pp fmt f
prints the formula on the formatter fmt
.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>