{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:04:02Z","timestamp":1743091442568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319404172"},{"type":"electronic","value":"9783319404189"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40418-9_11","type":"book-chapter","created":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T08:57:30Z","timestamp":1469091450000},"page":"205-226","source":"Crossref","is-referenced-by-count":2,"title":["Temporal Logic Modeling of Biological Systems"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Alliot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Demolombe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mart\u00edn","family":"Di\u00e9guez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Fari\u00f1as del Cerro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Favre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"Faye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naji","family":"Obeid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Sordet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,22]]},"reference":[{"issue":"1\u20132","key":"11_CR1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1080\/11663081.2013.798985","volume":"23","author":"F Aguado","year":"2013","unstructured":"Aguado, F., Cabalar, P., Di\u00e9guez, M., P\u00e9rez, G., Vidal, C.: Temporal equilibrium logic: a survey. J. Appl. Non-Class. Logics 23(1\u20132), 2\u201324 (2013)","journal-title":"J. Appl. Non-Class. Logics"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Aguado, F., Cabalar, P., P\u00e9rez, G., Vidal, C.: Loop formulas for splitable temporal logic programs. In: Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201911), pp. 80\u201392. Vancouver, Canada (2011)","DOI":"10.1007\/978-3-642-20895-9_9"},{"key":"11_CR3","unstructured":"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\u201909), pp. 399\u2013404 (2009)"},{"issue":"12","key":"11_CR4","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Cabalar, P., P\u00e9rez, G.: Temporal equilibrium logic: a first approach. In: Proceedings of the 11th International Conference on Computer Aided Systems Theory (EUROCAST\u201907), pp. 241\u2013248 (2007)","DOI":"10.1007\/978-3-540-75867-9_31"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Clark, K.L.: Negation as failure. In: Logic and Databases, pp. 293\u2013322. Plenum Press (1978)","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"D\u00e9harbe, D., Fontaine, P., LeBerre, D., Mazure, B.: Computing prime implicants. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 46\u201352. Portland, USA (2013)","DOI":"10.1109\/FMCAD.2013.6679390"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Demolombe, R., Fari\u00f1as 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\u201913, pp. 37\u201347. Turin, Italy (2013)","DOI":"10.1007\/978-3-319-03524-6_4"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Demolombe, R., Fari\u00f1as\u00a0del Cerro, L., Obeid, N.: Logical model for molecular interactions maps. In: Fari\u00f1as\u00a0del Cerro, L., Inoue, K. (eds.) Logical Modeling of Biological Systems, pp. 93\u2013123. Wiley (2014)","DOI":"10.1002\/9781119005223.ch3"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Demolombe, R., Fari\u00f1as del Cerro, L., Obeid, N.: Translation of first order formulas into ground formulas via a completion theory. J. Appl. Logic 15, 130\u2013149 (2016)","DOI":"10.1016\/j.jal.2016.02.002"},{"key":"11_CR11","unstructured":"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\u2013518. Santa Margherita Ligure, Italy (2003)"},{"issue":"1\u20132","key":"11_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10472-006-9025-2","volume":"47","author":"P Ferraris","year":"2006","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: A generalization of the lin-zhao theorem. Ann. Math. Artif. Intell. 47(1\u20132), 79\u2013101 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013165. Funchal, Madeira, Portugal (2014)","DOI":"10.1007\/978-3-319-11558-0_11"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Jackson, P.: Computing prime implicates. In: Proceedings of the 20th ACM Conference on Annual Computer Science (CSC\u201992), pp. 65\u201372. Kansas City, USA (1992)","DOI":"10.1145\/131214.131223"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Jackson, P.: Computing prime implicates incrementally. In: Proceedings of the 11th International Conference on Automated Deduction (CADE\u201911), pp. 253\u2013267. Saratoga Springs, NY, USA (1992)","DOI":"10.1007\/3-540-55602-8_170"},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/S0022-2836(61)80072-7","volume":"3","author":"F Jacob","year":"1961","unstructured":"Jacob, F., Monod, J.: Genetic regulatory mechanisms in the synthesis of proteins. J. Mol. Biol. 3, 318\u2013356 (1961)","journal-title":"J. Mol. Biol."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0747-7171(08)80029-6","volume":"9","author":"A Kean","year":"1990","unstructured":"Kean, A., Tsiknis, G.: An incremental method for generating prime implicants\/implicates. J. Symbolic Comput. 9, 185\u2013206 (1990)","journal-title":"J. Symbolic Comput."},{"key":"11_CR18","unstructured":"Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by sat solvers. In: Artificial Intelligence, pp. 112\u2013117 (2002)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357. Providence, Rhode Island, USA (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"11_CR20","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1186\/1471-2105-9-399","volume":"9","author":"MP Iersel van","year":"2008","unstructured":"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)","journal-title":"BMC Bioinform."},{"key":"11_CR21","unstructured":"Wikipedia: The lac operon. https:\/\/en.wikipedia.org\/wiki\/Lac_operon (2015)"}],"container-title":["Intelligent Systems Reference Library","Towards Paraconsistent Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40418-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:55:02Z","timestamp":1498316102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40418-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319404172","9783319404189"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40418-9_11","relation":{},"ISSN":["1868-4394","1868-4408"],"issn-type":[{"type":"print","value":"1868-4394"},{"type":"electronic","value":"1868-4408"}],"subject":[],"published":{"date-parts":[[2016]]}}}