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.8.tar.gz

md5=fe2f507bff99166ad2004786ca1ae59b

sha512=4cd653218e1767152c1d66700ccfc421d6d2da6ddffc8af4ee9151a3b5d25920f9d735a416f962227ffe458bb56e1f1977d180dd91415d37af9e1ea41dbb1045

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

Parameter `Simple.A`

Term printing for DOT

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

type hyp = S.formula list

type assumption = S.formula

The type of theory-specifi proofs (also called lemmas).

val print_atom : Format.formatter -> S.formula -> 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 : 
  hyp ->
  string * string option * (Format.formatter -> unit -> unit) list

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

val assumption_info : 
  assumption ->
  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