<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Formalization and Automated reasoning about a Complex Signalling Network</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Annamaria Basile</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maria Rosa Felice</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Provetti</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dept. of Life Sciencies, Univ. of Messina.</institution>
          <addr-line>Messina</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dept. of Physics - Informatics section, Univ. of Messina.</institution>
          <addr-line>Messina</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Tran and Baral have proposed an action language (BioSigNet-RR) that is specific for the modeling of signalling networks from Biology and for answering queries relative to the expected response to a stimulus. Translation of their action language to logic programs under Answer Set semantics yields a reasoning mechanisms that gracefully handles incomplete/partial information, updates etc. Those features are extremely important since existing regulatory networks often contain missing or suspected interaction links, or proven interactions whose outputs are uncertain. We present our application experience in developing a BioSigNet-RR formalization of the Signalling network for Arabidopsis Brassinosteroid, a complex interaction that is at the base of growth in some plant species. Such modeling exercise has involved 'filling the gaps' between the terse graphical language of signalling networks literature and the precise specification of the triggering conditions required by BioSigNet-RR. This application experience leads us to propose a new formalization style for action theories representing signaling networks that allows for the description of non-immediate effects of actions. Empirical evaluation of our declarative model has involved formulating and testing several 'what if' queries and checking the quality of the answer with domain experts.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In Biology, signalling networks (also referred to as signalling pathways) are specific
collections of interactions with a common theme. They are used to provide a summary,
working model of the complex interactions that explain how a living cell receives and
responds to signals from its environment. Modeling signalling networks is sometimes
essential for understanding how cells function and it may lead to effective therapeutic
strategies that correct or alter abnormal cell behaviors.</p>
      <p>From the point of view of Artificial Intelligence signalling networks represent an
interesting form of semi-formal knowledge representation: relevant cellular interactions
are to be explicitly described, in a simple graphical language. However, two main issues
make modeling signalling networks with action languages challenging:
1. inhibition, which we see as a special form of constraint, needs to be explicitly
represented and reasoned about,
2. several unspoken assumptions lie in the background as they are assumed to be
known by the (expert) reader. For instance, the time element, i.e., a description
of the delay between stimulus and reaction, is not explicitly represented yet it is an
essential element in reasoning about the long-term evolution of the cell.</p>
      <p>This extended abstract reports the results of our work on formalization and
automated reasoning with a signalling network that is considered3representative of the size,
level of detail and complexity of such networks in the Biology literature. The chosen
pathway, which is depicted in Figure 1, represents the current knowledge on the
interaction that makes the arabdiposis of Brassinosteroids (represented by the lone
diamondshaped node in the pathway) stimulate growth in plants.</p>
      <p>
        Chory et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] presents the pathway and comments in detail each interaction; at
this level, we can identify each arc with one relevant interaction. The nodes of the
pathway represents disparate physical elements: extra-cellular signals, receptors on the
cell’s surface or intracellular elements able to trasduce signals to the nucleus. Color ans
shape of each node guide the expert reader on the actual nature of the element being
represented.
      </p>
      <p>From the point of view of knowledge representation and reasoning, the following
scientific hypotheses motivate our work.</p>
      <p>
        First, there is a question about the adequacy of BioSigNet-RR [
        <xref ref-type="bibr" rid="ref2 ref8">2,8</xref>
        ] to support the
formalization and reasoning about this specific signalling pathway. As we will see, some
specific aspect of the cellular organization is not easily described in terms of
BioSigNetRR primitives.
      </p>
      <p>Second, there is a question of adequacy of our action languages with respect to
reasoning about pathway interactions. We consider the following informal test: can we
apply BioSigNet-RR to formalize the type of ’what if’ questions that an examiner would
ask to check a student’s assimilation of the material. Hence, we proceed to formulate
some easy sample questions and see how the query language part of BioSigNet-RR
allows to formulate it.
3 Paccanaro and Bogre, personal communications.</p>
      <p>Finally, our overall hypothesis is that, in the middle term, we should be able to
