{"id":"https://openalex.org/W4415974892","doi":"https://doi.org/10.1016/j.procs.2025.09.351","title":"Answer Set Searching with Weighted MaxSAT","display_name":"Answer Set Searching with Weighted MaxSAT","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415974892","doi":"https://doi.org/10.1016/j.procs.2025.09.351"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.09.351","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.351","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.09.351","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030111607","display_name":"Arkadiusz Nowakowski","orcid":"https://orcid.org/0000-0001-8304-5746"},"institutions":[{"id":"https://openalex.org/I864159182","display_name":"University of Silesia in Katowice","ror":"https://ror.org/0104rcc94","country_code":"PL","type":"education","lineage":["https://openalex.org/I864159182"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Arkadiusz Nowakowski","raw_affiliation_strings":["Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland","institution_ids":["https://openalex.org/I864159182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021657351","display_name":"Wojciech Wieczorek","orcid":"https://orcid.org/0000-0003-3191-9151"},"institutions":[{"id":"https://openalex.org/I62088572","display_name":"University of Bielsko-Bia\u0142a","ror":"https://ror.org/01ew38b77","country_code":"PL","type":"education","lineage":["https://openalex.org/I62088572"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Wojciech Wieczorek","raw_affiliation_strings":["Department of Computer Science and Automatics, University of Bielsko-Biala, Willowa 2, 43-309 Bielsko-Bia\u0142a, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Automatics, University of Bielsko-Biala, Willowa 2, 43-309 Bielsko-Bia\u0142a, Poland","institution_ids":["https://openalex.org/I62088572"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082516283","display_name":"\u0141ukasz Str\u0105k","orcid":"https://orcid.org/0000-0002-1074-2847"},"institutions":[{"id":"https://openalex.org/I864159182","display_name":"University of Silesia in Katowice","ror":"https://ror.org/0104rcc94","country_code":"PL","type":"education","lineage":["https://openalex.org/I864159182"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"\u0141ukasz Str\u0105k","raw_affiliation_strings":["Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland","institution_ids":["https://openalex.org/I864159182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030111607"],"corresponding_institution_ids":["https://openalex.org/I864159182"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29102029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"270","issue":null,"first_page":"2301","last_page":"2309"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9793999791145325,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9793999791145325,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.0044999998062849045,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0026000000070780516,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.8614000082015991},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.7497000098228455},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7213000059127808},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6468999981880188},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.46810001134872437},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.4083000123500824},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.3928999900817871},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.38670000433921814}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8614000082015991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8277999758720398},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.7497000098228455},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7213000059127808},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6468999981880188},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.46810001134872437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45739999413490295},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.4083000123500824},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3874000012874603},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.38670000433921814},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.3287000060081482},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32739999890327454},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3237000107765198},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C159032336","wikidata":"https://www.wikidata.org/wiki/Q2488768","display_name":"Non-monotonic logic","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.09.351","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.351","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.09.351","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.351","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W89328955","https://openalex.org/W1481719343","https://openalex.org/W1606891084","https://openalex.org/W1976055110","https://openalex.org/W2004414305","https://openalex.org/W2011124182","https://openalex.org/W2049791401","https://openalex.org/W2050842068","https://openalex.org/W2117009583","https://openalex.org/W2152131859","https://openalex.org/W2211798527","https://openalex.org/W2501684694","https://openalex.org/W2733732676","https://openalex.org/W2801780491","https://openalex.org/W2808078614","https://openalex.org/W2938140678","https://openalex.org/W2963234253","https://openalex.org/W4206322461","https://openalex.org/W4254790956"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3],"new":[4],"non-native":[5],"solver":[6],"for":[7],"Answer":[8],"Set":[9],"Programming":[10],"(ASP)":[11],"named":[12],"maxmodels.":[13],"It":[14],"is":[15],"based":[16],"on":[17,37],"translating":[18],"logic":[19],"normal":[20],"programs":[21],"into":[22],"weighted":[23],"MaxSAT":[24],"clauses.":[25],"We":[26],"checked":[27],"our":[28],"proposal\u2019s":[29],"computational":[30],"efficiency":[31],"in":[32,59,66],"the":[33,43],"series":[34],"of":[35],"experiments":[36],"selected":[38],"NP-hard":[39],"optimization":[40],"problems":[41,61],"against":[42],"state-of-the-art":[44],"ASP":[45],"solvers":[46,58],"dlv,":[47],"clingo,":[48],"and":[49],"smodels.":[50],"Our":[51],"findings":[52],"indicate":[53],"that":[54],"maxmodels":[55],"outperforms":[56],"other":[57],"certain":[60],"while":[62],"also":[63],"being":[64],"competitive":[65],"others.":[67]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-06T00:00:00"}