This page describes our work on computing maximal non-redundant integer cone generators. The algorithms, implementations, and results are described in the following technical report:

Identifying 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 technical report as well as the following paper from CADE 2007:

• Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic