BIBasis - program package available for REDUCE and Macaulay2 computer algebra
systems. It implements involutive algorithm based on Pommaret division to
compute Boolean involutive and Gröbner bases. 3 monomial orderings are supported:
pure lexicographical, degree lexicographical and degree reversed lexicographical.
Package description BIBasis (.pdf) are submitted.
Realization details as well as user interfaces of BIBasis package
are described for every above-named system. Also there are graphical results of
comparison BIBasis package with other available in REDUCE and Macaulay2 algorithms
and packages, suitable for computing boolean Gröbner bases.