This page describes our work on identifying Maximal Non-Redundant Integer Cone Generators. The algorithms and results identified are described in the following technical report:

Searching for Maximal Non-Redundant Integer Cone Generators

As part of this search we have also explicitly computed all non-redundant integer cones modulo row and column permutations:

• dimension 4
• dimension 5
• dimension 6

For more background on this work, please consult the following paper:

• Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic