Simple algorithms for converting and solving propositional formulas: easy to hack and experiment with.
JavaScript HTML CSS
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
README.md
about.html
closurecompiler.txt
download.html
index.html
logo.png
predicate.html
proplog.html
proplog_convert.js
proplog_dpll.js
proplog_generate.js
proplog_min.js
proplog_naivedpll.js
proplog_naiveres.js
proplog_olddpll.js
proplog_parse.js
proplog_res.js
proplog_searchtable.js
proplog_ui.js
propositional.html
sitemap.txt
wdb.css

README.md

logictools

We help to study logic solvers by providing and collecting various easy-to-use, browser-based javascript tools: starting with classical propositional formulas and continuing with predicate logic later.

All the code is self-contained, no-dependencies, easy-to-hack javascript under the MIT licence.

The focus is on simplicity, ease of use, hacking and experimenting, not state of the art efficiency-wise.

Help and cooperation appreciated for improving the current code, writing and proposing new tools, etc. See the site with functioning code.

Site, initial solvers and utilities written by Tanel Tammet (tanel.tammet at gmail.com)

User interface for trying out all the functions:

Solvers for experimenting with different algorithms are self-contained:

Utilities are also self-contained: