enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

2. Any good boolean expression simplifiers out there? [closed]

   stackoverflow.com/questions/14902141

   Anyway, I was wondering if any of you know of a good online simplifier I can use. I'm not interested in any specific language, just a simplifier that would take in for example: ((A OR B) AND (!B AND C) OR C) And give me a simplified version of the expression, if any. I've looked at the other similar questions but none point me to a good simplifier.

3. Simplify boolean expression algorithm - Stack Overflow

   stackoverflow.com/questions/5311099

   I remember the boolean algebra and Karnaught maps, but this is meant for digital hardware where EVERITHING is boolean. I would like something that takes into account that some sub-expressions are not boolean. For example: a == 1 && a == 3 this could be translated to a pure boolean expression: a1 && a3

4. java - Boolean expression solver/simplifier - Stack Overflow

   stackoverflow.com/questions/13546791

   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.

5. Steps to simplify a Boolean Expression - Mathematics Stack...

   math.stackexchange.com/questions/507262

   How to simplify boolean expression. 0. boolean algebra, simplify going wrong! 1.

6. How to simplify these boolean statements - Stack Overflow

   stackoverflow.com/questions/52416781

   Python:How to simplify a long boolean expression? 4. Simplify logic statement. 0.

7. How to simplify boolean expression - Mathematics Stack Exchange

   math.stackexchange.com/questions/1911407/how-to-simplify-boolean-expression

   Can someone show me step by step how to simplify this boolean expression? I would like to learn how to handle this kind of simplifications: $$ Y = \neg(D \wedge\neg E) \vee (\neg E \wedge D ) $$ I can apply boolean laws for the first steps, that should be: De Morgan's law : $\neg D \vee \neg\neg E \vee (\neg E \wedge D)$

8. Simplifying Boolean Expression with steps - Stack Overflow

   stackoverflow.com/questions/64685991

   First let's make an agreement of the notation used in expression A'B'C'+A'B'C+A'BC+AB'C+ABC:. Notation Bool operation Priority CPU instruction ' behind Bool variable negation highest NEG two adjacent variables logical AND high AND + between two variables logical OR low OR ( ) priority of oper.

9. c# - Boolean Algebra Expression Factorisation - Stack Overflow

   stackoverflow.com/questions/54680280

   I am creating a Boolean algebra simplifier in C# for a project. To simplify Boolean algebraic expressions, I am taking the following approach: 1)Simplify the NOTs over each variable and apply De Morgan's Law where applicable. 2)Simplify the brackets, if there are any, within the expression

10. How to simplify Boolean expression with XOR? - Stack Overflow

    stackoverflow.com/questions/11028688

    I want to simplify a boolean Expression. The Expression is something like this. X1 xor (X2 || X3 && X4 || x5) How do I simplify this expression using rules of Boolean Algebra. Moreover I want to convert the above boolean expression to a CNF form , so how do I do it.

11. How to simplify boolean expressions. - Mathematics Stack Exchange

    math.stackexchange.com/questions/3935213/how-to-simplify-boolean-expressions

    I'm struggling to understand what rules to apply when simplifying boolean expression. For example: $$ B+(A\\cdot(C+B) \\overline C) $$ I'm not sure how to simplify this expression. Here is my attem...