Research output: Contribution to journal › Article › peer-review
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 language | English |
|---|---|
| Pages (from-to) | 397-420 |
| Number of pages | 24 |
| Journal | Journal of Automated Reasoning |
| Volume | 24 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 Jan 2000 |
ID: 49829957