{"id":"https://openalex.org/W2995391524","doi":"https://doi.org/10.3233/sat190118","title":"Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT","display_name":"Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2995391524","doi":"https://doi.org/10.3233/sat190118","mag":"2995391524"},"language":"en","primary_location":{"id":"doi:10.3233/sat190118","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190118","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190118?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190118","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190118?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190118","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101548497","display_name":"Saurabh Joshi","orcid":"https://orcid.org/0000-0001-8070-1525"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Saurabh Joshi","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Kandi, Sangareddy, Telangana - 502285, India. E-mails:\u00a0sbjoshi@iith.ac.in,\u00a0cs15btech11031@iith.ac.in,\u00a0cs15btech11036@iith.ac.in"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Kandi, Sangareddy, Telangana - 502285, India. E-mails:\u00a0sbjoshi@iith.ac.in,\u00a0cs15btech11031@iith.ac.in,\u00a0cs15btech11036@iith.ac.in","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036210860","display_name":"Prateek Kumar","orcid":"https://orcid.org/0000-0003-2089-8463"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Prateek Kumar","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Kandi, Sangareddy, Telangana - 502285, India. E-mails:\u00a0sbjoshi@iith.ac.in,\u00a0cs15btech11031@iith.ac.in,\u00a0cs15btech11036@iith.ac.in"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Kandi, Sangareddy, Telangana - 502285, India. E-mails:\u00a0sbjoshi@iith.ac.in,\u00a0cs15btech11031@iith.ac.in,\u00a0cs15btech11036@iith.ac.in","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089764662","display_name":"Sukrut Rao","orcid":"https://orcid.org/0000-0001-8896-7619"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sukrut Rao","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Kandi, Sangareddy, Telangana - 502285, India. E-mails:\u00a0sbjoshi@iith.ac.in,\u00a0cs15btech11031@iith.ac.in,\u00a0cs15btech11036@iith.ac.in"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Kandi, Sangareddy, Telangana - 502285, India. E-mails:\u00a0sbjoshi@iith.ac.in,\u00a0cs15btech11031@iith.ac.in,\u00a0cs15btech11036@iith.ac.in","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101995804","display_name":"Ruben Martins","orcid":"https://orcid.org/0000-0003-1525-1382"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruben Martins","raw_affiliation_strings":["Department of Computer Science, Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh, PA 15213, USA. E-mail:\u00a0rubenm@andrew.cmu.edu"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh, PA 15213, USA. E-mail:\u00a0rubenm@andrew.cmu.edu","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5036210860","https://openalex.org/A5089764662","https://openalex.org/A5101548497"],"corresponding_institution_ids":["https://openalex.org/I65181880"],"apc_list":null,"apc_paid":null,"fwci":0.6,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.72558792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"11","issue":"1","first_page":"73","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.8323000073432922,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.8323000073432922,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.8158000111579895,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10703","display_name":"Business Process Modeling and Analysis","score":0.795199990272522,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.8489056825637817},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5055005550384521},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48561564087867737},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44055458903312683},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3625878095626831},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26032575964927673}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.8489056825637817},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5055005550384521},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48561564087867737},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44055458903312683},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3625878095626831},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26032575964927673},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/sat190118","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190118","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190118?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190118","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:raiith.iith.ac.in:6998","is_oa":false,"landing_page_url":"http://raiith.iith.ac.in/6998/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400292","display_name":"Research Archive of Indian Institute of Technology Hyderabad (Indian Institute of Technology Hyderabad)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I65181880","host_organization_name":"Indian Institute of Technology Hyderabad","host_organization_lineage":["https://openalex.org/I65181880"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.3233/sat190118","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190118","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190118?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190118","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7858740741","display_name":"SHF: Medium: Collaborative Research: Computer-Aided Programming for Data Science","funder_award_id":"1762363","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320719","display_name":"Department of Science and Technology, Ministry of Science and Technology, India","ror":"https://ror.org/0101xrq71"},{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2995391524.pdf","grobid_xml":"https://content.openalex.org/works/W2995391524.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W78552530","https://openalex.org/W134459671","https://openalex.org/W139194355","https://openalex.org/W333834217","https://openalex.org/W967127597","https://openalex.org/W990779306","https://openalex.org/W1885913205","https://openalex.org/W1952747621","https://openalex.org/W1998871699","https://openalex.org/W2033274122","https://openalex.org/W2102909639","https://openalex.org/W2116758077","https://openalex.org/W2131292691","https://openalex.org/W2185680923","https://openalex.org/W2199687903","https://openalex.org/W2395737562","https://openalex.org/W2407856297","https://openalex.org/W2481363456","https://openalex.org/W2508256772","https://openalex.org/W2549191282","https://openalex.org/W2621108739","https://openalex.org/W2739607635","https://openalex.org/W2808345295","https://openalex.org/W2809265824","https://openalex.org/W2809690215","https://openalex.org/W2809729522","https://openalex.org/W2810449204","https://openalex.org/W2888144801","https://openalex.org/W2950256943","https://openalex.org/W2963954089","https://openalex.org/W3103016263","https://openalex.org/W3104044769"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2301405299","https://openalex.org/W2118943303","https://openalex.org/W1979597421","https://openalex.org/W2952805501","https://openalex.org/W2007980826","https://openalex.org/W1775352280","https://openalex.org/W2498042365","https://openalex.org/W2951161395","https://openalex.org/W1492679536"],"abstract_inverted_index":{"Incomplete":[0],"MaxSAT":[1,39,104,125,131,135],"solving":[2],"aims":[3],"to":[4,11],"quickly":[5],"find":[6],"a":[7,54,84],"solution":[8],"that":[9,140],"attempts":[10],"minimize":[12],"the":[13,16,44,48,63,67,88,98,103,108,122,141,147,150],"sum":[14,68],"of":[15,18,43,65,69,71,149],"weights":[17,49,70],"unsatisfied":[19],"soft":[20],"clauses":[21,73],"without":[22],"providing":[23],"any":[24],"optimality":[25],"guarantees.":[26],"In":[27,41,57],"this":[28],"paper,":[29],"we":[30,46,60],"propose":[31],"two":[32],"approximation":[33,113],"strategies":[34,82,120,142],"for":[35],"improving":[36],"incomplete":[37,100,124],"weighted":[38,99],"solving.":[40],"one":[42],"strategies,":[45],"cluster":[47],"and":[50,95,134,138],"approximate":[51],"them":[52],"with":[53,121,146],"representative":[55],"weight.":[56],"another":[58],"strategy,":[59,91],"break":[61],"up":[62],"problem":[64],"minimizing":[66],"unsatisfiable":[72],"into":[74],"multiple":[75],"minimization":[76,90],"subproblems.":[77],"We":[78,117],"have":[79],"implemented":[80],"these":[81,119],"in":[83,97,102],"tool":[85],"Open-WBO-Inc.":[86],"Using":[87],"subproblem":[89],"Open-WBO-Inc":[92],"placed":[93,115],"first":[94],"second":[96],"tracks":[101],"Evaluation":[105,132,136],"2018":[106,137],"whereas":[107],"strategy":[109],"based":[110],"on":[111,127],"weight":[112],"was":[114],"fourth.":[116],"compare":[118],"best":[123,148],"solvers":[126],"benchmarks":[128],"taken":[129],"from":[130],"2017":[133],"show":[139],"proposed":[143],"are":[144],"competitive":[145],"solvers.":[151]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}