BoolTool

Home Research Teaching Members Events News

Syntax

x … variable (φ) … parenthesis !φ … negation φ₁ & φ₂ … conjunction φ₁ | φ₂ … disjunction φ₁ > φ₂ … implication φ₁ ^ φ₂ … exclusive or T … true F … false


              ! ⊐ & ⊐ + ⊐ ^ ⊐ >

Source code (Git)

BoolTool

Set of Formulas (, as separator):

About (click to show)

Info

This site is a web interface to the program BoolTool which allows the manipulation and evaluation of boolean functions. The tool supports different representations of boolean functions together with a variety of different algorithms.

JavaScript has to be enabled in the browser.

Usage

To process a formula, input it in the first text field and press enter or click the "Submit" button.

To compute whether a set of boolean functions is adequate (functionally complete) and to express a function using this set, input them comma separated in the second field.

The input formula is checked for satisfiability, whether it is a tautology or a contradiction, and the negation normal form (NNF), conjunctive normal form (CNF), disjunctive normal form (DNF), and algebraic normal form (ANF) are computed respectively. Furthermore the corresponding truth table and binary decision diagram (BDD) are displayed.