 | 2009 |
|---|
| 10 |       | Knot Pipatsrisawat,
Adnan Darwiche:
On the Power of Clause-Learning SAT Solvers with Restarts.
CP 2009: 654-668 |
| 9 | | Knot Pipatsrisawat,
Adnan Darwiche:
A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT.
IJCAI 2009: 590-595 |
| 8 | | Knot Pipatsrisawat,
Adnan Darwiche:
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers.
SAT 2009: 341-355 |
| 7 | | Adnan Darwiche,
Knot Pipatsrisawat:
Complete Algorithms.
Handbook of Satisfiability 2009: 99-130 |
| 2008 |
|---|
| 6 |  | Knot Pipatsrisawat,
Adnan Darwiche:
A New Clause Learning Scheme for Efficient Unsatisfiability Proofs.
AAAI 2008: 1481-1484 |
| 5 | | Knot Pipatsrisawat,
Adnan Darwiche:
New Compilation Languages Based on Structured Decomposability.
AAAI 2008: 517-522 |
| 4 | | Arthur Choi,
Noah Zaitlen,
Buhm Han,
Knot Pipatsrisawat,
Adnan Darwiche,
Eleazar Eskin:
Efficient Genome Wide Tagging by Reduction to SAT.
WABI 2008: 135-147 |
| 3 | | Knot Pipatsrisawat,
Akop Palyan,
Mark Chavira,
Arthur Choi,
Adnan Darwiche:
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis.
JSAT 4(2-4): 191-217 (2008) |
| 2007 |
|---|
| 2 | | Knot Pipatsrisawat,
Adnan Darwiche:
Clone: Solving Weighted Max-SAT in a Reduced Search Space.
Australian Conference on Artificial Intelligence 2007: 223-233 |
| 1 | | Knot Pipatsrisawat,
Adnan Darwiche:
A Lightweight Component Caching Scheme for Satisfiability Solvers.
SAT 2007: 294-299 |
