touist.3.2.1 - via opam-publish #9612
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The solver for the Touist language
The Touist language is a friendly language for writing propositional
logic (SAT), logic on real and integers (SMT) and quantified boolean
formulas (QBF). This language aims to formalize real-life problems
(e.g., the sudoku can be solved in a few lines). Touist embeds a SAT
solver (minisat) and can be built with optionnal SMT and QBF solvers.
Touist is also able to generate the latex, DIMACS, SMT-LIB and QDIMACS
formats from a touist file.
Optionnal solvers:
opam install yices2and then doopam reinstall touistopam install qbfand then doopam reinstall touistPull-request generated by opam-publish v0.3.4