Detecting inconsistencies in large biological networks with answer set programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5366 LNCS, Issue , 2008, Pages 130-144

  Gebser, Martin ^a   Schaub, Torsten ^a   Thiele, Sven ^a   Usadel, Björn ^b   Veber, Philippe ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

^b MAX PLANCK INSTITUTE OF MOLECULAR PLANT PHYSIOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING (ASP); BIOLOGICAL NETWORKS; CELL ACTIVITIES; ANSWER SET PROGRAMMING; CELL ACTIVITY; HIGH THROUGHPUT; LARGE SCALE DATA SETS; MINIMAL REPRESENTATION;

COMPUTER PROGRAMMING; PROGRAMMING THEORY;

LOGIC PROGRAMMING;

EID: 58549121025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89982-2_19     Document Type: Conference Paper

References (38)

1. Joyce, A., Palsson, B.: The model organism as a system: Integrating 'omics' data sets. Nature Reviews Molecular Cell Biology 7(3), 198-210 (2006)
2. Klamt, S., Stelling, J.: Stoichiometric and constraint-based modelling. In: System Modeling in Cellular Biology: From Concepts to Nuts and Bolts, pp. 73-96. MIT Press, Cambridge (2006)
3. Friedman, N., Linial, M., Nachman, I., Pe'er, D.: Using Bayesian networks to analyze expression data. Journal of Computational Biology 7(3-4), 601-620 (2000)
4. Siegel, A., Radulescu, O., Le Borgne, M., Veber, P., Ouy, J., Lagarrigue, S.: Qualitative analysis of the relation between DNA microarray data and behavioral models of regulation networks. Biosystems 84(2), 153-174 (2006)
5. Gutierrez-Rios, R., Rosenblueth, D., Loza, J., Huerta, A., Glasner, J., Blattner, F., Collado-Vides, J.: Regulatory network of Escherichia coli: Consistency between literature knowledge and microarray profiles. Genome Research 13(11), 2435-2443 (2003)
6. Soulé, C.: Graphic requirements for multistationarity. Complexus 1(3), 123-133 (2003)
7. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375-398. Springer, Heidelberg (1999)
8. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3-4), 241-273 (1999)
9. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
10. Soulé, C.: Mathematical approaches to differentiation and gene regulation. Comptes Rendus Biologies 329, 13-20 (2006)
11. Remy, É, Ruet, P., Thieffry, D.: Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework. Advances in Applied Mathematics (to appear, 2008)
12. Richard, A., Comet, J.: Necessary conditions for multistationarity in discrete dynamical systems. Discrete Applied Mathematics 155(18), 2403-2413 (2007)
13. Kuipers, B.: Qualitative reasoning: Modeling and simulation with incomplete knowledge. MIT Press, Cambridge (1994)
14. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181-234 (2002)
15. Syrjänen, T.: Lparse 1.0 user's manual, http://www.tcs.hut.fi/ Software/smodels/lparse.ps.gz
16. Mitchell, D.: A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science 85, 112-133 (2005)
17. Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36(4), 345-377 (2006)
18. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: A conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol. 4483, pp. 260-265. Springer, Heidelberg (2007)
19. Drescher, C., Gebser, M., Grote, T., Kaufmann, B., König, A., Ostrowski, M., Schaub, T.: Conflict-driven disjunctive answer set solving. In: Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 422-432. AAAI Press, Menlo Park (2008)
20. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. Freeman and Co., New York (1979)
21. Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence 15(3-4), 289-323 (1995)
22. Gebser, M., Schaub, T., Thiele, S.: Grin Go: A new grounder for answer set programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol. 4483, pp. 266-271. Springer, Heidelberg (2007)
23. Veber, P., Le Borgne, M., Siegel, A., Lagarrigue, S., Radulescu, O.: Complex qualitative models in biology: A new approach. Complexus 2(3-4), 140-151 (2004)
24. http://www.cs.uni-potsdam.de/wv/bioasp
25. Gelfond, M., Lifschitz, V., Przymusinska, H., Truszczyński, M.: Disjunctive defaults. In: Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning (KR 1991)., pp. 230-237. Morgan Kaufmann, San Francisco (1991)
26. Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12(1-2), 53-87 (1994)
27. Lierler, Y.: cmodels - SAT-based disjunctive answer set solver. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS, vol. 3662, pp. 447-451. Springer, Heidelberg (2005)
28. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499-562 (2006)
29. http://sourceforge.net/projects/potassco
30. Guziolowski, C., Veber, P., Le Borgne, M., Radulescu, O., Siegel, A.: Checking consistency between expression data and large scale regulatory networks: A case study. Journal of Biological Physics and Chemistry 7(2), 37-43 (2007)
31. Dershowitz, N., Hanna, Z., Nadel, A.: A scalable algorithm for minimal unsatisfiable core extraction. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 36-41. Springer, Heidelberg (2006)
32. Papadimitriou, C., Yannakakis, M.: The complexity of facets (and some facets of complexity). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 255-260. ACM Press, New York (1982)
33. Erdos, P., Rényi, A.: On random graphs. Publicationes Mathematicae 6, 290-297 (1959)
34. Jeong, H., Tombor, B., Albert, R., Oltvai, Z., Barabási, A.: The large-scale organization of metabolic networks. Nature 407, 651-654 (2000)
35. http://www.princeton.edu/~chaff/zchaff.html
36. Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.: Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic 7(1), 1-37 (2006)
37. Guelzim, N., Bottani, S., Bourgine, P., Képès, F.: Topological and causal structure of the yeast transcriptional regulatory network. Nature Genetics 31, 60-63 (2002)
38. Sudarsanam, P., Iyer, V., Brown, P., Winston, F.: Whole-genome expression analysis of snf/swi mutants of Saccharomyces cerevisiae. Proceedings of the National Academy of Sciences of the United States of America 97(7), 3364-3369 (2000)