重构布尔表达式的工具 [英] Tool to refactor boolean expressions

问题描述

我正在寻找一种重构布尔表达式的工具.我有类似的表情

I'm looking for a tool to refactor boolean expression. I've got expressions like

a1 => (b1 <=> c or d) AND 
a2 => (b2 <=> c or d) AND
a2 => (b2 <=> c or d) 

该工具应该能够简化表达式，例如在上面的示例中提取子表达式"c或d".有免费的计算机代数系统可以做到这一点吗?

The tool should be able to simplify expressions, e.g. extract the sub expression "c or d" in the example above. Is there a free computer algebra system which can do this?

目前，我认为手动重构表达式可以通过使用一些haskell快速检查脚本来证明其等效性.

Currently I think of refactoring the expressions manually an prove the equivalence with a little haskell quickcheck script.

推荐答案

布尔值重构和简化

此工具非常适合优化复杂的布尔表达式.

This tool worked great for optimising complex boolean expressions.

这篇关于重构布尔表达式的工具的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！