Theory and Applications of Satisfiability Testing - SAT 2011: 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings

391 Pages·2011·5.02 MB·English

by  Ryan Williams (auth.), Karem A. Sakallah, Laurent Simon (eds.)

Lecture Notes in Computer Science 6695
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
MadhuSudan
MicrosoftResearch,Cambridge,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
MaxPlanckInstituteforInformatics,Saarbruecken,Germany
Karem A. Sakallah Laurent Simon (Eds.)
Theory and Application
of Satisfiability Testing –
SAT 2011
14th International Conference, SAT 2011
Ann Arbor, MI, USA, June 19-22, 2011
Proceedings
1 3
VolumeEditors
KaremA.Sakallah
UniversityofMichigan,DepartmentofEECS,CSEDivision,
2260HaywardAve.,AnnArbor,MI48109-2121,USA
E-mail:[email protected]
LaurentSimon
UniversitéOrsayParis-Sud11,LRI/INRIA
ParcClubUniversité,BâtimentG,4,rueJacquesMonod
91893Orsaycedex
E-mail:[email protected]
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-21580-3 e-ISBN978-3-642-21581-0
DOI10.1007/978-3-642-21581-0
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2011928785
CRSubjectClassification(1998):F.3,F.1,F.2,F.4,C.2.4,I.2,B.7
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©Springer-VerlagBerlinHeidelberg2011
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable
toprosecutionundertheGermanCopyrightLaw.
Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply,
evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws
andregulationsandthereforefreeforgeneraluse.
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper
SpringerispartofSpringerScience+BusinessMedia(www.springer.com)
Preface
This volume contains the papers presented at SAT 2011,the 14th International
Conference on Theory and Applications of Satisfiability Testing (SAT). The
conference was held during June 19–22, 2011 and was hosted by the Computer
Science and Engineering Division of the Department of Electrical Engineering
and Computer Science at the University of Michigan in Ann Arbor. Affiliated
with the main conference were the workshops POS (Pragmatics of SAT), SPA
(SATforPracticalApplications),CSPSAT(WorkshopontheCross-Fertilization
BetweenCSP and SAT) and INCSAT (Workshopon Incomplete Techniques for
ProvingUNSAT).Inaddition,SAT2011featuredthreesolvercompetitions:SAT
Competition2011,Pseudo-BooleanCompetition2011,andMax-SATEvaluation
2011.
The International Conferences on Theory and Applications of Satisfiability
Testing (SAT) originated in 1996 as a series of workshops on satisfiability. By
the third meeting in 2000, the workshop had attracted a mix of theorists and
experimentalists whose common interest was the enhancement of our basic un-
derstandingofthe theoreticalunderpinningsofthe satisfiabilityproblemaswell
as the development of scalable algorithms for its solution in a wide range of ap-
plicationdomains.In2002acompetitionofSATsolverswasinauguratedtospur
further algorithmic and implementation developments, and to create an eclec-
tic collection of benchmarks. The competition expanded in subsequent years to
include pseudo-Boolean, QBF, and MAX-SAT solvers has become an integral
part of these meetings, adding an element of excitement and anticipation. The
interplay between theory and application, as well as the increased interest in
satisfiabilityfromawidercommunityofresearchers,ledtothenaturalevolution
of these initial workshops into the current conference format. The annual SAT
conference is now universally recognized as the venue for publishing the latest
advances in SAT research.
This year marked the 14th SAT meeting. SAT is now interpreted in a broad
sense to include not just propositional satisfiability, but also pseudo-Boolean
constraint solving and optimization (PB), quantified Boolean formulae (QBF),
constraint programming techniques (CP) for word-level problems and their
propositional encoding, and satisfiability modulo theories (SMT). Submissions
were solicited for original research on proof systems, proof complexity, search
algorithms, heuristics, analysis of algorithms, hard instances, randomized for-
mulae,problemencodings,industrialapplications,solvers,simplifiers,tools,case
studies and empirical results. A total of 57 submissions were received and rig-
orously reviewed by a 39-member international Technical Program Committee
(TPC), with each paper receiving at least four independent reviews. Of these
submissions, the TPC decided to accept 25 as regular papers (14 pages, 30-
minute presentation) and 10 as extended abstracts (2 pages) to be presented as
VI Preface
posters. The accepted papers were organized into eight sessions and their full
text is included in these proceedings.
The conference program also featured two invited presentations. The first,
by Ryan Williams, described prior and current work on connecting the art of
finding good satisfiability algorithms with the art of proving complexity lower
bounds. The second, by Koushik Sen, described Concolic Testing, a software
verification approach that combines concrete and symbolic testing and utilizes
the power of modern constraint solvers.
We would like to acknowledge several people for their help in organizing
the conference and associated events. For the myriad logistical arrangements
we are grateful for the superb help we received from Lauri Johnson-Rafalski.
Steve Crang did an excellent job designing the SAT poster and banners as well
as the packet of materials provided to the conference attendees. We appreciate
the tireless efforts of the workshop organizers: Daniel Le Berre and Allen Van
Gelder (POS), Carsten Sinz and Olga Tveretina (SPA), Yael Ben-Haim and
Yehuda Naveh (CSPSAT), and Gilles Audemard, Gilles Dequen, and Djamal
Habet (INCSAT). We also thank the competition organizers: Matti Jarvisalo,
DanielLeBerre,andOlivierRoussel(SATCompetition),VascoManquinhoand
Olivier Roussel (Pseudo-Boolean Competition), and Josep Argelich, Chu Min
Li,FelipMany,andJordiPlanes(Max-SATEvaluation).Last,butnotleast,we
thank the members of the TPC and the additional external reviewers for their
careful and thorough work, without which it would not have been possible for
us to put together such an outstanding conference program.
Finally, we would like to thank Microsoft Research and Microsoft Research
INRIA Joint Centre for their generous support of SAT 2011, the CSE division
ofthedepartmentofEECSattheUniversityofMichiganforprovidingexcellent
facilitiesforhostingtheconferenceandworkshops,andtheLRIoftheUniversity
of Orsay Paris-Sud 11 for hosting the conference website.
April 2011 Karem A. Sakallah
Laurent Simon
Organization
Conference and Program Chairs
Karem A. Sakallah University of Michigan, USA
Laurent Simon University of Orsay Paris-Sud 11, France
Program Committee
Paul Beame University of Washington, USA
Armin Biere Johannes Kepler University, Austria
Randal Bryant Carnegie Mellon University, USA
Alessandro Cimatti IstitutoperlaRicercaScientificaeTecnologica,Italy
Nadia Creignou Universit´e d’Aix-Marseille, France
Leonardo De Moura Microsoft Research, USA
John Franco University of Cincinnati, USA
Enrico Giunchiglia Universita` di Genova, Italy
Youssef Hamadi Microsoft Research, UK
Marijn Heule Delft University of Technology, The Netherlands
Holger Hoos University of British Columbia, Canada
Katsumi Inoue National Institute of Informatics, Japan
George Katsirelos University of Paris-Sud11, France
Hans Kleine Bu¨ning University of Paderborn,Germany
Oliver Kullmann University of Wales Swansea, UK
Daniel Le Berre Universit´e dArtois, France
Chu-Min Li University of Picardie Jules Verne, France
Mark Liffiton Illinois Wesleyan University, USA
Ines Lynce Technical University of Lisbon, Portugal
Panagiotis Manolios Northeastern University, USA
Vasco Manquinho Technical University of Lisbon, Portugal
Felip Manya` Spanish Council for Scientific Research, Spain
Igor Markov University of Michigan, USA
Joao Marques-Silva University College Dublin, Ireland
Cristopher Moore University of New Mexico, USA
Albert Oliveras Technical University of Catalonia, Spain
Ramamohan Paturi University of California, San Diego, USA
Steve Prestwich University College Cork, Ireland
Lakhdar Sais Universit´e dArtois, France
Roberto Sebastiani Universita` di Trento, Italy
Carsten Sinz Karlsruhe Institute of Technology, Germany
Stefan Szeider Vienna University of Technology, Austria
Armando Tacchella Universit`a di Genova, Italy
Allen Van Gelder University of California, Santa Cruz, USA
VIII Organization
Hans Van Maaren Delft University of Technology, The Netherlands
Toby Walsh University of New South Wales, Australia
Xishun Zhao Sun Yat-Sen University, China
External Reviewers
Belov, Anton Martins, Ruben
Bordeaux, Lucas Matthews, William
Bubeck, Uwe Mazure, Bertrand
Chen, Huan Micheli, Andrea
Dantchev, Stefan Mover, Sergio
Davies, Jessica Narizzano, Massimo
Dequen, Gilles Narodytska, Nina
Di Rosa, Emanuele Ordyniak, Sebastian
Egly, Uwe Papavasileiou,Vasilis
Franzen, Anders Piette, C´edric
Gaspers, Serge Planes, Jordi
Goldberg, Eugene Rajaratnam, David
Griggio, Alberto Ridgeway, Jeremy
Gwynne, Matthew Roussel, Olivier
Habet, Djamal Roveri, Marco
Heras, Federico Schaafsma, Bas
Hutter, Frank Schuppan, Viktor
Jabbour, Said Seidl, Martina
Jain, Mitesh Shen, Yuping
Janota, Mikolas Soh, Takehide
Ja¨rvisalo,Matti Styles, James
Kim, Eun Jung Tchaltsev, Andrei
Koshimura, Miyuki Tichit, Laurent
Lagniez, Jean-Marie Tomasi, Silvia
Lallouet, Arnaud Tompkins, Dave
Lettmann Tveretina, Olga
Lettmann, Theo Ueda, Kazunori
Liedloff, Mathieu Wahlstro¨m, Magnus
Lokshtanov,Daniel Xu, Lin
Lonsing, Florian Zdeborova, Lenka
Martin, Barnaby Zengler, Christoph
Sponsoring Institutions
Microsoft Research, UK
Microsoft Research INRIA Joint Centre, France
University of Michigan, USA
University of Orsay Paris-Sud11, France
Table of Contents
Invited Talks
Connecting SAT Algorithms and Complexity Lower Bounds ........... 1
Ryan Williams
Concolic Testing and Constraint Satisfaction ........................ 3
Koushik Sen
Technical Program
Session 1: Complexity Analysis
ParameterizedComplexity of DPLL Search Procedures∗ .............. 5
Olaf Beyersdorff, Nicola Galesi, and Massimo Lauria
Satisfiability Certificates Verifiable in Subexponential Time∗........... 19
Evgeny Dantsin and Edward A. Hirsch
On Variables with Few Occurrences in Conjunctive Normal Forms ..... 33
Oliver Kullmann and Xishun Zhao
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)......... 47
Sebastian Ordyniak, Daniel Paulusma, and Stefan Szeider
Session 2: Binary Decision Diagrams
BDDs for Pseudo-BooleanConstraints – Revisited ................... 61
Ignasi Ab´ıo, Robert Nieuwenhuis, Albert Oliveras, and
Enric Rodr´ıguez-Carbonell
DPLL+ROBDDDerivationAppliedtoInversionofSomeCryptographic
Functions ....................................................... 76
Alexey Ignatiev and Alexander Semenov
πDD: A New Decision Diagram for Efficient Problem Solving in
Permutation Space ............................................... 90
Shin-ichi Minato
∗
Best Paper Candidate.
X Table of Contents
Session 3: Theoretical Analysis
How to Apply SAT-Solving for the Equivalence Test of Monotone
Normal Forms ................................................... 105
Martin Mundhenk and Robert Zeranski
Enumerating All Solutions of a Boolean CSP by Non-decreasing
Weight ......................................................... 120
Nadia Creignou, Fr´ed´eric Olive, and Johannes Schmidt
A Satisfiability-Based Approach for Embedding Generalized
Tanglegrams on Level Graphs ..................................... 134
Ewald Speckenmeyer, Andreas Wotzlaw, and Stefan Porschen
Session 4: Extraction of Minimal Unsatisfiable
Subsets
Minimally Unsatisfiable Boolean Circuits ........................... 145
Anton Belov and Joao Marques-Silva
On Improving MUS Extraction Algorithms.......................... 159
Joao Marques-Silva and Ines Lynce
Faster Extraction of High-Level Minimal Unsatisfiable Cores .......... 174
Vadim Ryvchin and Ofer Strichman
Session 5: SAT Algorithms
On Freezing and Reactivating Learnt Clauses∗ ....................... 188
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, and
Lakhdar Sa¨ıs
Efficient CNF Simplification Based on Binary Implication Graphs...... 201
Marijn J.H. Heule, Matti Ja¨rvisalo, and Armin Biere
Between Restarts and Backjumps .................................. 216
Antonio Ramos, Peter van der Tak, and Marijn J.H. Heule
Session 6: Quantified Boolean Formulae
Abstraction-Based Algorithm for 2QBF............................. 230
Mikola´ˇs Janota and Joao Marques-Silva
Transformations into Normal Forms for Quantified Circuits............ 245
Hans Kleine Bu¨ning, Xishun Zhao, and Uwe Bubeck
∗
Best Paper Candidate.
Table of Contents XI
Failed Literal Detection for QBF................................... 259
Florian Lonsing and Armin Biere
Session 7: Model Enumeration, Local Search
Reducing Chaosin SAT-like Search:Finding Solutions Close to aGiven
One ............................................................ 273
Ignasi Ab´ıo, Morgan Deters, Robert Nieuwenhuis, and
Peter J. Stuckey
Generating Diverse Solutions in SAT ............................... 287
Alexander Nadel
Captain Jack: New Variable Selection Heuristics in Local Search for
SAT............................................................ 302
Dave A.D. Tompkins, Adrian Balint, and Holger H. Hoos
Session 8: Empirical Evaluation
Careful Ranking of Multiple Solvers with Timeouts and Ties .......... 317
Allen Van Gelder
Generalized Conflict-Clause Strengthening for Satisfiability Solvers ..... 329
Allen Van Gelder
Empirical Study of the Anatomy of Modern SAT Solvers.............. 343
Hadi Katebi, Karem A. Sakallah, and Jo˜ao P. Marques-Silva
Extended Abstracts
Translating Pseudo-BooleanConstraints into CNF ................... 357
Amir Aavani
Analyzing the Instances of the MaxSAT Evaluation .................. 360
Josep Argelich, Chu Min Li, Felip Manya`, and Jordi Planes
Model Counting Using the Inclusion-Exclusion Principle .............. 362
Huxley Bennett and Sriram Sankaranarayanan
Phase Transitions in Knowledge Compilation: An Experimental
Study .......................................................... 364
Jian Gao, Minghao Yin, and Ke Xu
EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation.... 367
Oliver Gableske and Marijn J.H. Heule
Non-Model-Based Algorithm Portfolios for SAT...................... 369
Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, and
Meinolf Sellmann