Temporal Logic Modeling of Biological Systems

  • Jean-Marc Alliot
  • Robert Demolombe
  • Martín Diéguez
  • Luis Fariñas del Cerro
  • Gilles Favre
  • Jean-Charles Faye
  • Naji Obeid
  • Olivier Sordet
Chapter
Part of the Intelligent Systems Reference Library book series (ISRL, volume 110)

Abstract

Metabolic networks, formed by a series of metabolic pathways, are made of intracellular and extracellular reactions that determine the biochemical properties of a cell, and by a set of interactions that guide and regulate the activity of these reactions. Cancer, for example, can sometimes appear in a cell as a result of some pathology in a metabolic pathway. Most of these pathways are formed by an intricate and complex network of chain reactions, and can be represented in a human readable form using graphs which describe the cell signaling pathways. In this paper, we define a logic, called Molecular Interaction Logic (MIL), able to represent these graphs and we present a method to automatically translate graphs into MIL formulas. Then we show how MIL formulas can be translated into linear time temporal logic, and then grounded into propositional classical logic. This enables us to solve complex queries on graphs using only propositional classical reasoning tools such as SAT solvers.

Keywords

Metabolic networks Molecular interaction logic (MIL) Temporal reasoning 

References

  1. 1.
    Aguado, F., Cabalar, P., Diéguez, M., Pérez, G., Vidal, C.: Temporal equilibrium logic: a survey. J. Appl. Non-Class. Logics 23(1–2), 2–24 (2013)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Aguado, F., Cabalar, P., Pérez, G., Vidal, C.: Loop formulas for splitable temporal logic programs. In: Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’11), pp. 80–92. Vancouver, Canada (2011)Google Scholar
  3. 3.
    Audemard, G., Simon, L.: Predicting learnt clauses quality in modern sat solver. In: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI’09), pp. 399–404 (2009)Google Scholar
  4. 4.
    Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)CrossRefGoogle Scholar
  5. 5.
    Cabalar, P., Pérez, G.: Temporal equilibrium logic: a first approach. In: Proceedings of the 11th International Conference on Computer Aided Systems Theory (EUROCAST’07), pp. 241–248 (2007)Google Scholar
  6. 6.
    Clark, K.L.: Negation as failure. In: Logic and Databases, pp. 293–322. Plenum Press (1978)Google Scholar
  7. 7.
    Déharbe, D., Fontaine, P., LeBerre, D., Mazure, B.: Computing prime implicants. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 46–52. Portland, USA (2013)Google Scholar
  8. 8.
    Demolombe, R., Fariñas del Cerro, L., Obeid, N.: Automated reasoning in metabolic networks with inhibition. In: 13th International Conference of the Italian Association for Artificial Intelligence, AI*IA’13, pp. 37–47. Turin, Italy (2013)Google Scholar
  9. 9.
    Demolombe, R., Fariñas del Cerro, L., Obeid, N.: Logical model for molecular interactions maps. In: Fariñas del Cerro, L., Inoue, K. (eds.) Logical Modeling of Biological Systems, pp. 93–123. Wiley (2014)Google Scholar
  10. 10.
    Demolombe, R., Fariñas del Cerro, L., Obeid, N.: Translation of first order formulas into ground formulas via a completion theory. J. Appl. Logic 15, 130–149 (2016)Google Scholar
  11. 11.
    Een, N., Sorensson, N.: An extensible sat-solver. In: Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT2003), pp. 502–518. Santa Margherita Ligure, Italy (2003)Google Scholar
  12. 12.
    Ferraris, P., Lee, J., Lifschitz, V.: A generalization of the lin-zhao theorem. Ann. Math. Artif. Intell. 47(1–2), 79–101 (2006)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Jabbour, S., Marques-Silva, J., Sais, L., Salhi, Y.: Enumerating prime implicants of propositional formulae in conjunctive normal form. In: Proceedings of the 14th European Conference, JELIA 2014, pp. 152–165. Funchal, Madeira, Portugal (2014)Google Scholar
  14. 14.
    Jackson, P.: Computing prime implicates. In: Proceedings of the 20th ACM Conference on Annual Computer Science (CSC’92), pp. 65–72. Kansas City, USA (1992)Google Scholar
  15. 15.
    Jackson, P.: Computing prime implicates incrementally. In: Proceedings of the 11th International Conference on Automated Deduction (CADE’11), pp. 253–267. Saratoga Springs, NY, USA (1992)Google Scholar
  16. 16.
    Jacob, F., Monod, J.: Genetic regulatory mechanisms in the synthesis of proteins. J. Mol. Biol. 3, 318–356 (1961)CrossRefGoogle Scholar
  17. 17.
    Kean, A., Tsiknis, G.: An incremental method for generating prime implicants/implicates. J. Symbolic Comput. 9, 185–206 (1990)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by sat solvers. In: Artificial Intelligence, pp. 112–117 (2002)Google Scholar
  19. 19.
    Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pp. 46–57. Providence, Rhode Island, USA (1977)Google Scholar
  20. 20.
    van Iersel, M.P., Kelder, T., Pico, A.R., Hanspers, K., Coort, S., Conklin, B.R., Evelo, C.: Presenting and exploring biological pathways with PathVisio. BMC Bioinform. 9, 399 (2008)CrossRefGoogle Scholar
  21. 21.
    Wikipedia: The lac operon. https://en.wikipedia.org/wiki/Lac_operon (2015)

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Jean-Marc Alliot
    • 1
  • Robert Demolombe
    • 1
  • Martín Diéguez
    • 1
  • Luis Fariñas del Cerro
    • 1
  • Gilles Favre
    • 1
  • Jean-Charles Faye
    • 1
  • Naji Obeid
    • 1
  • Olivier Sordet
    • 1
  1. 1.INSERM/IRITUniversity of ToulouseToulouseFrance

Personalised recommendations