{"id":"https://openalex.org/W2995736486","doi":"https://doi.org/10.3233/sat190119","title":"MaxSAT Evaluation 2018: New Developments and Detailed Results","display_name":"MaxSAT Evaluation 2018: New Developments and Detailed Results","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2995736486","doi":"https://doi.org/10.3233/sat190119","mag":"2995736486"},"language":"en","primary_location":{"id":"doi:10.3233/sat190119","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190119","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190119?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190119","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/sat190119?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190119","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079263019","display_name":"Fahiem Bacchus","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Fahiem Bacchus","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Canada. E-mail:\u00a0fbacchus@cs.toronto.edu"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Canada. E-mail:\u00a0fbacchus@cs.toronto.edu","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081120128","display_name":"Matti J\u0084\u00e4rvisalo","orcid":"https://orcid.org/0000-0003-2572-063X"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Matti J\u00e4rvisalo","raw_affiliation_strings":["HIIT, Department of Computer Science, University of Helsinki, Finland. E-mail:\u00a0matti.jarvisalo@helsinki.fi"],"affiliations":[{"raw_affiliation_string":"HIIT, Department of Computer Science, University of Helsinki, Finland. E-mail:\u00a0matti.jarvisalo@helsinki.fi","institution_ids":["https://openalex.org/I133731052"]}]},{"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":true,"raw_author_name":"Ruben Martins","raw_affiliation_strings":["Department of Computer Science, Carnegie Mellon University, USA. E-mail:\u00a0rubenm@andrew.cmu.edu"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Carnegie Mellon University, USA. E-mail:\u00a0rubenm@andrew.cmu.edu","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081120128","https://openalex.org/A5101995804"],"corresponding_institution_ids":["https://openalex.org/I133731052","https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":2.3996,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.90266598,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"11","issue":"1","first_page":"99","last_page":"131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.8974999785423279,"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/T10142","display_name":"Formal Methods in Verification","score":0.8974999785423279,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.9541836977005005},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5688502192497253},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.517646849155426},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.5176315903663635},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4917915165424347},{"id":"https://openalex.org/keywords/radiomics","display_name":"Radiomics","score":0.43416327238082886},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34444087743759155},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2791237235069275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.263006329536438},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.19340133666992188}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.9541836977005005},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5688502192497253},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.517646849155426},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.5176315903663635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4917915165424347},{"id":"https://openalex.org/C2778559731","wikidata":"https://www.wikidata.org/wiki/Q23808793","display_name":"Radiomics","level":2,"score":0.43416327238082886},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34444087743759155},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2791237235069275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.263006329536438},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.19340133666992188},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/sat190119","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190119","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190119?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190119","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:helda.helsinki.fi:10138/309300","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/309300","pdf_url":"http://hdl.handle.net/10138/309300","source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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/sat190119","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190119","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190119?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190119","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/F4320319180","display_name":"Carnegie Mellon Portugal","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2995736486.pdf","grobid_xml":"https://content.openalex.org/works/W2995736486.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W78552530","https://openalex.org/W111060146","https://openalex.org/W134459671","https://openalex.org/W153078869","https://openalex.org/W193033351","https://openalex.org/W333834217","https://openalex.org/W1531103278","https://openalex.org/W1952747621","https://openalex.org/W2029958553","https://openalex.org/W2033274122","https://openalex.org/W2116758077","https://openalex.org/W2163267264","https://openalex.org/W2185680923","https://openalex.org/W2210398979","https://openalex.org/W2288090202","https://openalex.org/W2395737562","https://openalex.org/W2407856297","https://openalex.org/W2481363456","https://openalex.org/W2514527293","https://openalex.org/W2621070371","https://openalex.org/W2742479925","https://openalex.org/W2752537240","https://openalex.org/W2774512527","https://openalex.org/W2789103885","https://openalex.org/W2795735404","https://openalex.org/W2808345295","https://openalex.org/W2809265824","https://openalex.org/W2809690215","https://openalex.org/W2809729522","https://openalex.org/W2810136497","https://openalex.org/W2810449204","https://openalex.org/W2810703768","https://openalex.org/W2888144801","https://openalex.org/W2964122198","https://openalex.org/W3104044769"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2102364390","https://openalex.org/W2336941104","https://openalex.org/W1913543287","https://openalex.org/W2571882453","https://openalex.org/W4211028879"],"abstract_inverted_index":{"The":[0],"series":[1],"of":[2,18,28,37,45,59,70],"MaxSAT":[3],"Evaluations,":[4],"organized":[5],"yearly":[6],"since":[7],"2006,":[8],"has":[9],"been":[10],"the":[11,16,19,24,38,46,60,71],"main":[12,47],"forum":[13],"for":[14,23],"evaluating":[15],"state":[17],"art":[20],"in":[21,50,65],"solvers":[22,61],"Boolean":[25],"optimization":[26],"paradigm":[27],"maximum":[29],"satisfiability":[30],"(MaxSAT).":[31],"This":[32],"article":[33],"provides":[34],"an":[35,57],"overview":[36,58],"2018":[39,72],"Max-SAT":[40],"Evaluation,":[41],"including":[42],"a":[43,53],"description":[44],"changes":[48],"made":[49],"2017":[51],"under":[52],"new":[54],"organizing":[55],"team,":[56],"and":[62,67],"benchmarks":[63],"submitted":[64],"2018,":[66],"detailed":[68],"results":[69],"evaluation.":[73]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}