Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
In this paper we present a new randomized algorithm for SAT combining unit clause elimination and local search. The algorithm is inspired by two randomized algorithms having the best current worst-case upper bounds ([9] and [11,12]). Despite its simplicity, our algorithm performs well on many common benchmarks (we present results of its empirical evaluation). It is also probabilistically approximately complete.
| Original language | English |
|---|---|
| Title of host publication | Principles and Practice of Constraint Programming - CP 2001 - 7th International Conference, CP 2001, Proceedings |
| Editors | Toby Walsh |
| Publisher | Springer Nature |
| Pages | 605-609 |
| Number of pages | 5 |
| ISBN (Print) | 3540428631, 9783540428633 |
| State | Published - 1 Jan 2001 |
| Event | 7th International Conference on Principles and Practice of Constraint Programming, CP 2001 - Paphos, Cyprus Duration: 26 Nov 2001 → 1 Dec 2001 |
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 2239 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
| Conference | 7th International Conference on Principles and Practice of Constraint Programming, CP 2001 |
|---|---|
| Country/Territory | Cyprus |
| City | Paphos |
| Period | 26/11/01 → 1/12/01 |
ID: 49829404