A Solver for Propositional Logic using a technique called Semantic Tableaux. This works by converting a propositional phrase into disjunction normal form and then constructing a tree based on satisfiability.
Key featurse include :-
- Truth Table generation
- Parse Tree
- PDF containing all elements that are generated (parse tree, semantic proof and truth table)
- Ability to stop the search once a solution is found during the semantic proof finder