Gröbner-free normal forms for Boolean polynomials

In: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (ISSAC '08), Linz/Hagenberg, Austria. ACM, New York, NY, USA, P. 55-62, July, 2008

Authors

• Michael Brickenstein
• Alexander Dreyer

Abstract

This paper introduces a new method for interpolation of Boolean functions using Boolean polynomials. It was motivated by some problems arising from computational biology, for reverse engineering the structure of mechanisms in gene regulatory networks. For this purpose polynomial expressions have to be generated, which match known state combinations observed during experiments. Earlier approaches using Gröbner techniques have not been powerful enough to treat real-world applications. The proposed method avoids expensive Gröbner basis computations completely by directly calculating reduced normal forms. The problem statement can be described by Boolean polynomials, i.e. polynomials with coefficients in {0,1} and a degree bound of one. Therefore, the reference implementations mentioned in this work are built on the top of the PolyBoRi framework, which has been designed exclusively for the treatment of this special class of polynomials. A series of randomly generated examples is used to demonstrate the performance of the direct method. It is also compared with other approaches, which incorporate Gröbner basis computations.

BibTeX

 
@InProceedings{ BrickensteinDreyerISSAC08, 
   title = { Gröbner-free normal forms for Boolean polynomials }, 
   author = { Michael Brickenstein and Alexander Dreyer },   
   booktitle = { Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (ISSAC '08), Linz/Hagenberg, Austria },        
   publisher = { ACM, New York, NY, USA },   
   pages = { 55-62 },  
   month = jul, 
   year = 2008, 
} 

---

This publication belongs to the project VerSiS.