Local search algorithms for SAT: Worst-case analysis

Edward A. Hirsch

doi:10.1007/BFb0054372

Local search algorithms for SAT: Worst-case analysis

Edward A. Hirsch

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

Recent experiments demonstrated that local search algorithms (e.g. GSAT) are able to find satisfying assignments for many "hard" Boolean formulas. However, no non-trivial worst-case upper bounds were proved, although many such bounds of the form 2^αn (α < 1 is a constant) are known for other SAT algorithms, e.g. resolution-like algorithms. In the present paper we prove such a bound for a local search algorithm, namely for CSAT. The class of formulas we consider covers most of DIMACS benchmarks, the satisfiability problem for this class of formulas is NP-complete.

Original language	English
Title of host publication	Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings
Editors	Stefan Arnborg, Lars Ivansson
Pages	246-254
Number of pages	9
DOIs	https://doi.org/10.1007/BFb0054372
State	Published - 1998
Externally published	Yes
Event	6th Scandinavian Workshop on Algorithm Theory, SWAT 1998 - Stockholm, Sweden Duration: 8 Jul 1998 → 10 Jul 1998

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1432
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th Scandinavian Workshop on Algorithm Theory, SWAT 1998
Country/Territory	Sweden
City	Stockholm
Period	8/07/98 → 10/07/98

Access to Document

10.1007/BFb0054372

Cite this

Hirsch, E. A. (1998). Local search algorithms for SAT: Worst-case analysis. In S. Arnborg, & L. Ivansson (Eds.), Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings (pp. 246-254). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1432). https://doi.org/10.1007/BFb0054372

@inproceedings{66665624c02b4729bd07ae8e503d565b,

title = "Local search algorithms for SAT: Worst-case analysis",

abstract = "Recent experiments demonstrated that local search algorithms (e.g. GSAT) are able to find satisfying assignments for many {"}hard{"} Boolean formulas. However, no non-trivial worst-case upper bounds were proved, although many such bounds of the form 2αn (α < 1 is a constant) are known for other SAT algorithms, e.g. resolution-like algorithms. In the present paper we prove such a bound for a local search algorithm, namely for CSAT. The class of formulas we consider covers most of DIMACS benchmarks, the satisfiability problem for this class of formulas is NP-complete.",

author = "Hirsch, {Edward A.}",

year = "1998",

doi = "10.1007/BFb0054372",

language = "אנגלית",

isbn = "3540646825",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "246--254",

editor = "Stefan Arnborg and Lars Ivansson",

booktitle = "Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings",

}

Hirsch, EA 1998, Local search algorithms for SAT: Worst-case analysis. in S Arnborg & L Ivansson (eds), Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1432, pp. 246-254, 6th Scandinavian Workshop on Algorithm Theory, SWAT 1998, Stockholm, Sweden, 8/07/98. https://doi.org/10.1007/BFb0054372

Local search algorithms for SAT: Worst-case analysis. / Hirsch, Edward A.
Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. ed. / Stefan Arnborg; Lars Ivansson. 1998. p. 246-254 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1432).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Local search algorithms for SAT

T2 - 6th Scandinavian Workshop on Algorithm Theory, SWAT 1998

AU - Hirsch, Edward A.

PY - 1998

Y1 - 1998

N2 - Recent experiments demonstrated that local search algorithms (e.g. GSAT) are able to find satisfying assignments for many "hard" Boolean formulas. However, no non-trivial worst-case upper bounds were proved, although many such bounds of the form 2αn (α < 1 is a constant) are known for other SAT algorithms, e.g. resolution-like algorithms. In the present paper we prove such a bound for a local search algorithm, namely for CSAT. The class of formulas we consider covers most of DIMACS benchmarks, the satisfiability problem for this class of formulas is NP-complete.

AB - Recent experiments demonstrated that local search algorithms (e.g. GSAT) are able to find satisfying assignments for many "hard" Boolean formulas. However, no non-trivial worst-case upper bounds were proved, although many such bounds of the form 2αn (α < 1 is a constant) are known for other SAT algorithms, e.g. resolution-like algorithms. In the present paper we prove such a bound for a local search algorithm, namely for CSAT. The class of formulas we consider covers most of DIMACS benchmarks, the satisfiability problem for this class of formulas is NP-complete.

UR - http://www.scopus.com/inward/record.url?scp=84957711442&partnerID=8YFLogxK

U2 - 10.1007/BFb0054372

DO - 10.1007/BFb0054372

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957711442

SN - 3540646825

SN - 9783540646822

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 246

EP - 254

BT - Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings

A2 - Arnborg, Stefan

A2 - Ivansson, Lars

Y2 - 8 July 1998 through 10 July 1998

ER -

Hirsch EA. Local search algorithms for SAT: Worst-case analysis. In Arnborg S, Ivansson L, editors, Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. 1998. p. 246-254. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0054372

Local search algorithms for SAT: Worst-case analysis

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this