Skip to main content
SpringerLink
Log in
Book cover

Towards Paraconsistent Engineering pp 205–226Cite as

Temporal Logic Modeling of Biological Systems

  • Chapter
  • First Online:

Part of the book series: Intelligent Systems Reference Library ((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.

Dedicated to Jair Minoro Abe for his 60th birthday

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    The Nobel prize was awarded to Monod, Jacob and Lwoff in 1965 partly for the discovery of the lac operon by Monod and Jacob [16], which was the first genetic regulatory mechanism to be understood clearly, and is now a “standard” introductory example in molecular biology classes.

  2. 2.

    It is important here to notice that lactose can be either considered as a weak endogenous variable, or as an exogenous variable if we consider that the environment is always providing “enough” lactose. It is a simple example which shows that variables in a graph can be interpreted differently according to what is going to be observed.

  3. 3.

    For a more detailed survey of temporal extension of Answer Set Programming see [1].

  4. 4.

    The dual problem, which could be easily adapted to suit our needs.

References

  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)

    Article  MathSciNet  Google Scholar 

  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. 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. Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)

    Article  Google Scholar 

  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. Clark, K.L.: Negation as failure. In: Logic and Databases, pp. 293–322. Plenum Press (1978)

    Google Scholar 

  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. 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. 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. 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. 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. Ferraris, P., Lee, J., Lifschitz, V.: A generalization of the lin-zhao theorem. Ann. Math. Artif. Intell. 47(1–2), 79–101 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. 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. Jacob, F., Monod, J.: Genetic regulatory mechanisms in the synthesis of proteins. J. Mol. Biol. 3, 318–356 (1961)

    Article  Google Scholar 

  17. Kean, A., Tsiknis, G.: An incremental method for generating prime implicants/implicates. J. Symbolic Comput. 9, 185–206 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. 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)

    Article  Google Scholar 

  21. Wikipedia: The lac operon. https://en.wikipedia.org/wiki/Lac_operon (2015)

Download references

Acknowledgments

This work is partially supported by ANR-11-LABX-0040-CIMI within the program ANR-11-IDEX-0002-02, by IREP Associated European Laboratory and by project CLE from Région Midi-Pyrénées.

Author information

Authors and Affiliations

  1. INSERM/IRIT, University of Toulouse, Toulouse, France

    Jean-Marc Alliot, Robert Demolombe, Martín Diéguez, Luis Fariñas del Cerro, Gilles Favre, Jean-Charles Faye, Naji Obeid & Olivier Sordet

Authors
  1. Jean-Marc Alliot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Demolombe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martín Diéguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Luis Fariñas del Cerro
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Gilles Favre
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jean-Charles Faye
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Naji Obeid
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Olivier Sordet
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luis Fariñas del Cerro .

Editor information

Editors and Affiliations

  1. Kawasaki, Japan

    Seiki Akama

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Alliot, JM. et al. (2016). Temporal Logic Modeling of Biological Systems. In: Akama, S. (eds) Towards Paraconsistent Engineering. Intelligent Systems Reference Library, vol 110. Springer, Cham. https://doi.org/10.1007/978-3-319-40418-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40418-9_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40417-2

  • Online ISBN: 978-3-319-40418-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation