Behavior of heuristics and state space structure near SAT/UNSAT transition
We study the behavior of ASAT, a heuristic for solving satisfiability problems by stochastic local search near the SAT/UNSAT transition. The heuristic is focused, i.e. only variables in unsatisfied clauses are updated in each step, and is significantly simpler, while similar to, walksat or Focused M...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Ardelius, John Aurell, Erik |
| description | We study the behavior of ASAT, a heuristic for solving satisfiability
problems by stochastic local search near the SAT/UNSAT transition. The
heuristic is focused, i.e. only variables in unsatisfied clauses are updated in
each step, and is significantly simpler, while similar to, walksat or Focused
Metropolis Search. We show that ASAT solves instances as large as one million
variables in linear time, on average, up to 4.21 clauses per variable for
random 3SAT. For K higher than 3, ASAT appears to solve instances at the ``FRSB
threshold'' in linear time, up to K=7. |
| doi_str_mv | 10.48550/arxiv.cond-mat/0601703 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_cond_mat_0601703</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>cond_mat_0601703</sourcerecordid><originalsourceid>FETCH-arxiv_primary_cond_mat_06017033</originalsourceid><addsrcrecordid>eNqNjrEOgjAURbs4GPUbfIsjUIKoqxqNcXAR5-allNBEWvL6IPr3ouEDXM5dbnKOEMtUxutdnssE6WX7WHtXRg1yIjcy3cpsKq4HU2NvPYGvoDYd2cBWB0BXQmBkA6FFPZCp09yRAWeQ4L4vksdtIDChC5atd3MxqfAZzGLcmVidT8XxEv3cqiXbIL3Vt0ENDWpsyP79fQCK8UKN</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Behavior of heuristics and state space structure near SAT/UNSAT transition</title><source>arXiv.org</source><creator>Ardelius, John ; Aurell, Erik</creator><creatorcontrib>Ardelius, John ; Aurell, Erik</creatorcontrib><description>We study the behavior of ASAT, a heuristic for solving satisfiability
problems by stochastic local search near the SAT/UNSAT transition. The
heuristic is focused, i.e. only variables in unsatisfied clauses are updated in
each step, and is significantly simpler, while similar to, walksat or Focused
Metropolis Search. We show that ASAT solves instances as large as one million
variables in linear time, on average, up to 4.21 clauses per variable for
random 3SAT. For K higher than 3, ASAT appears to solve instances at the ``FRSB
threshold'' in linear time, up to K=7.</description><identifier>DOI: 10.48550/arxiv.cond-mat/0601703</identifier><language>eng</language><subject>Physics - Statistical Mechanics</subject><creationdate>2006-01</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/cond-mat/0601703$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.1103/PhysRevE.74.037702$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.cond-mat/0601703$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Ardelius, John</creatorcontrib><creatorcontrib>Aurell, Erik</creatorcontrib><title>Behavior of heuristics and state space structure near SAT/UNSAT transition</title><description>We study the behavior of ASAT, a heuristic for solving satisfiability
problems by stochastic local search near the SAT/UNSAT transition. The
heuristic is focused, i.e. only variables in unsatisfied clauses are updated in
each step, and is significantly simpler, while similar to, walksat or Focused
Metropolis Search. We show that ASAT solves instances as large as one million
variables in linear time, on average, up to 4.21 clauses per variable for
random 3SAT. For K higher than 3, ASAT appears to solve instances at the ``FRSB
threshold'' in linear time, up to K=7.</description><subject>Physics - Statistical Mechanics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNqNjrEOgjAURbs4GPUbfIsjUIKoqxqNcXAR5-allNBEWvL6IPr3ouEDXM5dbnKOEMtUxutdnssE6WX7WHtXRg1yIjcy3cpsKq4HU2NvPYGvoDYd2cBWB0BXQmBkA6FFPZCp09yRAWeQ4L4vksdtIDChC5atd3MxqfAZzGLcmVidT8XxEv3cqiXbIL3Vt0ENDWpsyP79fQCK8UKN</recordid><startdate>20060131</startdate><enddate>20060131</enddate><creator>Ardelius, John</creator><creator>Aurell, Erik</creator><scope>GOX</scope></search><sort><creationdate>20060131</creationdate><title>Behavior of heuristics and state space structure near SAT/UNSAT transition</title><author>Ardelius, John ; Aurell, Erik</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_cond_mat_06017033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Physics - Statistical Mechanics</topic><toplevel>online_resources</toplevel><creatorcontrib>Ardelius, John</creatorcontrib><creatorcontrib>Aurell, Erik</creatorcontrib><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ardelius, John</au><au>Aurell, Erik</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Behavior of heuristics and state space structure near SAT/UNSAT transition</atitle><date>2006-01-31</date><risdate>2006</risdate><abstract>We study the behavior of ASAT, a heuristic for solving satisfiability
problems by stochastic local search near the SAT/UNSAT transition. The
heuristic is focused, i.e. only variables in unsatisfied clauses are updated in
each step, and is significantly simpler, while similar to, walksat or Focused
Metropolis Search. We show that ASAT solves instances as large as one million
variables in linear time, on average, up to 4.21 clauses per variable for
random 3SAT. For K higher than 3, ASAT appears to solve instances at the ``FRSB
threshold'' in linear time, up to K=7.</abstract><doi>10.48550/arxiv.cond-mat/0601703</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.cond-mat/0601703 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_cond_mat_0601703 |
| source | arXiv.org |
| subjects | Physics - Statistical Mechanics |
| title | Behavior of heuristics and state space structure near SAT/UNSAT transition |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T14%3A50%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Behavior%20of%20heuristics%20and%20state%20space%20structure%20near%20SAT/UNSAT%20transition&rft.au=Ardelius,%20John&rft.date=2006-01-31&rft_id=info:doi/10.48550/arxiv.cond-mat/0601703&rft_dat=%3Carxiv_GOX%3Econd_mat_0601703%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |