{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T09:45:38Z","timestamp":1723369538022},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s11704-021-0318-8","type":"journal-article","created":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T03:42:33Z","timestamp":1627962153000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An algorithm for solving satisfiability problem based on the structural information of formulas"],"prefix":"10.1007","volume":"15","author":[{"given":"Zaijun","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daoyun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jincheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,3]]},"reference":[{"key":"318_CR1","doi-asserted-by":"crossref","unstructured":"Cook S A. The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. 1971, 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"318_CR2","doi-asserted-by":"crossref","unstructured":"Tompkins D A D, Balint A, Hoos H H. Captain Jack: new variable selection heuristics in local search for SAT. In: Proceedings of the 14th International Conference on Theory and Application of Satisfiability Testing. 2011, 302\u2013316","DOI":"10.1007\/978-3-642-21581-0_24"},{"issue":"9","key":"318_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai S, Su K. Local search for Boolean Satisfiability with configuration checking and subscore. Artificial Intelligence, 2013, 204(9): 75\u201398","journal-title":"Artificial Intelligence"},{"key":"318_CR4","doi-asserted-by":"crossref","unstructured":"Balint A, Frohlich A. Improving stochastic local search for SAT with a new probability distribution. In: Proceedings of International Conference on Theory and Applications of Satisfiability Testing. 2010, 10\u201315","DOI":"10.1007\/978-3-642-14186-7_3"},{"issue":"6","key":"318_CR5","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1109\/TIT.2016.2555904","volume":"62","author":"A Li","year":"2016","unstructured":"Li A, Pan Y. Structural information and dynamical complexity of networks. IEEE Transactions on Information Theory, 2016, 62(6): 3290\u20133339","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-021-0318-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-021-0318-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-021-0318-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T12:32:03Z","timestamp":1674822723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-021-0318-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,3]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["318"],"URL":"https:\/\/doi.org\/10.1007\/s11704-021-0318-8","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,3]]},"assertion":[{"value":"5 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"156405"}}