{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:14:39Z","timestamp":1773274479101,"version":"3.50.1"},"reference-count":37,"publisher":"Cambridge University Press (CUP)","issue":"2-3","license":[{"start":{"date-parts":[[2011,1,27]],"date-time":"2011-01-27T00:00:00Z","timestamp":1296086400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce an approach to detecting inconsistencies in large biological networks by using answer set programming. To this end, we build upon a recently proposed notion of consistency between biochemical\/genetic reactions and high-throughput profiles of cell activity. We then present an approach based on answer set programming to check the consistency of large-scale data sets. Moreover, we extend this methodology to provide explanations for inconsistencies by determining minimal representations of conflicts. In practice, this can be used to identify unreliable data or to indicate missing reactions.<\/jats:p>","DOI":"10.1017\/s1471068410000554","type":"journal-article","created":{"date-parts":[[2011,1,27]],"date-time":"2011-01-27T11:12:02Z","timestamp":1296126722000},"page":"323-360","source":"Crossref","is-referenced-by-count":35,"title":["Detecting inconsistencies in large biological networks with answer set programming"],"prefix":"10.1017","volume":"11","author":[{"given":"MARTIN","family":"GEBSER","sequence":"first","affiliation":[]},{"given":"TORSTEN","family":"SCHAUB","sequence":"additional","affiliation":[]},{"given":"SVEN","family":"THIELE","sequence":"additional","affiliation":[]},{"given":"PHILIPPE","family":"VEBER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2011,1,27]]},"reference":[{"key":"S1471068410000554_ref24","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262195485.003.0005"},{"key":"S1471068410000554_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01929-6_7"},{"key":"S1471068410000554_ref32","doi-asserted-by":"publisher","DOI":"10.1159\/000076100"},{"key":"S1471068410000554_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.bbalip.2006.05.017"},{"key":"S1471068410000554_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2007.11.003"},{"key":"S1471068410000554_ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2005.10.006"},{"key":"S1471068410000554_ref5","first-page":"36","volume-title":"Proc. of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT'06)","author":"Dershowitz","year":"2006"},{"key":"S1471068410000554_ref9","doi-asserted-by":"publisher","DOI":"10.1089\/106652700750050961"},{"key":"S1471068410000554_ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068410000554_ref3","unstructured":"BioASP Tools. 2008. Accessed 7 January 2011, URL: http:\/\/www.cs.uni-potsdam.de\/wv\/bioasp"},{"key":"S1471068410000554_ref18","doi-asserted-by":"publisher","DOI":"10.1038\/ng873"},{"key":"S1471068410000554_ref35","unstructured":"Syrj\u00e4nen T. Lparse 1.0 user's manual, Accessed 7 January 2011. URL: http:\/\/www.tcs.hut.fi\/Software\/smodels\/lparse.ps.gz"},{"key":"S1471068410000554_ref36","doi-asserted-by":"publisher","DOI":"10.1159\/000093686"},{"key":"S1471068410000554_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(07)03007-6"},{"key":"S1471068410000554_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.molcel.2007.08.019"},{"key":"S1471068410000554_ref10","unstructured":"Gebser M. , Guziolowski C. , Ivanchev M. , Schaub T. , Siegel A. , Thiele S. and Veber P. 2010. Repair and prediction (under inconsistency) in large biological networks with answer set programming. In Proc. of the 12th International Conference on Principles of Knowledge Representation and Reasoning (KR'10)."},{"key":"S1471068410000554_ref25","volume-title":"Qualitative reasoning. Modeling and simulation with incomplete knowledge","author":"Kuipers","year":"1994"},{"key":"S1471068410000554_ref23","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1038\/35036627","article-title":"The large-scale organization of metabolic networks","volume":"407","author":"Jeong","year":"2000","journal-title":"Nature"},{"key":"S1471068410000554_ref19","doi-asserted-by":"publisher","DOI":"10.1101\/gr.1387003"},{"key":"S1471068410000554_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_49"},{"key":"S1471068410000554_ref8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"S1471068410000554_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_50"},{"key":"S1471068410000554_ref28","first-page":"255","volume-title":"Proc. of the 14th Annual ACM Symposium on Theory of Computing (STOC'82)","author":"Papadimitriou","year":"1982"},{"key":"S1471068410000554_ref16","first-page":"230","volume-title":"Proc. of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91)","author":"Gelfond","year":"1991"},{"key":"S1471068410000554_ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.crvi.2005.10.002"},{"key":"S1471068410000554_ref34","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.97.7.3364"},{"key":"S1471068410000554_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01536399"},{"key":"S1471068410000554_ref6","first-page":"422","volume-title":"Proc. of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR'08)","author":"Drescher","year":"2008"},{"key":"S1471068410000554_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_13"},{"key":"S1471068410000554_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9033-2"},{"key":"S1471068410000554_ref20","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2164-10-244"},{"key":"S1471068410000554_ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1119439.1119440"},{"key":"S1471068410000554_ref37","doi-asserted-by":"publisher","DOI":"10.1128\/MCB.21.6.2057-2069.2001"},{"key":"S1471068410000554_ref30","doi-asserted-by":"crossref","first-page":"373","DOI":"10.3233\/FUN-2005-65405","article-title":"R. Thomas' modeling of biological regulatory networks: Introduction of singular states in the qualitative dynamics","volume":"65","author":"Richard","year":"2004","journal-title":"Fundamenta Informaticae"},{"key":"S1471068410000554_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530761"},{"key":"S1471068410000554_ref21","doi-asserted-by":"publisher","DOI":"10.4024\/20701.jbpc.07.02"},{"key":"S1471068410000554_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068410000554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:56:46Z","timestamp":1740895006000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068410000554\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,27]]},"references-count":37,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["S1471068410000554"],"URL":"https:\/\/doi.org\/10.1017\/s1471068410000554","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,27]]}}}