{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:33:48Z","timestamp":1766306028229,"version":"3.48.0"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"vor","delay-in-days":266,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.09.351","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T22:13:13Z","timestamp":1762467193000},"page":"2301-2309","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Answer Set Searching with Weighted MaxSAT"],"prefix":"10.1016","volume":"270","author":[{"given":"Arkadiusz","family":"Nowakowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Wieczorek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Str\u0105k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.09.351_bib1","doi-asserted-by":"crossref","unstructured":"Weronika T Adrian, Mario Alviano, Francesco Calimeri, Bernardo Cuteri, Carmine Dodaro, Wolfgang Faber, Davide Fusc\u00e0, Nicola Leone, Marco Manna, Simona Perri, et al. The asp system dlv: advancements and applications. KI-K\u00fcnstliche Intelligenz, 32:177\u2013179, 2018.","DOI":"10.1007\/s13218-018-0533-0"},{"key":"10.1016\/j.procs.2025.09.351_bib2","doi-asserted-by":"crossref","unstructured":"Mario Alviano, Francesco Calimeri, Carmine Dodaro, Davide Fusc\u00e0, Nicola Leone, Simona Perri, Francesco Ricca, Pierfrancesco Veltri, and Jessica Zangari. The asp system dlv2. In Logic Programming and Nonmonotonic Reasoning: 14th International Conference, LPNMR 2017, Espoo, Finland, July 3-6, 2017, Proceedings 14, pages 215\u2013221. Springer, 2017.","DOI":"10.1007\/978-3-319-61660-5_19"},{"key":"10.1016\/j.procs.2025.09.351_bib3","doi-asserted-by":"crossref","unstructured":"Mario Alviano, Carmine Dodaro, Nicola Leone, and Francesco Ricca. Advances in wasp. In Logic Programming and Nonmonotonic Reasoning: 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015. Proceedings 13, pages 40\u201354. Springer, 2015.","DOI":"10.1007\/978-3-319-23264-5_5"},{"key":"10.1016\/j.procs.2025.09.351_bib4","doi-asserted-by":"crossref","unstructured":"Chitta Baral. Knowledge representation, reasoning and declarative problem solving. Cambridge university press, 2003.","DOI":"10.1017\/CBO9780511543357"},{"key":"10.1016\/j.procs.2025.09.351_bib5","unstructured":"Jeremias Berg, Matti J\u00e4rvisalo, Ruben Martins, and Andreas Niskanen, editors. MaxSAT Evaluation 2023: Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B. Department of Computer Science, University of Helsinki, Finland, 2023."},{"key":"10.1016\/j.procs.2025.09.351_bib6","doi-asserted-by":"crossref","unstructured":"Ethan D Bloch. Proofs and fundamentals: a first course in abstract mathematics. Springer Science & Business Media, 2011.","DOI":"10.1007\/978-1-4419-7127-2"},{"key":"10.1016\/j.procs.2025.09.351_bib7","doi-asserted-by":"crossref","unstructured":"Andreas Falkner, Gerhard Friedrich, Konstantin Schekotihin, Richard Taupe, and Erich C Teppan. Industrial applications of answer set programming. KI-K\u00fcnstliche Intelligenz, 32(2-3):165\u2013176, 2018.","DOI":"10.1007\/s13218-018-0548-6"},{"key":"10.1016\/j.procs.2025.09.351_bib8","doi-asserted-by":"crossref","unstructured":"Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. Multi-shot asp solving with clingo. Theory and Practice of Logic Programming, 19(1):27\u201382, 2019.","DOI":"10.1017\/S1471068418000054"},{"key":"10.1016\/j.procs.2025.09.351_bib9","doi-asserted-by":"crossref","unstructured":"Martin Gebser, Benjamin Kaufmann, and Torsten Schaub. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence, 187:52\u201389, 2012.","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"10.1016\/j.procs.2025.09.351_bib10","doi-asserted-by":"crossref","unstructured":"Martin Gebser, Joohyung Lee, and Yuliya Lierler. On elementary loops of logic programs. Theory and Practice of Logic Programming, 11(6):953\u2013988, 2011.","DOI":"10.1017\/S1471068411000019"},{"key":"10.1016\/j.procs.2025.09.351_bib11","doi-asserted-by":"crossref","unstructured":"Martin Gebser, Marco Maratea, and Francesco Ricca. The seventh answer set programming competition: Design and results. Theory and Practice of Logic Programming, 20(2):176\u2013204, 2020.","DOI":"10.1017\/S1471068419000061"},{"key":"10.1016\/j.procs.2025.09.351_bib12","doi-asserted-by":"crossref","unstructured":"Tomi Janhunen. Some (in) translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics, 16(1-2):35\u201386, 2006.","DOI":"10.3166\/jancl.16.35-86"},{"key":"10.1016\/j.procs.2025.09.351_bib13","doi-asserted-by":"crossref","unstructured":"Tomi Janhunen and Ilkka Niemel\u00e4. Compact translations of non-disjunctive answer set programs to propositional clauses. In Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, pages 111\u2013130. Springer, 2011.","DOI":"10.1007\/978-3-642-20832-4_8"},{"key":"10.1016\/j.procs.2025.09.351_bib14","doi-asserted-by":"crossref","unstructured":"Roland Kaminski, Javier Romero, Torsten Schaub, and Philipp Wanko. How to build your own asp-based system?! Theory and Practice of Logic Programming, 23(1):299\u2013361, 2023.","DOI":"10.1017\/S1471068421000508"},{"key":"10.1016\/j.procs.2025.09.351_bib15","unstructured":"Donald E Knuth. The art of computer programming, Volume 4, Fascicle 6: Satisfability. Addison-Wesley Professional, 2015."},{"key":"10.1016\/j.procs.2025.09.351_bib16","doi-asserted-by":"crossref","unstructured":"Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello. The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic (TOCL), 7(3):499\u2013562, 2006.","DOI":"10.1145\/1149114.1149117"},{"key":"10.1016\/j.procs.2025.09.351_bib17","unstructured":"O. Levin. Discrete Mathematics: An Open Introduction. Online access: Center for Open Education Open Textbook Library. CreateSpace Independent Publishing Platform, 2016."},{"key":"10.1016\/j.procs.2025.09.351_bib18","unstructured":"Yuliya Lierler. SAT-based answer set programming. PhD thesis, University of Texas, 2010."},{"key":"10.1016\/j.procs.2025.09.351_bib19","doi-asserted-by":"crossref","unstructured":"Yuliya Lierler and Marco Maratea. Cmodels-2: Sat-based answer set solver enhanced to non-tight programs. In Logic Programming and Nonmonotonic Reasoning: 7th International Conference, LPNMR 2004 Fort Lauderdale, FL, USA, January 6-8, 2004 Proceedings 7, pages 346\u2013350. Springer, 2004.","DOI":"10.1007\/978-3-540-24609-1_32"},{"issue":"1","key":"10.1016\/j.procs.2025.09.351_bib20","article-title":"Cmodels: Sat-based answer set programming system","volume":"20","author":"Lierler","year":"2007","journal-title":"ALP Newsletter"},{"key":"10.1016\/j.procs.2025.09.351_bib21","doi-asserted-by":"crossref","unstructured":"Vladimir Lifschitz. Answer set programming. Springer Heidelberg, 2019.","DOI":"10.1007\/978-3-030-24658-7"},{"key":"10.1016\/j.procs.2025.09.351_bib22","doi-asserted-by":"crossref","unstructured":"Fangzhen Lin and Yuting Zhao. Assat: Computing answer sets of a logic program by sat solvers. Artificial Intelligence, 157(1-2):115\u2013137, 2004.","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"10.1016\/j.procs.2025.09.351_bib23","doi-asserted-by":"crossref","unstructured":"Ilkka Niemel\u00e4. Logic programs with stable model semantics as a constraint programming paradigm. Annals of mathematics and Artificial Intelligence, 25:241\u2013273, 1999.","DOI":"10.1023\/A:1018930122475"},{"key":"10.1016\/j.procs.2025.09.351_bib24","doi-asserted-by":"crossref","unstructured":"Patrik Simons, Ilkka Niemel\u00e4, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181\u2013234, 2002.","DOI":"10.1016\/S0004-3702(02)00187-X"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925030248?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925030248?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:31:11Z","timestamp":1766305871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050925030248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":24,"alternative-id":["S1877050925030248"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.351","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Answer Set Searching with Weighted MaxSAT","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.351","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}