{"id":"https://openalex.org/W2186900895","doi":null,"title":"Parallel Search for Boolean Optimization","display_name":"Parallel Search for Boolean Optimization","alternate_titles":[],"publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2186900895","mag":"2186900895"},"language":"en","primary_location":{"id":"mag:2186900895","doi":null,"is_oa":false,"landing_page_url":"http://sat.inesc-id.pt/~ruben/papers/martins-rcra11.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2186900895"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101995804","display_name":"Ruben Martins","orcid":"https://orcid.org/0000-0003-1525-1382","observed_orcids":["https://orcid.org/0000-0003-1525-1382"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Ruben Martins","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033377932","display_name":"Vasco M. Manquinho","orcid":"https://orcid.org/0000-0002-4205-2189","observed_orcids":["https://orcid.org/0000-0002-4205-2189"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Vasco Manquinho","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7633,"has_fulltext":false,"cited_by_count":12,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.86166333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9071999788284302,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9071999788284302,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.032999999821186066,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.010300000198185444,"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/boolean-optimization","display_name":"Boolean optimization","score":0.8500000238418579},{"id":"https://openalex.org/keywords/parallel-search","display_name":"parallel search","score":0.8870000243186951},{"id":"https://openalex.org/keywords/parallel-sat-solvers","display_name":"parallel SAT solvers","score":0.8100000023841858},{"id":"https://openalex.org/keywords/multi-core-processors","display_name":"multi-core processors","score":0.9610000252723694},{"id":"https://openalex.org/keywords/linear-search","display_name":"sequential search","score":0.6690000295639038},{"id":"https://openalex.org/keywords/search-space-reduction","display_name":"search space reduction","score":0.7540000081062317},{"id":"https://openalex.org/keywords/search-diversification","display_name":"search diversification","score":0.6330000162124634},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"upper and lower bounds","score":0.6079999804496765}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7379825711250305},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6741124987602234},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6363475918769836},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5917661190032959},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5103692412376404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48090600967407227},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.468424916267395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45651814341545105},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4417332112789154},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.43615809082984924},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.431606650352478},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.41755884885787964},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.41062888503074646},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3847493529319763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3136546015739441},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28709885478019714},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2186900895","doi":null,"is_oa":false,"landing_page_url":"http://sat.inesc-id.pt/~ruben/papers/martins-rcra11.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.9533","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.9533","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sat.inesc-id.pt/%7Eruben/papers/martins-rcra11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W78552530","https://openalex.org/W121805954","https://openalex.org/W1479859531","https://openalex.org/W1485898611","https://openalex.org/W1502387139","https://openalex.org/W1531103278","https://openalex.org/W1539228153","https://openalex.org/W1559357575","https://openalex.org/W1578612406","https://openalex.org/W1775352280","https://openalex.org/W2048051309","https://openalex.org/W2095821893","https://openalex.org/W2096307462","https://openalex.org/W2097689572","https://openalex.org/W2098984274","https://openalex.org/W2100609826","https://openalex.org/W2116758077","https://openalex.org/W2118943303","https://openalex.org/W2125047455","https://openalex.org/W2140138589","https://openalex.org/W2144040805","https://openalex.org/W2171802366"],"related_works":["https://openalex.org/W3022428349","https://openalex.org/W2338978323","https://openalex.org/W2171739643","https://openalex.org/W2904213014","https://openalex.org/W1563306250","https://openalex.org/W6967137396","https://openalex.org/W1588043111","https://openalex.org/W7097899596","https://openalex.org/W7098183178","https://openalex.org/W3016089191"],"abstract_inverted_index":{"Abstract.":[0],"The":[1,144],"predominance":[2],"of":[3,78,97,128,140,184],"multicore":[4],"processors":[5],"has":[6],"increased":[7],"the":[8,74,79,84,93,98,115,132,141,157,167,177,182,185],"inter-est":[9],"in":[10,102,165],"developing":[11],"parallel":[12,21,28,35,46,56,145],"Boolean":[13,39,50,59],"Satisfiability":[14],"(SAT)":[15],"solvers.":[16],"As":[17],"a":[18,54,87,125],"result,":[19],"more":[20,117],"SAT":[22],"solvers":[23],"are":[24,30,41,174],"emerging.":[25],"Even":[26],"though":[27],"approaches":[29,36,113],"known":[31],"to":[32,71,153],"boost":[33],"performance,":[34],"developed":[37],"for":[38,49,58,124],"optimization":[40,60],"scarce.":[42],"This":[43,119],"paper":[44],"proposes":[45],"search":[47,72,89,116,133,146,168,172],"algorithms":[48],"optimiza-tion":[51],"and":[52,105,159],"introduces":[53],"new":[55],"solver":[57],"problem":[61],"in-stances.":[62],"Using":[63],"two":[64,111],"threads,":[65],"an":[66],"unsatisfiability-based":[67],"algorithm":[68],"is":[69,90,121],"used":[70],"on":[73,92,147,156,176],"lower":[75,158],"bound":[76,95,161,179],"value":[77,96],"objective":[80,99,142],"function,":[81],"while":[82],"at":[83],"same":[85],"time":[86],"linear":[88],"performed":[91],"upper":[94,138,160,178],"function.":[100,143],"Searching":[101],"both":[103],"directions":[104],"exchanging":[106],"learned":[107],"clauses":[108],"between":[109],"these":[110],"orthogonal":[112],"makes":[114],"efficient.":[118],"idea":[120],"further":[122],"extended":[123],"larger":[126],"number":[127],"threads":[129],"by":[130],"dividing":[131],"space":[134],"considering":[135],"different":[136,148,171],"local":[137,149],"values":[139,151],"up-per":[150],"leads":[152],"constant":[154],"updates":[155],"values,":[162],"which":[163],"result":[164],"reducing":[166],"space.":[169],"Moreover,":[170],"strategies":[173],"per-formed":[175],"value,":[180],"increasing":[181],"diversification":[183],"search.":[186],"1":[187]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2186900895","counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
