Ah, no, sorry, I clearly didn't explain this well. A Boolean truth table
is not a matrix, and does not evaluate a Boolean expression (if anything,
it's the reverse. It takes the evaluations and re-creates the expression.
This gets complicated as the number of variables grows).
Technically it's math, but I suspect people would be more likely to use
the keyword 'boolean', or perhaps 'digital logic', when looking for
something like this.
(For supporting evidence, the Wikipedia article on the Quine-McCluskey
algorithm nowhere uses 'math' in the current version of the article.)
Thanks,
-john
On Fri, September 9, 2016 2:50 pm, Karen Etheridge wrote:
> I think I'd look for such a module in the Math:: namespace.
>
> I also found these modules which may be similar: Math::BooleanEval,
> Math::MatrixBool.
>
> On Fri, Sep 9, 2016 at 12:33 PM, John M. Gamble <jgam...@ripco.com> wrote:
>
>> A while back I was granted co-maintenance of Algorithm::QuineMcCluskey.
>> It
>> handles one Boolean expression at a time, and I decided that it would be
>> good to create a package that could manipulate a Boolean truth table.
>>
>> So Boolean::TruthTable is nearly ready to go (I have documentation to
>> complete).
>>
>> But, to handle the columns in the table, I created a base class.
>> Algorithm::QuineMcCluskey would become a child of this class (because
>> after all this is done, I'm going to explore other algorithms).
>>
>> Naming this class is a little trickier. It's not an algorithm, so I
>> don't
>> think using the Algorithm top level is appropriate. I'm settling on
>> Boolean::Minimizer (which is what the algorithms do).
>>
>> Now the potential problem is that Boolean isn't used much as a top-level
>> name. I can only find 'boolean', the pragma for using true and false
>> values, and Boolean-String, which has a 0.01 release and hasn't been
>> updated since.
>>
>> So are there any objections to my using Boolean as a top level name in
>> earnest?
>>
>> -john
>>
>>
>
