{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:57:25Z","timestamp":1743083845210,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030582845"},{"type":"electronic","value":"9783030582852"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58285-2_12","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T09:00:01Z","timestamp":1599728401000},"page":"163-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stable Resolving - A Randomized Local Search Heuristic for MaxSAT"],"prefix":"10.1007","author":[{"given":"Julian","family":"Reisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Gro\u00dfmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia","family":"Kliewer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,9]]},"reference":[{"key":"12_CR1","unstructured":"MaxSAT Evaluation 2019. \nhttps:\/\/maxsat-evaluations.github.io\/2019\/index.html"},{"key":"12_CR2","unstructured":"Starexec Cluster. \nhttps:\/\/www.starexec.org\/starexec\/public\/about.jsp\n\n. Accessed 2019"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G.C., Werneck, R.F.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525\u2013547 (2012). \nhttps:\/\/doi.org\/10.1007\/s10732-012-9196-4","journal-title":"J. Heuristics"},{"key":"12_CR4","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, San Francisco, CA, USA, pp. 399\u2013404 (2009)"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Bacchus, F., J\u00e4rvisalo, M., Martins, R.: MaxSAT evaluation 2018: new developments and detailed results. J. Satisf. Boolean Model. Comput. 11, 99\u2013131 (2019). \nhttps:\/\/doi.org\/10.3233\/SAT190119","DOI":"10.3233\/SAT190119"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-45221-5_7","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A Belov","year":"2013","unstructured":"Belov, A., Morgado, A., Marques-Silva, J.: SAT-based preprocessing for MaxSAT. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR 2013. LNCS, vol. 8312, pp. 96\u2013111. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-45221-5_7"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-19212-9_3","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"J Berg","year":"2019","unstructured":"Berg, J., Demirovi\u0107, E., Stuckey, P.J.: Core-boosted linear search for incomplete MaxSAT. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 39\u201356. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19212-9_3"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Berg, J., J\u00e4rvisalo, M.: Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability. Artif. Intell. 244, 110\u2013142 (2017). \nhttps:\/\/doi.org\/10.1016\/j.artint.2015.07.001\n\n. Combining Constraint Solving with Mining and Learning","DOI":"10.1016\/j.artint.2015.07.001"},{"key":"12_CR9","unstructured":"Berg, J., J\u00e4rvisalo, M., Malone, B.: Learning optimal bounded treewidth Bayesian networks via maximum satisfiability. In: Kaski, S., Corander, J. (eds.) Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 33, pp. 86\u201395. PMLR, Reykjavik, 22\u201325 April 2014"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10732-018-9386-9","volume":"25","author":"N Bouhmala","year":"2019","unstructured":"Bouhmala, N.: Combining simulated annealing with local search heuristic for Max-SAT. J. Heuristics 25(1), 47\u201369 (2019). \nhttps:\/\/doi.org\/10.1007\/s10732-018-9386-9","journal-title":"J. Heuristics"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)","DOI":"10.7249\/R366"},{"issue":"3","key":"12_CR12","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). \nhttps:\/\/doi.org\/10.1145\/321033.321034","journal-title":"J. ACM"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-30048-7_11","volume-title":"Principles and Practice of Constraint Programming","author":"E Demirovi\u0107","year":"2019","unstructured":"Demirovi\u0107, E., Stuckey, P.J.: Techniques inspired by local search for incomplete MaxSAT and the linear algorithm: varying resolution and solution-guided search. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 177\u2013194. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-30048-7_11"},{"key":"12_CR14","unstructured":"Fan, Y., Ma, Z., Su, K., Sattar, A., Li, C.: Ramp: a local search solver based on make-positive variables. In: MaxSAT Evaluation (2016)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-31087-4_18","volume-title":"Advanced Research in Applied Artificial Intelligence","author":"P Gro\u00dfmann","year":"2012","unstructured":"Gro\u00dfmann, P., H\u00f6lldobler, S., Manthey, N., Nachtigall, K., Opitz, J., Steinke, P.: Solving periodic event scheduling problems with SAT. In: Jiang, H., Ding, W., Ali, M., Wu, X. (eds.) IEA\/AIE 2012. LNCS (LNAI), vol. 7345, pp. 166\u2013175. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31087-4_18"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1007\/978-3-642-33558-7_67","volume-title":"Principles and Practice of Constraint Programming","author":"J Guerra","year":"2012","unstructured":"Guerra, J., Lynce, I.: Reasoning over biological networks using maximum satisfiability. In: Milano, M. (ed.) CP 2012. LNCS, pp. 941\u2013956. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33558-7_67"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-61708-6_53","volume-title":"KI-96: Advances in Artificial Intelligence","author":"HH Hoos","year":"1996","unstructured":"Hoos, H.H.: Solving hard combinatorial problems with GSAT\u2014A case study. In: G\u00f6rz, G., H\u00f6lldobler, S. (eds.) KI 1996. LNCS, vol. 1137, pp. 107\u2013119. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61708-6_53"},{"key":"12_CR18","unstructured":"Hyttinen, A., Eberhardt, F., J\u00e4rvisalo, M.: Constraint-based causal discovery: conflict resolution with answer set programming. In: Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence, pp. 340\u2013349 (2014)"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Lei, Z., Cai, S.: Solving (weighted) partial MaxSAT by dynamic local search for sat. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 1346\u20131352. International Joint Conferences on Artificial Intelligence Organization, July 2018. \nhttps:\/\/doi.org\/10.24963\/ijcai.2018\/187","DOI":"10.24963\/ijcai.2018\/187"},{"key":"12_CR20","unstructured":"Park, J.D.: Using weighted Max-SAT engines to solve MPE. In: Proceedings of the 18th National Conference on Artificial Intelligence, pp. 682\u2013687 (2002)"},{"key":"12_CR21","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 399\u2013419. Springer, Boston (2010). \nhttps:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13"},{"key":"12_CR22","unstructured":"Reisch, J., Gro\u00dfmann, P., Kliewer, N.: Conflict resolving - a maximum independent set heuristics for solving MaxSAT. In: Proceedings of the 22nd International Multiconference Information Society, vol. 1, pp. 67\u201371 (2019)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 521\u2013532 (1995)","DOI":"10.1090\/dimacs\/026\/25"}],"container-title":["Lecture Notes in Computer Science","KI 2020: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58285-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T09:04:46Z","timestamp":1599728686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58285-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030582845","9783030582852"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58285-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bamberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ki2020.uni-bamberg.de\/","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":"62","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":"16","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":"12","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":"26% - 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":"3","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":"3","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)"}},{"value":"Due to the Corona pandemic KI 2020 was held as a virtual event.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}