-
Notifications
You must be signed in to change notification settings - Fork 5
Fork of the Limboole SAT solver frontend from http://fmv.jku.at/limboole/ modified to be executable using WebAssembly on the web.
License
maximaximal/limboole
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
Overview -------- This is a simple boolean calculator. It reads a boolean formula and checks whether it is valid. In case '-s' is specified satisfiability is checked instead of validity (tautology). Language -------- The input format has the following syntax in BNF: ( [ ... ] means optional, { ... } means repeated arbitrary many times) expr ::= iff iff ::= implies { '<->' implies } implies ::= or [ '->' or | '<-' or ] or ::= and { '|' and } and ::= not { '&' not } not ::= basic | '!' not basic ::= var | '(' expr ')' and 'var' is a string over letters, digits and the following characters: - _ . [ ] $ @ The last character of 'var' should be different from '-'. Armin Biere, Johannes Kepler University, Thu Nov 22 15:47:00 CET 2012
About
Fork of the Limboole SAT solver frontend from http://fmv.jku.at/limboole/ modified to be executable using WebAssembly on the web.
Topics
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published