1
$\begingroup$

I am doing boolean simplification using Quine-McCluskey which works well.

However, I now need to perform the simplification with some known term combinations.

For example, I want to simplify:

(A+B)C

If I know that:

A+B == true

then this simplifies to:

C

Or if I know that:

BC == false

then it simplifies to

AC

How can I implement this in a fully general way?

  • 1
    What do you mean by "implement" ?2012-02-24
  • 1
    Are you asking about a specific situation or about an algorithm to partially evaluate Boolean expression efficiently?2012-02-24
  • 0
    Sorry for not being clear - I am asking for an algorithm that can simplify boolean expressions given a list of terms that are already known. It needs to cope with situations more complex than the examples given in the question.2012-02-24
  • 0
    I have now solved this problem. See below for my answer.2012-02-28

2 Answers 2