{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:33:06Z","timestamp":1767339186306,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819981373"},{"type":"electronic","value":"9789819981380"}],"license":[{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-99-8138-0_4","type":"book-chapter","created":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T10:02:23Z","timestamp":1700906543000},"page":"38-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bloomfilter-Based Practical Kernelization Algorithms for\u00a0Minimum Satisfiability"],"prefix":"10.1007","author":[{"given":"Chao","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liting","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"key":"4_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"1\u20133","key":"4_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.dam.2003.03.002","volume":"142","author":"J Chen","year":"2004","unstructured":"Chen, J., Kanj, I.: Improved exact algorithms for Max-SAT. Discret. Appl. Math. 142(1\u20133), 17\u201327 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335\u2013354 (1999)","journal-title":"J. Algorithms"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2017.01.020","volume":"670","author":"J Chen","year":"2017","unstructured":"Chen, J., Xu, C., Wang, J.: Dealing with 4-variables by resolution: an improved MaxSAT algorithm. Theoret. Comput. Sci. 670, 33\u201344 (2017)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S0895480191220836","volume":"7","author":"R Kohli","year":"1994","unstructured":"Kohli, R., Krishnamurti, R., Mirchandani, P.: The minimum satisfiability problem. SIAM J. Discret. Math. 7(2), 275\u2013283 (1994)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(96)00031-2","volume":"58","author":"MV Marathe","year":"1996","unstructured":"Marathe, M.V., Ravi, S.S.: On approximation algorithms for the minimum satisfiability problem. Inf. Process. Lett. 58(1), 23\u201329 (1996)","journal-title":"Inf. Process. Lett."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.dam.2021.07.016","volume":"319","author":"U Arif","year":"2022","unstructured":"Arif, U., Benkoczi, R., Gaur, D.R., et al.: A primal-dual approximation algorithm for Minsat. Discret. Appl. Math. 319, 372\u2013381 (2022)","journal-title":"Discret. Appl. Math."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Markakis, E., Papasotiropoulos, G.: Computational aspects of conditional minisum approval voting in elections with interdependent issues. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 304\u2013310 (2020)","DOI":"10.24963\/ijcai.2020\/43"},{"key":"4_CR9","unstructured":"Ansotegui, C., Li, C.M., Many\u00e1, F., et al.: A SAT-based approach to MinSAT. In: CCIA, pp. 185\u2013189 (2012)"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1093\/jigpal\/jzz028","volume":"29","author":"CM Li","year":"2021","unstructured":"Li, C.M., Xiao, F., Many\u00e1, F.: A resolution calculus for MinSAT. Logic J. IGPL 29(1), 28\u201344 (2021)","journal-title":"Logic J. IGPL"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Heras, F., Morgado, A., Planes, J., et al.: Iterative SAT solving for minimum satisfiability. In: 2012 IEEE 24th International Conference on Tools with Artificial Intelligence, Athens Greece, pp. 922\u2013927. IEEE(2012)","DOI":"10.1109\/ICTAI.2012.129"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-14186-7_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"CM Li","year":"2010","unstructured":"Li, C.M., Many\u00e0, F., Quan, Z., Zhu, Z.: Exact MinSAT solving. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 363\u2013368. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14186-7_33"},{"key":"4_CR13","unstructured":"Li, C.M., Zhu, Z., Manya, F., et al.: Minimum satisfiability and its applications. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp. 605\u2013610. AAAI Press (2011)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Bliznets, I., Sagunov, D., Simonov, K.: Fine-grained complexity of partial minimum satisfiability. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, pp. 1774\u20131780 (2022)","DOI":"10.24963\/ijcai.2022\/247"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","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. J. ACM 7(3), 201\u2013215 (1960)","journal-title":"J. ACM"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J Chen","year":"2001","unstructured":"Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms 41(2), 280\u2013301 (2001)","journal-title":"J. Algorithms"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1997)","journal-title":"SIAM J. Comput."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Wang, Z., Liu, K., Xu, C.: A bloom filter-based algorithm for fast detection of common variables. In: Proceedings of the 1st International Conference on the Frontiers of Robotics and Software Engineering (FRSE) (2023, accepted)","DOI":"10.1109\/FRSE58934.2023.00015"},{"issue":"7","key":"4_CR19","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time tradeoffs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"}],"container-title":["Communications in Computer and Information Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8138-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:29:41Z","timestamp":1710350981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8138-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,26]]},"ISBN":["9789819981373","9789819981380"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8138-0_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,11,26]]},"assertion":[{"value":"26 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"1274","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":"650","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":"51% - 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":"4.14","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":"2.46","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}