Search Results for "boolean expression solver"

Java Quine McCluskey (JQM) implements the Quine-McCluskey algorithm with Petrick’s Method for minimizing Boolean functions. Designed for both education and industrial application, it handles up to 16 variables and functions. Uniquely, JQM bridges the gap between theory and practice: it visualizes the solution process with generated Karnaugh Maps for students, while supporting PLC engineers by exporting results to Structured Text (ST) and Ladder Diagram (LD). The software includes a GUI for...

This is yet another boolean expression evaluator written in C/C++ with AND/XOR Sum-of-Product outputs. This is useful for projects that require heavy use of arithmetic functions, or multiplexors, where the XOR function dominates the logic expressions. There is also a similar tool with AND/OR/NOT output.

expressionCalc is a Mathematical expression solver. It has a Java implementation (for cross platform) and a C# implementation (for Windows). Support most of the Mathematical functions including log, sin, a sin etc. Implemented based on the expression solving technique of BODMAS.

ExpressionOasis is a java based framework for evaluating the various type of expressions like arithmatic, logic expression etc. The framework is flexible enough to define any new grammer rules or operators.

Expression Solver computes the value of a mathematical equation/expression. Works with operators, numbers, variables, and functions. Users can define their own variables and functions. hosted: http://github.com/matcatc/Expression-Solver

rutc is a calculator and expression solver for real and complex numbers. Besides the usual mathematical operations, it also offers user-defined functions, a statistical mode, input and output in several bases and also a linear equation solver.

Boolean Expression Solver is a command-line utility that generates a truth table for a given Boolean expression.

The Boolean Expression Reducer provides the user with various tools to visualize and analyze boolean expressions. Given an expression, it also reduces it to its Sum of Products and Product of Sums form.