Search Results for "boolean expression simplifier"
Sort By:
Showing 25 open source projects for "boolean expression simplifier"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
YARA
The pattern matching swiss knife for malware researchers
...With YARA you can create descriptions of malware families (or whatever you want to describe) based on textual or binary patterns. Each description, a.k.a rule, consists of a set of strings and a boolean expression which determines its logic. YARA is multi-platform, running on Windows, Linux and Mac OS X, and can be used through its command-line interface or from your own Python scripts with the yara-python extension. YARA-CI may be a useful addition to your toolbelt. This is GitHub application that provides continuous testing for your rules, helping you to identify common mistakes and false positives. ... -
2
AQL
Advanced Query Language
The clauses are beginning from "([{" and ending by "}])" and are separated by ",;" There are three basic types like Boolean (true, false), numeric and string in "'\"" List of operators: Name Description << Output ? Logical if @ Loop ?$ Returns true if variable defined ?| Logical or ?& Logical and ?! Logical negation ?/ Logical regular expression matches /- Split string by regular expression /+ Replace by regular expression // All matches = Assignment + Addition or concatenation - Subtraction / Division * Multiplication -
3
Bible SuperSearch
Web-Based Bible Search Engine
Advanced web-based Bible passage lookup and search script. Search entire Bible or only within the specified reference(s). Keeps users on your website and does not send them to our website. Install our API and run completely on your website! Full Boolean search with parentheses, proximity search. Look up multiple passages, parallel Bibles. Bible downloads also available: * PDF * Plain Text * MySQL dumps * JSON *... -
4
JQM Java Quine McCluskey
JQM - Java Quine McCluskey for minimization of Boolean functions.
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... -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
5
GENET-CNV
Integrated DNA copy number variation and gene expression analysis
The Boolean implication networks outperformed Bayesian networks, Pearson’s correlation networks, and other Boolean networks in constructing genome-scale co-expression networks evaluated with comprehensive biological pathways and Gene Ontology in MSigDB. References: Guo NL, Wan YW. Pathway-based identification of a smoking associated 6-gene signature predictive of lung cancer risk and survival. -
6
Advance-PCT-1.0
A novel Code transformation technique to guide test input generator
Advance_PCT is a pre-processing technique, that simplifies the complex boolean expression present in a C program. It identifies the boolean expression and creates equivalent conditional branches with an empty body. These additional statements along with original program supplied into test executor to improve test data. It ensures that each atomic conditions have been invoked at least once true and once false. -
7
BoolCalc
Boolean Expression Evaluator with AND/XOR minimization
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. -
8
Frndz Boolean Expression Simplifier
Boolean Expression Simplifier developed by Mayank Shekhar
This application simplifies a boolean expression to its simplest form. User can enter MAX value or MIN value and can get the result in SOP or POS form correspondingly. -
9
Data Types: String: VALOR[t,...] Number: VALOR[n,...] Boolean: VALOR[b,...] DateTime: VALOR[dt,...] (yyyy-MM-dd) ArrayDateTime: VALOR[ad,...;...;...] (yyyy-MM-dd) ArrayNumeric: VALOR[an,...;...;...] String: VALOR[at,...;...;...] Variable: Boolean: @ParameterName@ DateTime: @ParameterName@ Number: @ParameterName@ String: @ParameterName@ Array: @ParameterName@ Comp Operation: Equals: [=] Not Equals: [<>] Greater Than: [>] Greater Equals Than: [>=] Less...
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
10
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.
-
11
KS Boolean Expression is free software that let you minimize Boolean Expressions.
-
12
Math expression parser and evaluator written in Scala. Usable from Java (Sun JRE 1.6) Provides float, integral, boolean and vector data types, some string processing support. Variables may be defined internally or im- and exported through a binding.
-
13
Quine-McCluskey boolean logic simplifier implemented in C++. It allows simplifying up to 32 variable input functions, including don't-care values. The program was written for digital design classes at the Poznan University of Technology (Poland).
-
14
nsL is a new C-like programming language for writing NSIS installation wizards (http://nsis.sourceforge.net). The nsL assembler takes nsL code and translates it into original NSIS script which can then be compiled.
-
15
Allows users to search your database-driven (MySQL) website. Includes boolean search, and regular expression search. Completely recoded in PHP 5 OOP and XHTML.
-
16
A powerful and easy expression language for use in Java desktop and web applications. Example of string parsing: "Hallo Mr. {:name}, {:vname}. This is your number: {%mathMax {'0.3'},{'0.4'},{%mathRandom}, {'0.5'}}"
-
17
An Expression Parser and Evaluator result in JSON object. Written in Pascal. 表达式的解析和求值是一个应用面非常广的功能。JSON格式因其简明、易于操作，使用面日渐广泛。本项目将表达式分析的结果存放在JS
-
18
The Java Boolean Expression Library (JBEL) enhances the Java Collections API by implementing on-the-fly sorting, filtering and reasoning capabilities including, select(), collect(), reject(), detect(), doForEach() using functional programming techniques.
-
19
Boolean Expression Solver is a command-line utility that generates a truth table for a given Boolean expression.
-
20
biml is a Boolean calculator Implemented in Many Languages. The goal is to have a simple calculator that takes a boolean expression and returns a truth table in a large number of languages, written by many people.
-
21
The Quine McCluskey Simplifier(qmcs) is a tool used to simplify a boolean function. With the input of binary/decimal data the program calculates the prime implicants, which are then used to calculate the essential prime implicants.
-
22
JBooleanExpression is a simple Java API to evaluate a Boolean String Expression like "!true&&false||true" (parse a Boolean String Expression to a boolean primitive type)
-
23
nobel is small ANSI C written, OS independent boolean expression parsing library and program, aimed for projects that need boolean expression parsing support built-in and bigger tools present overkill in size or options.
-
24
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.
-
25
BEEJ is a Boolean Expression Editor for Java. This library provides a GUI interface to build complex (or simple) expressions with your options as a base component.
- Previous
- You're on page 1
- Next