{"id":"https://openalex.org/W2946717957","doi":"https://doi.org/10.29007/hh3v","title":"Competitive Sorter-based Encoding of PB-Constraints into SAT","display_name":"Competitive Sorter-based Encoding of PB-Constraints into SAT","publication_year":2019,"publication_date":"2019-03-15","ids":{"openalex":"https://openalex.org/W2946717957","doi":"https://doi.org/10.29007/hh3v","mag":"2946717957"},"language":"en","primary_location":{"id":"doi:10.29007/hh3v","is_oa":true,"landing_page_url":"https://doi.org/10.29007/hh3v","pdf_url":"https://easychair.org/publications/open/tsHw","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,"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"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/tsHw","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040694880","display_name":"Micha\u0142 Karpi\u0144ski","orcid":"https://orcid.org/0000-0002-4190-3033"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Karpi\u0144ski","raw_affiliation_strings":["Institute of Computer Science, University of Wroc law Joliot-Curie 15, 50-383 Wroc law, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroc law Joliot-Curie 15, 50-383 Wroc law, Poland","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042257072","display_name":"Marek Piotr\u00f3w","orcid":"https://orcid.org/0000-0002-4734-1721"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marek Piotr\u00f3w","raw_affiliation_strings":["Institute of Computer Science, University of Wroc law Joliot-Curie 15, 50-383 Wroc law, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroc law Joliot-Curie 15, 50-383 Wroc law, Poland","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":null,"first_page":"65","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"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.996399998664856,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9850000143051147,"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"}},{"id":"https://openalex.org/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9553999900817871,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7449253797531128},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.6716430187225342},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4790719449520111},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.44101792573928833},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4228341579437256},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.41339436173439026},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.37940847873687744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36187422275543213},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.313039630651474}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7449253797531128},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.6716430187225342},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4790719449520111},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.44101792573928833},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4228341579437256},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.41339436173439026},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.37940847873687744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36187422275543213},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.313039630651474}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/hh3v","is_oa":true,"landing_page_url":"https://doi.org/10.29007/hh3v","pdf_url":"https://easychair.org/publications/open/tsHw","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,"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/hh3v","is_oa":true,"landing_page_url":"https://doi.org/10.29007/hh3v","pdf_url":"https://easychair.org/publications/open/tsHw","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,"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":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2946717957.pdf","grobid_xml":"https://content.openalex.org/works/W2946717957.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W119771208","https://openalex.org/W1492234230","https://openalex.org/W1500127208","https://openalex.org/W1505671383","https://openalex.org/W1730820395","https://openalex.org/W1842378703","https://openalex.org/W2012413542","https://openalex.org/W2093039789","https://openalex.org/W2115083413","https://openalex.org/W2116758077","https://openalex.org/W2141389982","https://openalex.org/W2144040805","https://openalex.org/W2144842698","https://openalex.org/W2145825841","https://openalex.org/W2223094528","https://openalex.org/W2523638396","https://openalex.org/W2752061190","https://openalex.org/W2760875619","https://openalex.org/W3104744353","https://openalex.org/W4238998407","https://openalex.org/W4300428566","https://openalex.org/W4300624830"],"related_works":["https://openalex.org/W257150968","https://openalex.org/W3140601928","https://openalex.org/W1977451125","https://openalex.org/W2057159994","https://openalex.org/W2168881618","https://openalex.org/W1608751818","https://openalex.org/W86917440","https://openalex.org/W4252281389","https://openalex.org/W2050201153","https://openalex.org/W1557763969"],"abstract_inverted_index":{"A":[0,12],"Pseudo-Boolean":[1],"(PB)":[2],"constraint":[3,8],"is":[4,18,55],"a":[5,80,84,95,107],"linear":[6],"inequality":[7],"over":[9],"Boolean":[10],"variables.":[11],"popular":[13,121],"idea":[14],"to":[15,19,22],"solve":[16],"PB-constraints":[17],"transform":[20],"them":[21,34],"CNFs":[23],"(via":[24],"BDDs,":[25],"adders":[26],"and":[27,32,61],"sorting":[28],"networks":[29,72],"[5,":[30],"11])":[31],"process":[33],"using":[35],"\u2013":[36,39],"increasingly":[37],"improving":[38],"state-of-the-art":[40,127],"SAT-solvers.":[41],"Recent":[42],"research":[43],"have":[44],"favored":[45],"the":[46],"approach":[47],"that":[48,67,116],"uses":[49],"Binary":[50],"Decision":[51],"Diagrams":[52],"(BDDs),":[53],"which":[54,90],"evidenced":[56],"by":[57,93],"several":[58],"new":[59,96],"constructions":[60],"optimizations":[62,109],"[2,":[63],"21].":[64],"We":[65,78],"show":[66,115],"encodings":[68],"based":[69,86,110],"on":[70,87,111,117],"comparator":[71],"can":[73],"still":[74],"be":[75],"very":[76],"competitive.":[77],"present":[79],"system":[81],"description":[82],"of":[83,98,120],"PB-solver":[85],"MiniSat+":[88],"[11]":[89],"we":[91],"extended":[92],"adding":[94],"construction":[97],"selection":[99],"network":[100],"called":[101],"4-Way":[102],"Merge":[103],"Selection":[104],"Network,":[105],"with":[106],"few":[108],"other":[112,126],"solvers.":[113],"Experiments":[114],"many":[118],"instances":[119],"benchmarks":[122],"our":[123],"technique":[124],"outperforms":[125],"PB-solvers.":[128]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}