{"id":"https://openalex.org/W2295061292","doi":"https://doi.org/10.29007/jmxj","title":"\u03bdZ - Maximal Satisfaction with Z3","display_name":"\u03bdZ - Maximal Satisfaction with Z3","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2295061292","doi":"https://doi.org/10.29007/jmxj","mag":"2295061292"},"language":"en","primary_location":{"id":"doi:10.29007/jmxj","doi":"https://doi.org/10.29007/jmxj","is_oa":true,"landing_page_url":"https://doi.org/10.29007/jmxj","pdf_url":"https://easychair.org/publications/open/xbn","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/xbn","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091080723","display_name":"Nikolaj Bj\u00f8rner","orcid":"https://orcid.org/0000-0002-1695-2810","observed_orcids":["https://orcid.org/0000-0002-1695-2810"]},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikolaj Bjorner","raw_affiliation_strings":["Microsoft Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008588284","display_name":"Anh-Dung Phan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Anh-Dung Phan","raw_affiliation_strings":["Technical University of Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091080723"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":5.5838,"has_fulltext":true,"cited_by_count":61,"citation_normalized_percentile":{"value":0.97037164,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"30","issue":null,"first_page":"1","last_page":""},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9365000128746033,"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.9365000128746033,"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/T10126","display_name":"Logic, programming, and type systems","score":0.03629999980330467,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.013899999670684338,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/z","display_name":"Z","score":0.859000027179718},{"id":"https://openalex.org/keywords/z3-smt-solver","display_name":"Z3 SMT solver","score":0.8119999766349792},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"satisfiability modulo theories","score":0.8709999918937683},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.6940000057220459},{"id":"https://openalex.org/keywords/pareto-front","display_name":"Pareto front","score":0.7490000128746033},{"id":"https://openalex.org/keywords/lexicographic-optimization","display_name":"lexicographic optimization","score":0.921999990940094},{"id":"https://openalex.org/keywords/model-generation","display_name":"model generation","score":0.43299999833106995},{"id":"https://openalex.org/keywords/objective-function","display_name":"objective function","score":0.6110000014305115}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8632481098175049},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7310210466384888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6513275504112244},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6299191117286682},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5536714196205139},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.48484504222869873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4656532406806946},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4631699025630951},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.45456722378730774},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4321930408477783},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40397435426712036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39615488052368164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39151453971862793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29742011427879333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.166835755109787},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/jmxj","doi":"https://doi.org/10.29007/jmxj","is_oa":true,"landing_page_url":"https://doi.org/10.29007/jmxj","pdf_url":"https://easychair.org/publications/open/xbn","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/jmxj","doi":"https://doi.org/10.29007/jmxj","is_oa":true,"landing_page_url":"https://doi.org/10.29007/jmxj","pdf_url":"https://easychair.org/publications/open/xbn","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2295061292.pdf","grobid_xml":"https://content.openalex.org/works/W2295061292.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W37002918","https://openalex.org/W89830494","https://openalex.org/W139322340","https://openalex.org/W1480909796","https://openalex.org/W1489277650","https://openalex.org/W1496468608","https://openalex.org/W1548812055","https://openalex.org/W1553068379","https://openalex.org/W1739325077","https://openalex.org/W1824587283","https://openalex.org/W1852879971","https://openalex.org/W1975041710","https://openalex.org/W2125967324","https://openalex.org/W2154352023","https://openalex.org/W2157056800","https://openalex.org/W2951613327"],"related_works":["https://openalex.org/W602497127","https://openalex.org/W1480909796","https://openalex.org/W3021334088","https://openalex.org/W7101072788","https://openalex.org/W3029402327","https://openalex.org/W7098506109","https://openalex.org/W2165899067","https://openalex.org/W4230861591","https://openalex.org/W3013541062","https://openalex.org/W64150172"],"abstract_inverted_index":{"Satisfiability":[0],"Modulo":[1],"Theories,":[2],"SMT,":[3],"solvers":[4,31],"are":[5,32,39,44,62,142],"used":[6,34],"in":[7,57],"many":[8,46,58],"applications.":[9],"These":[10],"applications":[11,47],"benefit":[12],"from":[13,86],"the":[14,120],"power":[15],"of":[16,81,126],"tuned":[17],"and":[18,26,64,137],"scalable":[19],"theorem":[20],"proving":[21],"technologies":[22],"for":[23,128],"supported":[24],"logics":[25],"specialized":[27],"theory":[28],"solvers.":[29],"SMT":[30,84,134],"primarily":[33],"to":[35,53,75,92],"determine":[36],"whether":[37],"formulas":[38,43],"satisfiable.":[40],"Furthermore,":[41],"when":[42],"satisfiable,":[45],"need":[48],"models":[49],"that":[50,110],"assign":[51],"values":[52],"free":[54],"variables.":[55],"Yet,":[56],"cases":[59],"arbitrary":[60],"assignments":[61],"insufficient,":[63],"what":[65],"is":[66,69,97,123,152],"really":[67],"needed":[68],"an":[70,83,106],"optimal":[71],"assignment":[72],"with":[73,101,117],"respect":[74],"objective":[76,94,114,151],"functions.":[77],"So":[78],"far,":[79],"users":[80,112],"Z3,":[82],"solver":[85],"Microsoft":[87],"Research,":[88],"build":[89],"custom":[90],"loops":[91],"achieve":[93],"values.":[95],"This":[96],"no":[98],"longer":[99],"necessary":[100],"\u03bdZ":[102],"(new-Z,":[103],"or":[104,149],"max-Z),":[105],"extension":[107],"within":[108],"Z3":[109],"lets":[111],"formulate":[113],"functions":[115,141],"directly":[116],"Z3.":[118],"Under":[119],"hood":[121],"there":[122],"a":[124],"portfolio":[125],"approaches":[127],"solving":[129],"linear":[130],"optimization":[131],"problems":[132],"over":[133],"formulas,":[135],"MaxSMT,":[136],"their":[138],"combinations.":[139],"Objective":[140],"combined":[143],"as":[144],"either":[145],"Pareto":[146],"fronts,":[147],"lexicographically,":[148],"each":[150],"optimized":[153],"independently.":[154]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":10}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}