Description
BIBasis is the package which implements the methods for constructing the reduced Pommaret and Gr\"obner bases in a Boolean ring for a given polynomial Ideal.
Some references:

V. P. Gerdt and M. V. Zinin, Involutive Method for Computing Gr\"obner Bases over F_2. Programming and Computer Software, Vol. 34, No. 4, 2008, 191203.

V.P.Gerdt and M.V.Zinin. A Pommaret Division Algorithm for Computing Gr\"obner Bases in Boolean Rings. Proceedings of ISSAC 2008, ACM Press, 2008, pp.95–102.

Vladimir Gerdt, Mikhail Zinin and Yuri Blinkov. On computation of Boolean involutive bases. Programming and Computer Software, Vol. 36, No. 2, 2010, 117123.