-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathAcceptedPapers.html
More file actions
428 lines (411 loc) · 14.9 KB
/
AcceptedPapers.html
File metadata and controls
428 lines (411 loc) · 14.9 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en-GB" lang="en-GB">
<head>
<title>SAT 2009 - Accepted Papers </title>
<link rel="stylesheet" href="styles/sat09.css" type="text/css" title="Default Style" />
<link rel="alternate stylesheet" href="styles/sat09-wrap.css" type="text/css" title="Wrap Style" />
<meta name="author" content="Oliver Kullmann" />
<meta name="description" content="Accepted papers SAT 2009" />
<meta name="robot" content="all" />
<meta http-equiv="content-type" content="text/html" />
<meta http-equiv="charset" content="utf-8" />
</head>
<body>
<div class="header">
<img src="images/top_pic_contact2.gif" alt="Image of Swansea Bay and
University" />
<!-- Copyright: photo obtained from
http://www.waters-creative.co.uk/sat09/index.html,
all rights reserved-->
<h2><a href="http://www.cs.swan.ac.uk/~csoliver/SAT2009/index.html">
SAT 2009</a> - Twelfth International Conference on <br />
Theory and Applications of Satisfiability Testing</h2>
<h3>June 30 - July 3, 2009, Swansea, Wales, United Kingdom</h3>
</div>
<hr />
<div id="page-content">
<ul class="menu">
<li> <a href="index.html">Home</a></li>
<li><a href="http://www.sat09.swan.ac.uk/index.html">Location,
accommodation, etc.</a> </li>
<li><a href="Programme.html">Programme</a></li>
<li><a href="Information.html">Information</a></li>
<li><a href="ImportantDates.html">Important Dates</a></li>
<li><a href="InvitedSpeakers.html">Invited Speakers</a></li>
<li><a href="AcceptedPapers.html">Accepted Papers</a></li>
<li><a href="Submissions.html">Paper Submissions</a></li>
<li><a href="Committees.html">Committees</a></li>
<li><a href="Sponsors.html">Sponsors</a></li>
<li><a href="Dissemination.html">Disseminating SAT 2009</a></li>
<li><a href="http://www.satisfiability.org">Previous Conferences</a></li>
</ul>
<div class="content">
<h1> Accepted papers SAT 2009 </h1>
<table border="0" cellpadding="3" cellspacing="0">
<tr>
<td>
<a href="http://www.lsi.upc.edu/~rasin">Roberto Asín Achá</a>,
<a href="http://www.lsi.upc.edu/~roberto">Robert Nieuwenhuis</a>,
<a href="http://www.lsi.upc.edu/~oliveras">Albert Oliveras</a> and
<a href="http://www.lsi.upc.edu/~erodri/">Enric Rodríguez Carbonell</a>.
Cardinality Networks and their Applications
</td>
</tr>
<tr>
<td>
Carlos Ansótegui,
<a href="http://www.lsi.upc.es/~bonet/">María Luisa Bonet</a> and
<a href="http://www.iiia.csic.es/~levy">Jordi Levy</a>.
A Weighted Partial MaxSAT Solver Based on Satisfiability Testing
</td>
</tr>
<tr>
<td>
<a href="http://sat.inesc-id.pt/~josep/">Josep Argelich</a>,
Alba Cabiscol,
<a href="http://sat.inesc-id.pt/~ines">Inês Lynce</a> and
<a href="http://www.iiia.csic.es/">Felip Manyà</a>.
Sequential Encodings from Max-CSP into Partial Max-SAT
</td>
</tr>
<tr>
<td>
<a href="http://www.lsi.upc.edu/~atserias/">Albert Atserias</a>,
Johannes Fichte and
<a href="http://www.informatik.hu-berlin.de/~thurley">Marc Thurley</a>.
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
</td>
</tr>
<tr>
<td>
Olivier Bailleux,
Yacine Boufkhad and
Olivier Roussel.
New Encodings of Pseudo-Boolean Constraints into CNF
</td>
</tr>
<tr>
<td>
Adrian Balint,
Michael Henn and
<a href="http://www.uni-ulm.de/in/theo/mitarbeiter/olivergableske.html">Oliver Gableske</a>.
A novel approach to combine a SLS- and a DPLL-solver for the satisfiability problem
</td>
</tr>
<tr>
<td>
<a href="http://www.zib.de/berthold/">Timo Berthold</a>,
<a href="http://www.zib.de/heinz">Stefan Heinz</a> and
Marc E. Pfetsch.
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?
</td>
</tr>
<tr>
<td>
<a href="http://www.thi.uni-hannover.de/~beyersdorff">Olaf Beyersdorff</a>,
<a href="http://www.thi.uni-hannover.de">Arne Meier</a>,
<a href="http://www.thi.uni-hannover.de">Michael Thomas</a> and
<a href="http://www.thi.uni-hannover.de">Heribert Vollmer</a>.
The Complexity of Reasoning for Fragments of Default Logic
</td>
</tr>
<tr>
<td>
<a href="http://www.thi.uni-hannover.de/~beyersdorff">Olaf Beyersdorff</a> and
<a href="http://www.informatik.hu-berlin.de/forschung/gebiete/algorithmenII/mitarbeiter/smueller">Sebastian Müller</a>.
Does Advice Help to Prove Propositional Tautologies?
</td>
</tr>
<tr>
<td>
<a href="http://www.lsi.upc.es/~bonet/">Maria Luísa Bonet</a> and
<a href="http://comet.lehman.cuny.edu/stjohn">Katherine St. John</a>.
Efficiently Calculating Tree Measures Using SAT
</td>
</tr>
<tr>
<td>
<a href="http://yury.chebiryak.name">Yury Chebiryak</a>,
<a href="http://www.comlab.ox.ac.uk/people/Thomas.Wahl/">Thomas Wahl</a>,
<a href="http://www.inf.ethz.ch/personal/daniekro/">Daniel Kröning</a> and
Leopold Haller.
Finding Lean Induced Cycles in Binary Hypercubes
</td>
</tr>
<tr>
<td>
Jingchao Chen.
Building a Hybrid SAT Solver via Conflict-driven, Look-ahead and XOR Reasoning Techniques
</td>
</tr>
<tr>
<td>
Nadia Creignou,
Hervé Daudé,
Uwe Egly and
Raphaël Rossignol.
(1,2)-QSAT: a good candidate for understanding phase transition mechanisms
</td>
</tr>
<tr>
<td>
<a href="http://eigold.tripod.com/">Eugene Goldberg</a>.
Boundary Points and Resolution
</td>
</tr>
<tr>
<td>
<a href="http://www.cs.cornell.edu/~bistra">Bistra Dilkina</a>,
<a href="http://www.cs.cornell.edu/gomes">Carla Gomes</a> and
<a href="http://www.cs.cornell.edu/~sabhar">Ashish Sabharwal</a>.
Backdoors in the Context of Learning
</td>
</tr>
<tr>
<td>
Alexandra Goultiaeva,
Vicki Iverson and
<a href="http://www.cs.toronto.edu/~fbacchus">Fahiem Bacchus</a>.
Beyond CNF: a Circuit-Based QBF Solver
</td>
</tr>
<tr>
<td>
Shai Haim and
<a href="http://www.cse.unsw.edu.au/~tw/">Toby Walsh</a>.
Restart Strategy Selection using Machine Learning Techniques
</td>
</tr>
<tr>
<td>
Hyojung Han and
<a href="http://vlsi.colorado.edu/~fabio">Fabio Somenzi</a>.
On-The-Fly Clause Improvement
</td>
</tr>
<tr>
<td>
<a href="http://www.cs.toronto.edu/~eihsu">Eric Hsu</a> and
Sheila McIlraith.
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
</td>
</tr>
<tr>
<td>
<a href="http://www.mpi-inf.mpg.de/~johannse">Daniel Johannsen</a>,
<a href="http://www.cs.ucc.ie/~ir2">Igor Razgon</a> and
<a href="http://www.mpi-inf.mpg.de/~wahl/">Magnus Wahlström</a>.
Solving SAT for CNF formulas with a one-sided variable occurrence restriction
</td>
</tr>
<tr>
<td>
<a href="http://www.tcs.ifi.lmu.de/~jjohanns">Jan Johannsen</a>.
An exponential lower bound for width-restricted clause learning
</td>
</tr>
<tr>
<td>
Hyondeuk Kim,
<a href="http://vlsi.colorado.edu/~fabio">Fabio Somenzi</a> and
HoonSang Jin.
Efficient Term-ITE Conversion for Satisfiability Modulo Theories
</td>
</tr>
<tr>
<td>
<a href="http://wwwcs.uni-paderborn.de/cs/ag-klbue/de/staff/kbcsl/index.html">Hans Kleine Büning</a>,
<a href="http://logic.sysu.edu.cn/english/ShowArticle.asp?ArticleID=20 ">Xishun Zhao</a> and
<a href="http://wwwcs.uni-paderborn.de/cs/ag-klbue/en/staff/ububeck/index.html">Uwe Bubeck</a>.
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
</td>
</tr>
<tr>
<td>
<a href="http://logic.pdmi.ras.ru/~arist">Arist Kojevnikov</a>,
<a href="http://logic.pdmi.ras.ru/~kulikov">Alexander Kulikov</a> and
<a href="http://logic.pdmi.ras.ru/~grigory">Grigory Yaroslavtsev</a>.
Finding Efficient Circuits Using SAT-solvers
</td>
</tr>
<tr>
<td>
Lukas Kroc,
<a href="http://www.cs.cornell.edu/~sabhar">Ashish Sabharwal</a>
and
<a href="http://www.cs.cornell.edu/selman">Bart Selman</a>.
Relaxed DPLL Search for MaxSAT
</td>
</tr>
<tr>
<td>
<a href="http://www.lsi.upc.es/~larrosa/">Javier Larrosa</a>,
<a href="http://www.lsi.upc.edu/~roberto">Robert Nieuwenhuis</a>,
<a href="http://www.lsi.upc.edu/~oliveras">Albert Oliveras</a> and
<a href="http://www.lsi.upc.edu/~erodri/">Enric Rodríguez Carbonell</a>.
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
</td>
</tr>
<tr>
<td>
Matthew Lewis,
<a href="http://www.star.dist.unige.it/~paolo">Paolo Marin</a>,
Tobias Schubert,
<a href="http://www.star.dist.unige.it/~mox">Massimo Narizzano</a>,
<a href="http://ira.informatik.uni-freiburg.de">Bernd Becker</a> and
<a href="http://www.star.dist.unige.it/~enrico">Enrico Giunchiglia</a>.
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
</td>
</tr>
<tr>
<td>
<a href="http://www.laria.u-picardie.fr/~cli">Chu Min Li</a>,
<a href="http://www.iiia.csic.es/">Felip Manyà</a>,
Nouredine Ould Mohamedou and
<a href="http://web.udl.es/usuaris/m4372594/">Jordi Planes</a>.
Exploiting Cycle Structures in Max-SAT
</td>
</tr>
<tr>
<td>
<a href="http://www.eecs.umich.edu/~liffiton/">Mark Liffiton</a> and
<a href="http://www.eecs.umich.edu/~karem">Karem Sakallah</a>.
Generalizing Core-Guided Max-SAT
</td>
</tr>
<tr>
<td>
<a href="http://fmv.jku.at/lonsing/">Florian Lonsing</a> and
<a href="http://fmv.jku.at/biere">Armin Biere</a>.
A Compact Representation for Syntactic Dependencies in QBFs
</td>
</tr>
<tr>
<td>
<a href="http://sat.inesc-id.pt/~vmm/">Vasco Manquinho</a>,
<a href="http://www.csi.ucd.ie/staff/jpms/">Joao Marques-Silva</a> and
<a href="http://web.udl.es/usuaris/m4372594/">Jordi Planes</a>.
Algorithms for Weighted Boolean Optimization
</td>
</tr>
<tr>
<td>
<a href="http://www.matf.bg.ac.rs/~nikolic">Mladen Nikolić</a>,
<a href="http://www.matf.bg.ac.yu/~filip">Filip Marić</a> and
<a href="http://www.matf.bg.ac.yu/~janicic">Predrag Janičić</a>.
Instance-Based Selection of Policies for SAT Solvers
</td>
</tr>
<tr>
<td>
Kei Ohmura and
<a href="http://www.ueda.info.waseda.ac.jp/">Kazunori Ueda</a>.
c-sat: A Parallel SAT Solver for Clusters
</td>
</tr>
<tr>
<td>
Knot Pipatsrisawat and
Adnan Darwiche.
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
</td>
</tr>
<tr>
<td>
<a href="http://www.scale.uni-koeln.de/mitarbeiter/porschen">Stefan Porschen</a>,
<a href="http://www.scale.uni-koeln.de/mitarbeiter/schmidt">Tatjana Schmidt</a> and
<a href="http://www.informatik.uni-koeln.de/ls_speckenmeyer/">Ewald Speckenmeyer</a>.
On Some Aspects of Mixed Horn Formulas
</td>
</tr>
<tr>
<td>
<a href="http://www.forsyte.cs.tu-darmstadt.de/~samer/">Marko Samer</a> and
<a href="http://www.forsyte.cs.tu-darmstadt.de/~veith">Helmut Veith</a>.
Encoding Treewidth into SAT
</td>
</tr>
<tr>
<td>
Bas Schaafsma,
<a href="http://www.st.ewi.tudelft.nl/~heule/">Marijn Heule</a> and
Hans van Maaren.
Dynamic Symmetry Breaking by Simulating Zykov Contraction
</td>
</tr>
<tr>
<td>
<a href="http://www.carstensinz.de">Carsten Sinz</a> and
Markus Iser.
Problem-Sensitive Restart Heuristics for the DPLL Procedure
</td>
</tr>
<tr>
<td>
<a href="http://www.cs.sfu.ca/~evgenys">Evgeny Skvortsov</a>.
A Theoretical Analysis of Search in GSAT
</td>
</tr>
<tr>
<td>
Niklas Sörensson and
<a href="http://fmv.jku.at/biere">Armin Biere</a>.
Minimizing Learned Clauses
</td>
</tr>
<tr>
<td>
<a href="http://planete.inrialpes.fr/~soos/">Mate Soos</a>,
Karsten Nohl and
<a href="http://www.inrialpes.fr/planete/people/ccastel/">Claude Castelluccia</a>.
Extending SAT solvers to cryptographic problems
</td>
</tr>
<tr>
<td>
Zbigniew Stachniak and
<a href="http://www.cse.yorku.ca/~antonb">Anton Belov</a>.
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability
</td>
</tr>
<tr>
<td>
<a href="http://www.dur.ac.uk/stefan.szeider/">Stefan Szeider</a>.
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
</td>
</tr>
<tr>
<td>
<a href="http://www.inf.ethz.ch/personal/traxlerp/">Patrick Traxler</a>.
Variable Influences in Conjunctive Normal Forms
</td>
</tr>
<tr>
<td>
<a href="http://www.cse.ucsc.edu/~avg">Allen Van Gelder</a>.
Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces
</td>
</tr>
</table>
<hr />
<p></p>
<span id="validate-picture">
<a href="http://validator.w3.org/check?uri=referer">
<img src="images/valid-xhtml10"
alt="Valid XHTML 1.0 Strict" height="31" width="88" />
</a>
<a href="http://jigsaw.w3.org/css-validator/check?uri=referer">
<img src="images/vcss"
alt="Valid CSS level 2.1" height="31" width="88" />
</a>
</span>
<span id="last-modified">
<!-- hhmts start -->
Last modified: Sat Sep 19 19:04:04 BST 2009
<!-- hhmts end -->
</span>
</div>
</div>
</body>
</html>