design and implement a vertical solution by which the domain knowledge synthesized
in a signalling pathway can be accessed and reasoned about automatically.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The representation language</title>
      <p>
        Our modeling effort has adopted the BioSigNet-RR [
        <xref ref-type="bibr" rid="ref2 ref8">2,8</xref>
        ] language as it now considered
the language of reference for reasoning about actions in the Biological domain.
Essentially, BioSigNet-RR is an extension of the family of action languages developed by
Gelfond and Lifschitz in the 90s; we refer the interested reader to [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] for a survey of the
approach. Gelfond and Lifschitz proposed a sorted language, where sorts are actions
and fluents, where primitives are the well-known initially and causes statements. A set
of those statements is called an action theory. State is defined in terms of a set of fluents
that are deemed true thereof. A declarative semantics is assigned to action theories in
terms of trajectories, i.e., an iteration throughout states that the domain in undergoing.
At the same time, action languages receive a semantics thanks to translation of action
statements to logic programs under answer set semantics [
        <xref ref-type="bibr" rid="ref1 ref6">6,1</xref>
        ].
      </p>
      <p>
        When the initial situation is only partially defined, or actions are unknown or even
may have non-deterministic effects, alternative answer sets account for the alternative
evolutions of the domain. The translation from action languages, including
BioSigNetRR, to logic programs is modular, in the sense that it can be done line-by-line by a
parser and generator. The translation, which is described in detail in [] has been adopted
as is and implemented by a Python-language program derived from Gregory Gelfond’s
Al2ASP project [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] (see [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] for another application project on the same guidelines).
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Formalizing the Background knowledge</title>
      <p>Signalling pathways are a graphical, synthetic representation of knowledge. However,
to fully grasp the dynamics represented by the pathway one often needs to read
attentively a natural-language background description that comes with the network.</p>
      <p>
        In our project we have spent a great amount of time to understand and organize the
background description of the Arabidopsis Brassinosteroid process given by Chory et
al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The following phrases have been singled out and analyzed separately.
1. In the absence of steroid, BKI1, a plasma membrane-associated protein, interacts
directly with the kinase domain of BRI1 to negatively regulate the signalling
pathway
2. Binding of BRs to preformed BRI1 homo-oligomers leads to the dissociation of
      </p>
      <p>BKI1 from the plasma membrane.
3. It has been proposed that the physical interaction between BRI1 and BAK1 leads
to the formation of a signalling-competent hetero-oligomer.
4. The signals transmitted from the plasma membrane-localized BRI1-BAK1
heterooligomer negatively regulate the activity of a glycogen synthase kinase 3 (GSK-3),
called BIN2.</p>
      <p>It relatively easy to associate each phrase to one of the arcs represented by the
signalling pathway. Such association, however, is not always straightforward and will
be further commented upon.</p>
      <p>It must be pointed out that in our analysis we have discovered that the interaction
which is represented by arc:</p>
      <p>+=</p>
      <p>
        BR1 =) BAK1
is not found in the pathway depicted in Chory et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], from where our work started,
but is in Figure 1, which was later found on the Web site of the Science Signaling4
journal.
3.1
      </p>
      <sec id="sec-3-1">
        <title>Formalization of the Signalling Pathway for BR</title>
        <p>The formalization of the pathway proceeds as follows. For each named cellular
component, e.g., BR, we introduce two fluents5: high(br) e low(br). Then, we introduce
two activation actions: activate(br) and inactivate(br), where the latter is an inhibition
action that, in some sense, depresses BR.
4 http://www.sciencemag.org
5 The labels used in the signalling pathway are in lowercase, since they are constant names in
the domain description.</p>
        <p>high(bki1) inhibits activate(bri1)
“Binding of BR to preformed BRI1 homo-oligomers lead to the dissociation of
BKI1 from the plasma membrane.”
binding(br; bki1) causes dissociated(bki1) if high(bri1)
(3)
Even though it looks like the description of a local, direct interaction, this formalization
may be the most effective in capturing the rationale of the pathway. An alternative
formulation, which has hitherto not been tested is the following:</p>
        <p>high(br) high(bri1) triggers dissociated(bki1)
