Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up

Fork of the Limboole SAT solver frontend fromhttp://fmv.jku.at/limboole/ modified to be executable using WebAssembly on the web.

License

NotificationsYou must be signed in to change notification settings

maximaximal/limboole

Repository files navigation

Overview--------This is a simple boolean calculator.  It reads a boolean formula and checkswhether it is valid.  In case '-s' is specified satisfiability is checkedinstead 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

[8]ページ先頭

©2009-2025 Movatter.jp