{"id":"https://openalex.org/W2399446083","doi":"https://doi.org/10.29007/jnvf","title":"Modern Cooperative Parallel SAT Solving","display_name":"Modern Cooperative Parallel SAT Solving","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2399446083","doi":"https://doi.org/10.29007/jnvf","mag":"2399446083"},"language":"en","primary_location":{"id":"doi:10.29007/jnvf","is_oa":true,"landing_page_url":"https://doi.org/10.29007/jnvf","pdf_url":"https://easychair.org/publications/open/49","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":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/49","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025110435","display_name":"Norbert Manthey","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Norbert Manthey","raw_affiliation_strings":["Knowledge Representation and Reasoning Group Technische Universitt Dresden, 01062 Dresden, Germany","Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Knowledge Representation and Reasoning Group Technische Universitt Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087433479","display_name":"Davide Lanti","orcid":"https://orcid.org/0000-0003-1097-2965"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Davide Lanti","raw_affiliation_strings":["Knowledge Representation and Reasoning Group Technische Universitt Dresden, 01062 Dresden, Germany","Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Knowledge Representation and Reasoning Group Technische Universitt Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051886672","display_name":"Ahmed Irfan","orcid":"https://orcid.org/0000-0001-7791-9021"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ahmed Irfan","raw_affiliation_strings":["Knowledge Representation and Reasoning Group Technische Universitt Dresden, 01062 Dresden, Germany","Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Knowledge Representation and Reasoning Group Technische Universitt Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]},{"raw_affiliation_string":"Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025110435"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.00763875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":null,"first_page":"41","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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.9991999864578247,"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.9979000091552734,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9958999752998352,"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/solver","display_name":"Solver","score":0.7692362070083618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7508213520050049},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6624693870544434},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.65671306848526},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4784448444843292},{"id":"https://openalex.org/keywords/space-partitioning","display_name":"Space partitioning","score":0.4711039662361145},{"id":"https://openalex.org/keywords/portfolio","display_name":"Portfolio","score":0.46009036898612976},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43255653977394104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43253499269485474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3541387915611267},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2844236195087433},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19072505831718445}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7692362070083618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7508213520050049},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6624693870544434},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.65671306848526},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4784448444843292},{"id":"https://openalex.org/C13670688","wikidata":"https://www.wikidata.org/wiki/Q3500548","display_name":"Space partitioning","level":2,"score":0.4711039662361145},{"id":"https://openalex.org/C2780821815","wikidata":"https://www.wikidata.org/wiki/Q5340806","display_name":"Portfolio","level":2,"score":0.46009036898612976},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43255653977394104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43253499269485474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3541387915611267},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2844236195087433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19072505831718445},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.29007/jnvf","is_oa":true,"landing_page_url":"https://doi.org/10.29007/jnvf","pdf_url":"https://easychair.org/publications/open/49","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"},{"id":"pmh:oai:alma.39UBZ_INST:11239344980001241","is_oa":false,"landing_page_url":"https://easychair.org/publications/paper/49","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:unibz.it:11239344980001241","is_oa":false,"landing_page_url":"https://bia.unibz.it/esploro/outputs/conferenceProceeding/Modern-Cooperative-Parallel-SAT-Solving/991005834351701241","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":{"id":"doi:10.29007/jnvf","is_oa":true,"landing_page_url":"https://doi.org/10.29007/jnvf","pdf_url":"https://easychair.org/publications/open/49","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":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321613","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2399446083.pdf","grobid_xml":"https://content.openalex.org/works/W2399446083.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W3714799","https://openalex.org/W20446002","https://openalex.org/W78552530","https://openalex.org/W117475319","https://openalex.org/W134175813","https://openalex.org/W159288436","https://openalex.org/W191575697","https://openalex.org/W1485898611","https://openalex.org/W1496529478","https://openalex.org/W1518705996","https://openalex.org/W1586677474","https://openalex.org/W1590061888","https://openalex.org/W1591939288","https://openalex.org/W1594033426","https://openalex.org/W1608123432","https://openalex.org/W1845402743","https://openalex.org/W2027282006","https://openalex.org/W2036265926","https://openalex.org/W2044560939","https://openalex.org/W2057361103","https://openalex.org/W2062636826","https://openalex.org/W2089748700","https://openalex.org/W2094855848","https://openalex.org/W2095709533","https://openalex.org/W2103406309","https://openalex.org/W2111224220","https://openalex.org/W2121341976","https://openalex.org/W2142785340","https://openalex.org/W2154318861","https://openalex.org/W2156964787","https://openalex.org/W2163798155","https://openalex.org/W2299079197","https://openalex.org/W2546270252","https://openalex.org/W2604772735","https://openalex.org/W2950728724","https://openalex.org/W2963562272","https://openalex.org/W3096618692","https://openalex.org/W4206807714","https://openalex.org/W4233090747","https://openalex.org/W4308322258","https://openalex.org/W6634978047"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W4321353415","https://openalex.org/W2745001401","https://openalex.org/W3008857645","https://openalex.org/W3037605386","https://openalex.org/W2073947114","https://openalex.org/W2061980994","https://openalex.org/W2090617251","https://openalex.org/W4389304954","https://openalex.org/W1540431531"],"abstract_inverted_index":{"Nowadays,":[0],"powerful":[1],"parallel":[2,45,89],"SAT":[3,47,90,123,133,147],"solvers":[4],"are":[5],"based":[6],"on":[7,70,102,125],"an":[8],"algorithm":[9],"portfolio.":[10],"The":[11,106,149],"alternative":[12],"approach,":[13,98],"(iterative)":[14],"search":[15,57,65,120],"space":[16,121],"partitioning,":[17],"cannot":[18],"keep":[19,139],"up,":[20],"although,":[21],"ac-":[22],"cording":[23],"to":[24,54,61,86],"the":[25,56,63,83,96,114,117,135,142,153,167],"literature,":[26],"iterative":[27],"partitioning":[28,122],"systems":[29],"should":[30],"scale":[31],"better":[32],"than":[33],"portfolio":[34,97],"solvers.":[35],"In":[36,74],"this":[37,110],"paper":[38],"we":[39,68,78],"identify":[40],"key":[41],"problems":[42],"in":[43],"current":[44],"cooperative":[46,155],"solving":[48],"approaches,":[49],"most":[50],"importantly":[51],"communication,":[52],"how":[53,60],"partition":[55],"space,":[58],"and":[59],"utilize":[62],"sequential":[64],"engine.":[66],"First,":[67],"improve":[69,152],"each":[71],"problem":[72],"separately.":[73],"a":[75,87,128],"further":[76],"step,":[77],"show":[79],"that":[80],"combining":[81],"all":[82],"improvements":[84,151],"leads":[85],"state-of-the-art":[88],"solver,":[91],"which":[92],"does":[93],"not":[94],"use":[95],"but":[99],"instead":[100,160],"relies":[101],"it-":[103],"erative":[104],"partitioning.":[105],"experimental":[107],"evaluation":[108],"of":[109,119,127,131,144,161,164],"system":[111],"completely":[112],"changes":[113],"picture":[115],"about":[116],"performance":[118],"solvers:":[124],"instances":[126],"combined":[129,150],"benchmark":[130],"recent":[132],"competitions,":[134],"presented":[136],"approach":[137],"can":[138,171],"up":[140],"with":[141],"winners":[143],"last":[145],"years":[146],"competition.":[148],"existing":[154],"solver":[156,169],"splitter":[157],"by":[158],"24%:":[159],"561":[162],"out":[163],"880":[165],"instances,":[166],"new":[168],"Pcasso":[170],"solve":[172],"696":[173],"instances.":[174]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}