布尔前pression求解器/控制简化 [英] Boolean expression solver/simplifier

问题描述

我要寻找一个布尔前pression解算器非常大的（但并不复杂）代数，如：
BoolscheAusdrückevereinfachen（AXIOME）
我想有一些code（C ++或Java [或库]）来简化庞大的布尔前pression。我haven't发现了什么。我只想做一些简单的皈依这样的：

I am looking for an Boolean expression solver for very big (but not complex) algebra like: Boolsche Ausdrücke vereinfachen (Axiome) I would like to have some code (c++ or java [or libraries]) to simplify huge boolean expression. I haven´t found something. I just want to do some "simply" convertion like:

a && ~a -> 0

a || a && (b || c) -> a

但更长的时间。我想用符号（A，B，C1，D1 ..）不是真的，FALSE，0或1的时刻。
谢谢你在前进。

But much longer. And I want to use symbolics (a, b, c1, d1..) not TRUE, FALSE, 0 or 1 at the moment. Thank you in advance.

编辑：
如果我把它写我自己，我可以用Javaluator和评估。
当我有：（ADB + C）及和放大器; ð我想先乘出来。任何人的想法？

If I write it my self, I could use Javaluator and evaluate. When I have: (adb+c) && d I would like to start with multiply out. Anyone an idea?

推荐答案

我最喜欢的此类任务的工具是逻辑周五1 。
它是免费的非商业用途。

My favorite tool for such tasks is Logic Friday 1. It is free for non-commercial use.

逻辑星期五可进行1接受布尔前pressions的公式和真值表。它包括编译的伯克利工具居preSSO 并misII二进制文件。被用于多级的功能，后者

Logic Friday 1 accepts Boolean expressions as formula and as truth table. It includes compiled binaries of Berkeley tools Espresso and misII. The latter is being used for multi-level functions.

另一个工具是 bc2cnf 。它读取一个布尔值前pression（或一组前pressions的）作为电路，并将其转换为的合取范式的（CNF），基本上产品或-EX pressions。 bc2cnf这个翻译过程中，将一些简化的规则。对于中等规模的前pressions这将是对CNF转换的选项的析取范式的（DNF）并使用长者preSSO获得一个最小化的形式。

Another tool is bc2cnf. It reads a boolean expression (or a set of expressions) as a "circuit" and translates it to conjunctive normal form (CNF), basically a product of OR-expressions. bc2cnf applies some simplification rules during this translation. For expressions of modest size it would be an option to convert the CNF to disjunctive normal form (DNF) and use Espresso to get a minimized form.

这篇关于布尔前pression求解器/控制简化的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！