Representation of gene regulation networks by hypothesis logic-based Boolean systems

Boolean Dynamical Systems (BDSs) are networks described by Boolean variables. A new representation of BDSs is presented in this article by using modal non-monotonic logic ( H ). This approach allows Boolean Networks to be represented by a set of modal formulas and therefore can be used to describe and learn their properties. The study of a BDS focuses in particular on the search of stable configurations, limit cycles and unstable cycles, which help to characterize a large type of Gene Networks. In this article is presented the identification of such asymptotic properties by introduction of a new concept, ghost extensions . Using ghost extensions , it is possible to translate BDSs in propositional calculus and consequently to use SAT algorithms.