{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:57Z","timestamp":1759637997495},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540235965"},{"type":"electronic","value":"9783540304791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30479-1_77","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T21:04:53Z","timestamp":1277845493000},"page":"745-754","source":"Crossref","is-referenced-by-count":2,"title":["SAT-Based Analysis of Cellular Automata"],"prefix":"10.1007","author":[{"given":"Massimo","family":"D\u2019Antonio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Delzanno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"77_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-48683-6_8","volume-title":"Computer Aided Verification","author":"A. Biere","year":"1999","unstructured":"Biere, A., Clarke, E.M., Raimi, R., Zhu, Y.: Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 60\u201371. Springer, Heidelberg (1999)"},{"key":"77_CR2","unstructured":"D\u2019Antonio, M.: Analisi SAT-based di Automi Cellulari, Tesi di laurea, Dip. di Informatica e Scienze dell\u2019Informazione, Universit\u2018a di Genova, Marzo (2004)"},{"key":"77_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the Association for Computing Machinery\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"77_CR4","first-page":"453","volume":"1","author":"F. Green","year":"1987","unstructured":"Green, F.: NP-Complete Problems in Cellular Automata. Complex Systems\u00a01, 453\u2013474 (1987)","journal-title":"Complex Systems"},{"issue":"1-2","key":"77_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1006366304347","volume":"24","author":"J. Groote","year":"2000","unstructured":"Groote, J., Warners, J.: The propositional formula checker HeerHugo. Journal of Automated Reasoning\u00a024(1-2), 101\u2013125 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"77_CR6","unstructured":"The ICS home page, http:\/\/www.icansolve.com"},{"issue":"2","key":"77_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","volume":"50","author":"J. Mazoyer","year":"1987","unstructured":"Mazoyer, J.: A six-state minimal time solution to the firing squad synchronization problem. Theoretical Computer Science\u00a050(2), 183\u2013240 (1987)","journal-title":"Theoretical Computer Science"},{"key":"77_CR8","unstructured":"Moore, E.F.: Sequential machines. In: Moore, E.F. (ed.) Selected Papers. Addison-Wesley, Reading (1964)"},{"key":"77_CR9","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001) (2001)","DOI":"10.1145\/378239.379017"},{"issue":"3","key":"77_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"D.A. Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A Structure Preserving Clause Form Translation. Journal of Symbolic Computation\u00a02(3), 293\u2013304 (1986)","journal-title":"Journal of Symbolic Computation"},{"key":"77_CR11","unstructured":"The SIMO web page, http:\/\/www.mrg.dist.unige.it\/sim\/simo\/"},{"issue":"1","key":"77_CR12","first-page":"87","volume":"50","author":"K. Sutner","year":"1995","unstructured":"Sutner, K.: On the computational complexity of finite cellular automata. JCSS\u00a050(1), 87\u201397 (1995)","journal-title":"JCSS"},{"key":"77_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-2789(84)90245-8","volume":"10","author":"S. Wolfram","year":"1984","unstructured":"Wolfram, S.: Universality and complexity in cellular automata. Physica D\u00a010, 1\u201335 (1984)","journal-title":"Physica D"},{"key":"77_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01217347","volume":"96","author":"S. Wolfram","year":"1984","unstructured":"Wolfram, S.: Computation Theory of Cellular Automata. Communications in Mathematical Physics\u00a096, 15\u201357 (1984)","journal-title":"Communications in Mathematical Physics"},{"key":"77_CR15","doi-asserted-by":"crossref","unstructured":"Worsch, T.: Programming Environments for Cellular Automata,Technical report 37\/96, Universitat Karlsruhe, Fakultat fur Informatik (1996)","DOI":"10.1007\/978-1-4471-0941-9_1"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30479-1_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:54:08Z","timestamp":1605761648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30479-1_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540235965","9783540304791"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30479-1_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}