“A suppressor screen using a weak allele of BRI1 identified a secreted and active
carboxypeptidase, called BRS1, although its molecular target in the BR signaling
pathway is unknown. It has been proposed that the physical interaction between BRI1 and
BRS1 leads to the formation of a signaling-competent hetero-oligomer.”</p>
        <p>Next, the remaining arcs are formalized, by coupling each arc to the illustrative
phrase found in the description. For instance, the arc connecting BRI1 to BAK1 is
connected to the phrase:
“BRI1 interacts directly with BAK1 [through a phosphorylation process].”
activate(bak1) causes up(bri1)
“BKI1 interacts directly with the kinase domain of BRI1 to negatively regulate the
signalling pathway.”
(1)
(2)
(4)
(5)
(6)
(7)
(8)
high(brs1) triggers activate(bri1)
“In vitro and in vivo, BRI1 associates with TTL, transthyretin-like protein.
Overexpression of TTL causes slight dwarfing, suggesting that it may play a negative role
early in the BR signaling pathway.”</p>
        <p>high(bri1) triggers downregulate(ttl)
“Biochemical studies identified TRIP-1 as a BRI1 interactor.”</p>
        <p>high(bri1) triggers activate(trip1)
“The signals transmitted from the plasma membrane-localized BRI1-BAK1
heterooligomer negatively regulate the activity of a glycogen synthase kinase 3 (GSK-3),
called BIN2.”</p>
        <p>high(bri1); high(bak1) inhibits activate(bin2)
“Although the mechanism is as yet uncharacterized, inactivation of BIN2 leads to
the dephosphorylation of BES1 and BZR1, members of a new family of plant-specific
transcription factors.”
inactivate(bin2) causes low(bzr1)
inactivate(bin2) causes low(bes1)
(9)
“Dephosphorylated BZR1 binds to a novel element in the promoters of BR
biosynthetic genes to repress their expression.”
high(bzr1) triggers activate(br)
(10)
“Current data suggest that dephosphorylated BES1 is then able to form homo-or
hetero-dimers with the basic helix-loop-helix (bHLH) transcription factor BIM1, to
bind to E-box elements in the promoters of br-regulated genes.”
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
high(bes1) triggers activate(bim1)
high(bsu1) triggers activate(bes1)
low(bsu1) inhibits activate(bes1)
high(bri1) triggers activate(bsu1)
high(serk1) triggers activate(bri1)</p>
        <p>
          It should be noticed again that in Chory et al. [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] the textual description seems not
aligned to the graphics of the pathway. As a result, we tentatively interpret the inhibition
from BRI1 to BIN2 with:
        </p>
        <p>high(bri1) inhibits (bin2)
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Connecting actions to fluents</title>
        <p>For each fluent we have had to introduce a couple of actions that represent the
upregulation and downregulation of the fluent itself. Hence, we need to introduce the following
two schematic rules, to be instantiated to each fluent:</p>
        <p>activate(C) causes high(C)
downregulate(C) causes low(C)
In a sense, these axiom schemata naturally complement the action theory by capturing
the essence of the += labeling of the arcs. However, they introduce an extra level
of complexity in the representation, since new conditions must be devised to disallow
these definitions for specific values of C, e.g., activate(bak1), that do not have a direct
Biological interpretation.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Query Formulation and informal validation of the model</title>
      <p>To assess the adequacy of the representation language and of our specific action theory
we have considered the following classroom scenario: questions about the Arabdiposis
brassinosteroid process that a teacher would use to check whether her students have
properly learn the material and are now able to reason about Brassinosteroids and their
effects. Such questions were formulated with the goal of stressing the connections
between the several cellular components of the cell.</p>
      <p>To illustrate how natural BioSigNet-RR queries are, we now list, for each question, the
expected answer in English, paired with BioSigNet-RR that captures, to some extent,
the question itself.</p>
      <p>Q: Looking at the pathway, how does BR affect the cell?
