The Reasoning Engine: A Satisfiability Modulo Theories-Based Framework for Reasoning About Discrete Biological Models-Reference-Cited by-同舟云学术

The Reasoning Engine: A Satisfiability Modulo Theories-Based Framework for Reasoning About Discrete Biological Models

Published:2023-09-01 Issue:9 Volume:30 Page:1046-1058
ISSN:1557-8666
Container-title:Journal of Computational Biology
language:en
Short-container-title:Journal of Computational Biology

Author:

Yordanov Boyan¹,Dunn Sara-jane²,Gravill Colin¹,Arora Himanshu³,Kugler Hillel³^ORCID,Wintersteiger Christoph M.²

Affiliation:

1. Scientific Technologies, London, United Kingdom.

2. Microsoft Research, Cambridge, United Kingdom.

3. Bar-Ilan University, Faculty of Engineering, Ramat Gan, Israel.

Publisher

Mary Ann Liebert Inc

Subject

Computational Theory and Mathematics,Computational Mathematics,Genetics,Molecular Biology,Modeling and Simulation

Link

https://www.liebertpub.com/doi/pdf/10.1089/cmb.2023.0117

Reference57 articles.

1. Modeling the C. elegans germline stem cell genetic network using automated reasoning

2. A survey of gene regulatory networks modelling methods: from differential equations, to Boolean and qualitative bioinspired models

3. Barnett M, Chang B-YE, DeLine R, et al. Boogie: A modular reusable verifier for object-oriented programs. In: International Symposium on Formal Methods for Components and Objects; 2005; pp. 364–387.

4. Barrett C, Stump A, Tinelli C. The SMT-LIB standard—Version 2.0. In: Proceedings of the 8th Intl. Workshop on Satisfiability Modulo Theories (SMT’10); 2010.

5. Computational Modeling, Formal Analysis, and Tools for Systems Biology

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Synthesis of Boolean Networks with Weak and Strong Regulators;Lecture Notes in Computer Science;2024