{"id":"https://openalex.org/W64307931","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-092","title":"Depth-driven circuit-level stochastic local search for SAT","display_name":"Depth-driven circuit-level stochastic local search for SAT","publication_year":2011,"publication_date":"2011-07-16","ids":{"openalex":"https://openalex.org/W64307931","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-092","mag":"64307931"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.229.107","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.helsinki.fi/matti.jarvisalo/papers/belov-jarvisalo-stachniak.ijcai11.pdf","raw_type":"text"},"type":"article","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/A5026813811","display_name":"Anton Belov","orcid":null},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Anton Belov","raw_affiliation_strings":["University College Dublin, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]}]},{"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":false,"raw_author_name":"Matti J\u0084\u00e4rvisalo","raw_affiliation_strings":["University of Helsinki, , Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Helsinki, , Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033940108","display_name":"Zbigniev Stachniak","orcid":null},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Zbigniev Stachniak","raw_affiliation_strings":["York University - Canad\u00e1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"York University - Canad\u00e1","institution_ids":["https://openalex.org/I192455969"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2452,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.82743406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"504","last_page":"509"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9984999895095825,"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/T10142","display_name":"Formal Methods in Verification","score":0.9944999814033508,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.978600025177002,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7444524765014648},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6801288723945618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6172835230827332},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6146124601364136},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.6010645031929016},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5861194133758545},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5764020085334778},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5464639663696289},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4609857499599457},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44786375761032104},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4277578294277191},{"id":"https://openalex.org/keywords/stochastic-computing","display_name":"Stochastic computing","score":0.41215693950653076},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.3084873855113983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21909525990486145},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21477454900741577}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7444524765014648},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6801288723945618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6172835230827332},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6146124601364136},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6010645031929016},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5861194133758545},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5764020085334778},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5464639663696289},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4609857499599457},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44786375761032104},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4277578294277191},{"id":"https://openalex.org/C2780971903","wikidata":"https://www.wikidata.org/wiki/Q2933705","display_name":"Stochastic computing","level":3,"score":0.41215693950653076},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.3084873855113983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21909525990486145},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21477454900741577},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.229.107","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.helsinki.fi/matti.jarvisalo/papers/belov-jarvisalo-stachniak.ijcai11.pdf","raw_type":"text"},{"id":"mag:64307931","is_oa":false,"landing_page_url":"https://www.cs.helsinki.fi/u/mjarvisa/papers/belov-jarvisalo-stachniak.ijcai11.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W160143675","https://openalex.org/W1485281029","https://openalex.org/W1494865762","https://openalex.org/W1513176853","https://openalex.org/W1543681538","https://openalex.org/W1552944591","https://openalex.org/W1593394207","https://openalex.org/W1600002932","https://openalex.org/W1604814605","https://openalex.org/W1862298752","https://openalex.org/W1967970073","https://openalex.org/W2081692349","https://openalex.org/W2338679082"],"related_works":["https://openalex.org/W1552944591","https://openalex.org/W1506255457","https://openalex.org/W3126392993","https://openalex.org/W2961579901","https://openalex.org/W1633665642","https://openalex.org/W2412560742","https://openalex.org/W2970385329","https://openalex.org/W2131846131","https://openalex.org/W2135627564","https://openalex.org/W2092886720","https://openalex.org/W2577270548","https://openalex.org/W116937202","https://openalex.org/W3199109861","https://openalex.org/W130270360","https://openalex.org/W2568903733","https://openalex.org/W2885188107","https://openalex.org/W2949487252","https://openalex.org/W2207672057","https://openalex.org/W2964852694","https://openalex.org/W2958392238"],"abstract_inverted_index":{"We":[0,46],"develop":[1],"a":[2,16],"novel":[3],"circuit-level":[4,39],"stochastic":[5],"local":[6],"search":[7],"(SLS)":[8],"method":[9],"D-CRSat":[10,24],"for":[11,56],"Boolean":[12],"satisfiability":[13],"by":[14],"integrating":[15],"structure-based":[17],"heuristic":[18],"into":[19],"the":[20,62],"recent":[21],"CRSat":[22,28],"algorithm.":[23],"significantly":[25],"improves":[26],"on":[27,29,33],"real-world":[30],"application":[31],"benchmarks":[32],"which":[34],"other":[35],"current":[36],"CNF":[37],"and":[38],"SLS":[40],"methods":[41],"tend":[42],"to":[43],"perform":[44],"weakly.":[45],"also":[47],"give":[48],"an":[49],"intricate":[50],"proof":[51],"of":[52,61],"probabilistically":[53],"approximate":[54],"completeness":[55],"D-CRSat,":[57],"highlighting":[58],"key":[59],"features":[60],"method.":[63],"1":[64]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}