New worst-case upper bounds for SAT

Research output: Contribution to journalArticlepeer-review

69 Scopus citations


Transformation rules constitute a substantial part of the splitting method for handling the SAT problem. This article presents a new transformation rule and two algorithms using such a rule. It is proven that the algorithms have worst-case upper bounds.

Original languageEnglish
Pages (from-to)397-420
Number of pages24
JournalJournal of Automated Reasoning
Issue number4
StatePublished - 2000
Externally publishedYes


Dive into the research topics of 'New worst-case upper bounds for SAT'. Together they form a unique fingerprint.

Cite this