Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms

Evgeny Dantsin; Edward A. Hirsch; Alexander Wolpert

doi:10.1007/11758471_9

Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms

Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert

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

14 Scopus citations

Abstract

We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.

Original language	English
Title of host publication	Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings
Pages	60-68
Number of pages	9
DOIs	https://doi.org/10.1007/11758471_9
State	Published - 2006
Externally published	Yes
Event	6th Italian Conference on Algorithms and Complexity, CIAC 2006 - Rome, Italy Duration: 29 May 2006 → 31 May 2006

Publication series

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

Conference

Conference	6th Italian Conference on Algorithms and Complexity, CIAC 2006
Country/Territory	Italy
City	Rome
Period	29/05/06 → 31/05/06

Access to Document

10.1007/11758471_9

Cite this

Dantsin, E., Hirsch, E. A., & Wolpert, A. (2006). Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms. In Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings (pp. 60-68). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3998 LNCS). https://doi.org/10.1007/11758471_9

Dantsin, Evgeny ; Hirsch, Edward A. ; Wolpert, Alexander. / Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms. Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. 2006. pp. 60-68 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{57bafdbcc2884f328ac495ae212829f4,

title = "Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms",

abstract = "We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.",

author = "Evgeny Dantsin and Hirsch, \{Edward A.\} and Alexander Wolpert",

year = "2006",

doi = "10.1007/11758471\_9",

language = "אנגלית",

isbn = "354034375X",

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

pages = "60--68",

booktitle = "Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings",

note = "6th Italian Conference on Algorithms and Complexity, CIAC 2006 ; Conference date: 29-05-2006 Through 31-05-2006",

}

Dantsin, E, Hirsch, EA & Wolpert, A 2006, Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms. in Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3998 LNCS, pp. 60-68, 6th Italian Conference on Algorithms and Complexity, CIAC 2006, Rome, Italy, 29/05/06. https://doi.org/10.1007/11758471_9

Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms. / Dantsin, Evgeny; Hirsch, Edward A.; Wolpert, Alexander.
Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. 2006. p. 60-68 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3998 LNCS).

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

TY - GEN

T1 - Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms

AU - Dantsin, Evgeny

AU - Hirsch, Edward A.

AU - Wolpert, Alexander

PY - 2006

Y1 - 2006

N2 - We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.

AB - We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.

UR - https://www.scopus.com/pages/publications/33746088410

U2 - 10.1007/11758471_9

DO - 10.1007/11758471_9

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

AN - SCOPUS:33746088410

SN - 354034375X

SN - 9783540343752

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

SP - 60

EP - 68

BT - Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings

T2 - 6th Italian Conference on Algorithms and Complexity, CIAC 2006

Y2 - 29 May 2006 through 31 May 2006

ER -

Dantsin E, Hirsch EA, Wolpert A. Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms. In Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. 2006. p. 60-68. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11758471_9

Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this