A: BR causes the activation of BRI1 and BAK1, which, in turn, inhibit the activation
of BIN2.</p>
      <p>Our formalization is based on three distinct queries:
high(bri1) after activate(br)
high(bak1) after activate(br)
low(bin2) after activate(br)
Q: What are the effects of activation of BAK1 ?
A: BAK1 brings about activation of BR1 ; subsequently, BR1 shall affect the whole
cell network.</p>
      <p>This question can be translated directly in the following formula (query):
?
?
?
?
?
(19)
(20)
(21)
(22)
(23)
Q: What are the effects of inactivation of BIN2 ?
A: inactivation of BIN2 shall cause the inhibition of BZR1 and BES1.
Again, me must resort to two separated queries:</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>The formalization and deployment project described in this article can be considered
successful from the point of view of assessing what can be done with action languages
(and Logic Programming in general) in the context of Biological knowledge
representation and automated reasoning. The overall Artificial intelligence goal, i.e. to have
computers process the meaning synthesized in a signalling pathway without human
intervention, is yet to be achieved, as our formalization had to deal with a time-consuming
human analysis of the accompanying textual explanation, often a heavy-going technical
explanation.</p>
      <p>BioSigNet-RR has shown to be an ideal platform for formalization in this domain.
However, we believe that more research is needed in order to have the action theory
match the pathway. One problem that was, in our opinion, only partially solved here is
that action is understood in two ways. The first understanding, which is probably what
Gelfond-Lifschitz meant, is that of external intervention, i.e., alteration of the state of
affairs. The second understanding, which we suspect is more frequent in Biology, is
that an action may also be an alteration, called upregulation or downregulation, of a
component of the cell. For this second understanding, a specific action sort should be
devised and introduced to the formalization language.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>We are grateful to Alberto Paccanaro and Laszlo Bogre at Royal Holloway, University
of London for providing us careful advice and guidance in the Biological and
Bioinformatics aspects of this work. Many thanks to Gregory Gelfond for providing us constant
advice and support on our work to extend his AL2ASP program.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Baral</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Knowledge Representation, Reasoning and Declarative Problem Solving</article-title>
          . Cambridge University Press (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Baral</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chancellor</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joy</surname>
            ,
            <given-names>A.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berens</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          :
          <article-title>A knowledge based approach for representing and reasoning about signalling networks</article-title>
          .
          <source>In: ISMB/ECCB (Supplement of Bioinformatics)</source>
          . pp.
          <fpage>15</fpage>
          -
          <lpage>22</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chory</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Belkhadir</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Arabidopsis brassinosteroid signalling pathway</article-title>
          .
          <source>Science Signaling</source>
          <volume>364</volume>
          ,
          <issue>cm5</issue>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Gelfold</surname>
          </string-name>
          , G.:
          <article-title>From AL to ASP - the system al2asp</article-title>
          .
          <source>Tech. rep.</source>
          , Arizona State University (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Gelfold</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Inclezan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Yet another modular action language</article-title>
          .
          <source>In: Proc. of Int'l Workshp on Software Engineering for Answer Set Programming</source>
          . pp.
          <fpage>64</fpage>
          -
          <lpage>78</lpage>
          .
          <source>CEUR WS Proceedings</source>
          , vol.
          <volume>546</volume>
          . (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Gelfond</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lifschitz</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Classical negation in logic programs</article-title>
          and disjunctive databases.
          <source>New Generation Comput</source>
          .
          <volume>9</volume>
          (
          <issue>3</issue>
          /4),
          <fpage>365</fpage>
          -
          <lpage>386</lpage>
          (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Gelfond</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lifschitz</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Action languages</article-title>
          .
          <source>Electron. Trans. Artif. Intell</source>
          .
          <volume>2</volume>
          ,
          <fpage>193</fpage>
          -
          <lpage>210</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baral</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Hypothesizing about signalling networks</article-title>
          .
          <source>Journal of Applied Logic</source>
          <volume>7</volume>
          (
          <issue>3</issue>
          ),
          <fpage>253</fpage>
          -
          <lpage>274</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>