Details:
Title  On the computation of comprehensive Boolean Gr\"obner bases.  Author(s)  Shutaro Inoue  Type  Book, Chapter in Book, Conference Proceeding  Abstract  We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (A¯,X¯) with main variables X¯ and parameters A¯ can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both X¯ and A¯ as variables with a certain block term order such that X¯≫A¯. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field 𝔾𝔽2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over 𝔾𝔽2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.  ISBN  9783642041020/pbk 
URL 
http://link.springer.com/chapter/10.1007%2F9783642041037_13 
Language  English  Pages  130141  Publisher  Berlin: Springer  Year  2009  Edition  0  Translation 
No  Refereed 
No 
