{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:25:14Z","timestamp":1743150314074,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030788100"},{"type":"electronic","value":"9783030788117"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78811-7_51","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:22:37Z","timestamp":1625613757000},"page":"543-552","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compositional Object Synthesis in Game of Life Cellular Automata Using SAT Solver"],"prefix":"10.1007","author":[{"given":"Haruki","family":"Nishimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koji","family":"Hasebe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"51_CR1","unstructured":"z3py-tutorial. https:\/\/github.com\/ericpony\/z3py-tutorial"},{"key":"51_CR2","unstructured":"Bayardo Jr., R.J., Schrag, R.C.: Using CSP look-back techniques to solve real world SAT instances. In: 14th AAAI, pp. 203\u2013208 (1997)"},{"key":"51_CR3","first-page":"118","volume":"58","author":"A Biere","year":"2003","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Adv. Comput. 58, 118\u2013149 (2003)","journal-title":"Adv. Comput."},{"key":"51_CR4","volume-title":"Model Checking","author":"E Clarke","year":"2018","unstructured":"Clarke, E., Grumberg, O., Kroening, D., Peled, D., Veith, H.: Model Checking, 2nd edn. MIT press, Cambridge (2018)","edition":"2"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: 3rd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"51_CR6","unstructured":"Cunningham, O.: Logic-life-search. https:\/\/github.com\/OscarCunningham\/logic-life-search"},{"issue":"4","key":"51_CR7","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(4), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"51_CR8","first-page":"758","volume":"49","author":"NG De Bruijn","year":"1946","unstructured":"De. Bruijn, N.G.: A combinatorial problem. Proc. Koninklijke Nederlandse Academie van Wetenschappen 49, 758\u2013764 (1946)","journal-title":"Proc. Koninklijke Nederlandse Academie van Wetenschappen"},{"key":"51_CR9","unstructured":"Eppstein, D.: gfind 4.9 - search for gliders in semitotalistic cellular automata. https:\/\/www.ics.uci.edu\/eppstein\/ca\/gfind.c"},{"key":"51_CR10","unstructured":"Eppstein, D.: Searching for spaceships. arXiv prepring. cs\/0004003 (2000)"},{"key":"51_CR11","unstructured":"Goucher, A.P.: Metasat. https:\/\/gitlab.com\/apgoucher\/metasat"},{"key":"51_CR12","volume-title":"The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability","author":"DE Knuth","year":"2015","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability. Addison-Wesley Professional, Boston (2015)"},{"key":"51_CR13","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: a new search algorithm for satisfiability. In: Digest of ICCAD, pp. 220\u2013227 (1996)"},{"key":"51_CR14","unstructured":"McIntosh, H.V.: Linear cellular automata via de Bruijn diagram. Universidad Aut\u00f3noma de Puebla (1991)"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-1-84996-217-9_4","volume-title":"Game of Life Cellular Automata","author":"HV McIntosh","year":"2010","unstructured":"McIntosh, H.V.: Life\u2019s still lifes. In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 35\u201350. Springer, London (2010). https:\/\/doi.org\/10.1007\/978-1-84996-217-9_4"},{"key":"51_CR16","unstructured":"McIntosh, H.V.: Commentaries on the global dynamics of cellular automata. http:\/\/delta.cs.cinvestav.mx\/mcintosh\/oldweb\/wandl\/wandl.html"},{"key":"51_CR17","volume-title":"Cellular Automata: A Discrete View of the World","author":"JL Schiff","year":"2011","unstructured":"Schiff, J.L.: Cellular Automata: A Discrete View of the World. John Wiley and Sons, Inc., Hoboken (2011)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78811-7_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:31:03Z","timestamp":1625614263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78811-7_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030788100","9783030788117"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78811-7_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}