package msat

You can search for identifiers within the package.

in-package search v0.2.0

Library containing a SAT solver that can be parametrized by a theory

Install

Dune Dependency

github.com Readme Changelog Edit opam file Versions (16)

Authors

Maintainers

Sources

v0.9.tar.gz

md5=8ee967a889188d8d937e3c1ca2c50deb

sha512=5185e02f2f41a3672afaf64b47ddf6efd787811a73f0286a670a64783a86a9c422c4a874c48884622961354105283b60223562025f1fa21edba67f0eb8cb172b

doc/msat.backend/Msat_backend/Dot/Make/argument-2-A/index.html

Parameter `Make.A`

Term printing for DOT

This module defines what functions are required in order to export a proof to the DOT format.

val print_atom : Format.formatter -> S.atom -> unit

Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on).

val hyp_info : 
  S.clause ->
  string * string option * (Format.formatter -> unit -> unit) list

val lemma_info : 
  S.clause ->
  string * string option * (Format.formatter -> unit -> unit) list

val assumption_info : 
  S.clause ->
  string * string option * (Format.formatter -> unit -> unit) list

Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet (rule, color, l), such that:

rule is a name for the proof (arbitrary, does not need to be unique, but should rather be descriptive)
color is a color name (optional) understood by DOT
l is a list of printers that will be called to print some additional information