| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Annals of Mathematics and Artificial Intelligence
|
|
|
2005
|
43 |
1-4 |
p. 367-371
|
artikel
|
| 2 |
A parsimony tree for the SAT2002 competition
|
Purdom, Paul W.
|
|
2004
|
43 |
1-4 |
p. 343-365
|
artikel
|
| 3 |
A SAT approach to query optimization in mediator systems
|
Prestwich, Steven
|
|
2004
|
43 |
1-4 |
p. 195-210
|
artikel
|
| 4 |
Efficient data structures for backtrack search SAT solvers
|
Lynce, Inês
|
|
2004
|
43 |
1-4 |
p. 137-152
|
artikel
|
| 5 |
Exact 3-satisfiability is decidable in time O(20.16254n)
|
Porschen, Stefan
|
|
2004
|
43 |
1-4 |
p. 173-193
|
artikel
|
| 6 |
Extension and equivalence problems for clause minimal formulae
|
Kleine Büning, Hans
|
|
2004
|
43 |
1-4 |
p. 295-306
|
artikel
|
| 7 |
Generalizations of matched CNF formulas
|
Szeider, Stefan
|
|
2004
|
43 |
1-4 |
p. 223-238
|
artikel
|
| 8 |
On deciding subsumption problems
|
Egly, Uwe
|
|
2004
|
43 |
1-4 |
p. 255-294
|
artikel
|
| 9 |
On exact selection of minimally unsatisfiable subformulae
|
Bruni, Renato
|
|
2004
|
43 |
1-4 |
p. 35-50
|
artikel
|
| 10 |
On SAT instance classes and a method for reliable performance experiments with SAT solvers
|
Brglez, Franc
|
|
2004
|
43 |
1-4 |
p. 1-34
|
artikel
|
| 11 |
Probability logic and optimization SAT: The PSAT and CPA models
|
Pretolani, Daniele
|
|
2004
|
43 |
1-4 |
p. 211-221
|
artikel
|
| 12 |
Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT
|
Cocco, Simona
|
|
2004
|
43 |
1-4 |
p. 153-172
|
artikel
|
| 13 |
Solving the resolution-free SAT problem by submodel propagation in linear time
|
Kusper, Gábor
|
|
2004
|
43 |
1-4 |
p. 129-136
|
artikel
|
| 14 |
Testing satisfiability of CNF formulas by computing a stable set of points
|
Goldberg, Eugene
|
|
2004
|
43 |
1-4 |
p. 65-89
|
artikel
|
| 15 |
The complexity of Boolean constraint satisfaction local search problems
|
Chapdelaine, Philippe
|
|
2004
|
43 |
1-4 |
p. 51-63
|
artikel
|
| 16 |
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
|
Büning, Hans Kleine
|
|
2004
|
43 |
1-4 |
p. 113-127
|
artikel
|
| 17 |
The SAT2002 competition
|
Simon, Laurent
|
|
2004
|
43 |
1-4 |
p. 307-342
|
artikel
|
| 18 |
Toward leaner binary-clause reasoning in a satisfiability solver
|
Gelder, Allen Van
|
|
2004
|
43 |
1-4 |
p. 239-253
|
artikel
|
| 19 |
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
|
Hirsch, Edward A.
|
|
2004
|
43 |
1-4 |
p. 91-111
|
artikel
|
Tijdschrift beschrijving