Abstract
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and understood from datasets made up of the states of the relevant components and a set of discrete outcomes or results. The analysis of these systems can be assisted by models that are consistent with the available data while being maximally predictive for untested conditions. Here, we present a method to construct such models for these types of systems. To maximize predictive capability, we introduce a set of “don’t care” (dc) Boolean variables that must be assigned values in order to obtain a concrete model. When a dc variable is set to 1, this indicates that the information from the corresponding component does not contribute to the observed result. Intuitively, more dc variables that are set to 1 maximizes both the potential predictive capability as well as the possibility of obtaining an inconsistent model. We thus formulate our problem as maximizing the number of dc variables that are set to 1, while retaining a model solution that is consistent and can explain all the given known data. This amounts to solving a quantified Boolean formula (QBF) with three levels of quantifier alternations, with a maximization goal for the dc variables. We have developed a prototype implementation to support our new modeling approach and are applying our method to part of a classical system in developmental biology describing fate specification of vulval precursor cells in the C. elegans nematode. Our work indicates that biological instances can serve as challenging and complex benchmarks for the formal-methods research community.
This research was supported in part by NIH grant R24-GM066969.
Chapter PDF
Similar content being viewed by others
References
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35(12), 1035–1044 (1986)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Comm. ACM 5(7), 394–397 (1962)
Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. J. ACM 7(3), 201–215 (1960)
Files, C.M., Perkowski, M.A.: Multi-Valued Functional Decomposition as a Machine Learning Method. In: Proc. 28th IEEE International Symposium on Multiple-Valued Logic (ISMVL’98), Fukuoka, Japan, May 1998, pp. 173–179. IEEE Computer Society Press, Los Alamitos (1998)
Fisher, J., et al.: Computational Insights into C. elegans Vulval Development. Proceedings of the National Academy of Sciences 102(6), 1951–1956 (2005)
Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified boolean formulas satisfiability library (qbflib) (2001), http://www.qbflib.org
Giurumescu, C.A., Sternberg, P.W., Asthagiri, A.R.: Intercellular coupling amplifies fate segregation during Caenorhabditis elegans vulval development. Proceedings of the National Academy of Sciences 103(5), 1331–1336 (2006)
Goldman, J.A., Axtell, M.L.: On Using Logic Synthesis for Supervised Classification Learning. In: Proc. 7th Int. Conference on Tools with Artificial Intelligence (ICTAI95’), pp. 198–205. IEEE Computer Society Press, Los Alamitos (1995)
Huand, L.S., Sternberg, P.W.: Genetic dissection of developmental pathways. The C. elegans Research Community, ed. WormBook (2006), http://www.wormbook.org
Kam, N., et al.: Formal Modeling of C. elegans Development: A Scenario-Based Approach. In: Priami, C. (ed.) CMSB 2003. LNCS, vol. 2602, pp. 4–20. Springer, Heidelberg (2003)
Michalski, R.S.: A Theory and Methodology of Inductive Learning. Artificial Intelligence 20(2), 111–161 (1983)
Mitchell, T.M.: Generalization as Search. Artificial Intelligence 18(2), 203–226 (1982)
Pnueli, A., Shahar, E.: A platform for combining deductive with algorithmic verification. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 184–195. Springer, Heidelberg (1996)
Ranjan, D.P., Tang, D., Malik, S.: A Comparative Study of 2QBF Algorithms. In: Proc. 7th Int. Conference on Theory and Applications of Satisfiability Testing (2004)
Sternberg, P.W.: Lateral inhibition during vulval induction in Caenorhabditis elegans. Nature 335, 551–554 (1989)
Sternberg, P.W.: Vulval development. The C. elegans Research Community, ed. WormBook (2005), http://www.wormbook.org
Sternberg, P.W., Horvitz, H.R.: Pattern formation during vulval development in C. elegans. Cell 44, 761–772 (1986)
Sternberg, P.W., Horvitz, H.R.: The combined action of two intercellular signaling pathways specifies three cell fates during vulval induction in C. elegans. Cell 58, 679–693 (1989)
The C. elegans Research Community, ed. WormBook (2006), http://www.wormbook.org
Zhang, L., Malik, S.: Conflict Driven Learning in a Quantified Boolean Satisfiability Solver. In: Proc. of the 2002 IEEE/ACM International Conference on Computer-aided Design (ICCAD’02), November 2002, pp. 442–449. ACM Press, New York (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kugler, H., Pnueli, A., Stern, M.J., Hubbard, E.J.A. (2007). “Don’t Care” Modeling: A Logical Framework for Developing Predictive System Models. In: Grumberg, O., Huth, M. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2007. Lecture Notes in Computer Science, vol 4424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71209-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-71209-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71208-4
Online ISBN: 978-3-540-71209-1
eBook Packages: Computer ScienceComputer Science (R0)