SAT 2016: 19TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
GLOBAL TALK AUTHOR INDEX
Shortcuts: ABCDEFGHIJKLMNOPRSTVWYZ
A
Alt, Leonardo
(SAT 2016)
OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing
Arif, M. Fareed
(SAT 2016)
BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies
Audemard, Gilles
(SAT 2016)
Extreme Cases in SAT Problems
B
Balabanov, Valeriy
(SAT 2016)
2QBF: challenges and solutions
Balyo, Tomas
(SAT 2016)
HordeQBF: A Modular and Massively Parallel QBF Solver
Becker, Bernd
(SAT 2016)
Dependency Schemes for DQBF
Berend, Daniel
(SAT 2016)
The Normalized Autocorrelation Length of Random Max r-Sat Converges in Probability to (1-1/2^r)/r
Berg, Jeremias
(SAT 2016)
LMHS: A SAT-IP Hybrid MaxSAT Solver
Beyersdorff, Olaf
(SAT 2016)
Lifting QBF Resolution Calculi to DQBF
(QBF 2016)
Dependency Schemes in QBF Calculi: Semantics and Soundness
Biere, Armin
(SOLVE IT WITH SAT)
Translating problems into SAT
Blinkhorn, Joshua
(QBF 2016)
Dependency Schemes in QBF Calculi: Semantics and Soundness
Bofill, Miquel
(POS-16)
A Study on Implied Constraints in a MaxSAT Approach to B2B Problems
Bogaerts, Bart
(SAT 2016)
Improved static symmetry breaking for SAT
Brayton, Robert K.
(SAT 2016)
2QBF: challenges and solutions
(SAT 2016)
Heuristic NPN classification for large functions using AIGs and LEXSAT
Bruynooghe, Maurice
(SAT 2016)
Improved static symmetry breaking for SAT
C
Candeago, Lorenzo
(SAT 2016)
Speeding Up the Constraint-Based Method in Difference Logic
Capelli, Florent
(STRUCTSAT 2016)
Structure-based knowledge compilation: the singular case of $\beta$-acyclic formulas
Charwat, Günther
(QBF 2016)
Dynamic Programming-based QBF Solving
Chau, Cuong
(SAT 2016)
Computing Maximum Unavoidable Subgraphs using SAT Solvers
Chew, Leroy
(SAT 2016)
Lifting QBF Resolution Calculi to DQBF
Czarnecki, Krzysztof
(SAT 2016)
Learning Rate Based Branching Heuristic for SAT Solvers
Czarnecki, Krzysztof
(POS-16)
Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
D
De Micheli, Giovanni
(SAT 2016)
Heuristic NPN classification for large functions using AIGs and LEXSAT
de Oliveira Oliveira, Mateus
(SAT 2016)
Satisfiability via Smooth Pictures
Dell, Holger
(STRUCTSAT 2016)
Complexity and Approximability for Parameterized MAXCSPs
Denecker, Marc
(SAT 2016)
Improved static symmetry breaking for SAT
Devriendt, Jo
(SAT 2016)
Improved static symmetry breaking for SAT
Diptarama,
(QBF 2016)
QBF Encoding of Generalized Tic-Tac-Toe
E
Egly, Uwe
(SAT 2016)
Q-Resolution with Generalized Axioms
(SAT 2016)
On stronger calculi for QBFs
Eiben, Eduard
(STRUCTSAT 2016)
Using Decomposition-Parameters for QBF: Mind the Prefix!
Elffers, Jan
(POS-16)
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
(SAT 2016)
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
F
Fichte, Johannes K.
(SAT 2016)
Strong Backdoors for Default Logic
Fremont, Daniel J.
(SAT 2016)
On the Hardness of SAT with Community Structure
G
Ganesh, Vijay
(POS-16)
Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
(SAT 2016)
Learning Rate Based Branching Heuristic for SAT Solvers
Ganian, Robert
(STRUCTSAT 2016)
Using Decomposition-Parameters for QBF: Mind the Prefix!
Garcia, Marc
(POS-16)
A Study on Implied Constraints in a MaxSAT Approach to B2B Problems
Gebotys, Catherine
(POS-16)
Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
Giráldez-Cru, Jesús
(POS-16)
A Study on Implied Constraints in a MaxSAT Approach to B2B Problems
(STRUCTSAT 2016)
Pseudo-Industrial Random SAT Generators
H
Heule, Marijn
(SOLVE IT WITH SAT)
Proofs of Unsatisfiability
(SAT 2016)
Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer
(SAT 2016)
Computing Maximum Unavoidable Subgraphs using SAT Solvers
Hyvärinen, Antti
(SAT 2016)
OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing
I
Ienne, Paolo
(SAT 2016)
Heuristic NPN classification for large functions using AIGs and LEXSAT
Ignatiev, Alexey
(SAT 2016)
BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies
(SAT 2016)
MCS Extraction with Sublinear Oracle Calls
Inaba, Mary
(POS-16)
Approximate History Map for Massively Parallel Environments
Inala, Jeevana Priya
(SAT 2016)
Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
Iwata, Yoichi
(STRUCTSAT 2016)
CNF Encoding of Cardinality Constraints via Tree-Decomposition
J
Jamali, Sima
(STRUCTSAT 2016)
Experiments with CNF Structure and Hardness
Janota, Mikolas
(QBF 2016)
Short Presentations of Submissions to QBF Eval 2016
Janota, Mikolas
(SAT 2016)
On Q-Resolution and DPLL QBF Solving
(QBF 2016)
On Conflicts and Strategies in QBF
Jiang, Jie-Hong Roland
(SAT 2016)
2QBF: challenges and solutions
Johannsen, Jan
(SAT 2016)
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
Jonas, Martin
(SAT 2016)
Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams
Järvisalo, Matti
(SAT 2016)
LMHS: A SAT-IP Hybrid MaxSAT Solver
K
Khasidashvili, Zurab
(SAT 2016)
Predicate elimination for preprocessing in first-order theorem proving
Kim, Eunjung
(STRUCTSAT 2016)
Complexity and Approximability for Parameterized MAXCSPs
Kleine Büning, Hans
(QBF 2016)
Open Problems for Quantified Boolean Formulas
Kolaitis, Phokion
(SAT 2016)
Coping with Inconsistent Databases: Semantics, Algorithms, and Complexity
Korovin, Konstantin
(SAT 2016)
Predicate elimination for preprocessing in first-order theorem proving
Korovin, Konstantin
(QBF 2016)
Short Presentations of Submissions to QBF Eval 2016
Kullmann, Oliver
(SAT 2016)
Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer
(STRUCTSAT 2016)
Minimal unsatisfiability and deficiency: recent developments
L
Lampis, Michael
(STRUCTSAT 2016)
Complexity and Approximability for Parameterized MAXCSPs
Larraz, Daniel
(SAT 2016)
Speeding Up the Constraint-Based Method in Difference Logic
Lauria, Massimo
(SAT 2016)
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
Levy, Jordi
(STRUCTSAT 2016)
Pseudo-Industrial Random SAT Generators
Liang, Jia
(POS-16)
Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
(SAT 2016)
Learning Rate Based Branching Heuristic for SAT Solvers
Lindauer, Marius
(SOLVE IT WITH SAT)
Automatic solver configuration using SMAC
(SAT 2016)
SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
Lodha, Neha
(SAT 2016)
A SAT Approach to Branchwidth
Lonsing, Florian
(SAT 2016)
Q-Resolution with Generalized Axioms
(SAT 2016)
HordeQBF: A Modular and Massively Parallel QBF Solver
(QBF 2016)
Short Presentations of Submissions to QBF Eval 2016
Lonsing, Florian
(QBF 2016)
Discussion
M
Magnard, Thomas
(SAT 2016)
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
Manthey, Norbert
(POS-16)
Better Evaluations by Analyzing Benchmark Structure
(SAT 2016)
BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies
(SAT 2016)
SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
Marek, Victor
(SAT 2016)
Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer
Marescotti, Matteo
(SAT 2016)
OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing
Marques-Silva, Joao
(SOLVE IT WITH SAT)
Efficient Problem Solving with SAT Engines
(SAT 2016)
BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies
(SAT 2016)
MCS Extraction with Sublinear Oracle Calls
Mcbride, Ryan
(STRUCTSAT 2016)
Experiments with CNF Structure and Hardness
Meier, Arne
(SAT 2016)
Strong Backdoors for Default Logic
Mencia, Carlos
(SAT 2016)
BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies
(SAT 2016)
MCS Extraction with Sublinear Oracle Calls
Mengel, Stefan
(SAT 2016)
Parameterized Compilation Lower Bounds for Restricted CNF-formulas
Mishchenko, Alan
(SAT 2016)
2QBF: challenges and solutions
(SAT 2016)
Heuristic NPN classification for large functions using AIGs and LEXSAT
Mitchell, David
(STRUCTSAT 2016)
Experiments with CNF Structure and Hardness
Mitsou, Valia
(STRUCTSAT 2016)
Complexity and Approximability for Parameterized MAXCSPs
Moehle, Sibylle
(POS-16)
Better Evaluations by Analyzing Benchmark Structure
Monniaux, David
(SAT 2016)
Satisfiability Testing, a Disruptive Technology in Program Verification
Moon, Seongsoo
(POS-16)
Approximate History Map for Massively Parallel Environments
Mull, Nathan
(SAT 2016)
On the Hardness of SAT with Community Structure
Mömke, Tobias
(STRUCTSAT 2016)
Complexity and Approximability for Parameterized MAXCSPs
N
Nejati, Saeed
(POS-16)
Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
Nordstrom, Jakob
(POS-16)
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
(SAT 2016)
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
O
Oliveras, Albert
(SAT 2016)
Speeding Up the Constraint-Based Method in Difference Logic
Oparin, Vsevolod
(SAT 2016)
Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle
Ordyniak, Sebastian
(SAT 2016)
A SAT Approach to Branchwidth
(STRUCTSAT 2016)
Using Decomposition-Parameters for QBF: Mind the Prefix!
P
Peitl, Tomáš
(SAT 2016)
Long Distance Q-Resolution with Dependency Schemes
Penaloza, Rafael
(SAT 2016)
BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies
Petkovska, Ana
(SAT 2016)
Heuristic NPN classification for large functions using AIGs and LEXSAT
Poupart, Pascal
(SAT 2016)
Learning Rate Based Branching Heuristic for SAT Solvers
Previti, Alessandro
(SAT 2016)
MCS Extraction with Sublinear Oracle Calls
Pulina, Luca
(QBF 2016)
QBFEval 2016
R
Rabe, Markus
(QBF 2016)
Short Presentations of Submissions to QBF Eval 2016
Rabe, Markus N.
(SAT 2016)
Incremental Determinization
Reger, Giles
(SAT 2016)
Finding Finite Models in Multi-Sorted First Order Logic
Rodríguez Carbonell, Enric
(SAT 2016)
Speeding Up the Constraint-Based Method in Difference Logic
Rubio, Albert
(SAT 2016)
Speeding Up the Constraint-Based Method in Difference Logic
Ruemmer, Philipp
(SAT 2016)
Deciding Bit-Vector Formulas with mcSAT
S
Saikko, Paul
(SAT 2016)
LMHS: A SAT-IP Hybrid MaxSAT Solver
Sakallah, Karem A.
(POS-16)
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
Scharpfenecker, Patrick
(SAT 2016)
Solution-Graphs of Boolean Formulas and Isomorphism
Schaub, Torsten
(SAT 2016)
From SAT to ASP and back!
Schindler, Irina
(SAT 2016)
Strong Backdoors for Default Logic
Schmidt, Renate
(SAT 2016)
Lifting QBF Resolution Calculi to DQBF
Scholl, Christoph
(SAT 2016)
2QBF: challenges and solutions
(SAT 2016)
Dependency Schemes for DQBF
(QBF 2016)
Skolem Functions for DQBF
Sebastiani, Roberto
(SOLVE IT WITH SAT)
Some simple useful theories to solve your problems with SMT
Seidl, Martina
(SAT 2016)
Q-Resolution with Generalized Axioms
(QBF 2016)
Discussion
Seshia, Sanjit A.
(SAT 2016)
On the Hardness of SAT with Community Structure
(SAT 2016)
Incremental Determinization
Sharygina, Natasha
(SAT 2016)
OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing
Shinohara, Ayumi
(QBF 2016)
QBF Encoding of Generalized Tic-Tac-Toe
Simon, Laurent
(POS-16)
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
(SAT 2016)
Extreme Cases in SAT Problems
Singh, Rohit
(SAT 2016)
Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
Slivovsky, Friedrich
(SAT 2016)
Long Distance Q-Resolution with Dependency Schemes
Soeken, Mathias
(SAT 2016)
Heuristic NPN classification for large functions using AIGs and LEXSAT
Solar-Lezama, Armando
(SAT 2016)
Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
Soos, Mate
(POS-16)
Lessons learnt -- Seven years of CryptoMiniSat
Sterin, Baruch
(SAT 2016)
Heuristic NPN classification for large functions using AIGs and LEXSAT
Strejcek, Jan
(SAT 2016)
Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams
Suda, Martin
(SAT 2016)
Finding Finite Models in Multi-Sorted First Order Logic
(SAT 2016)
Lifting QBF Resolution Calculi to DQBF
(QBF 2016)
First-Order Logic and Blocked Clauses
Szeider, Stefan
(SAT 2016)
A SAT Approach to Branchwidth
(SAT 2016)
Long Distance Q-Resolution with Dependency Schemes
(STRUCTSAT 2016)
Capturing Structure in SAT and Related Problems
T
Tasharrofi, Shahab
(QBF 2016)
Short Presentations of Submissions to QBF Eval 2016
Tentrup, Leander
(QBF 2016)
Short Presentations of Submissions to QBF Eval 2016
Tentrup, Leander
(SAT 2016)
Non-prenex QBF Solving using Abstraction
Torán, Jacobo
(SAT 2016)
Solution-Graphs of Boolean Formulas and Isomorphism
Twitto, Yochai
(SAT 2016)
The Normalized Autocorrelation Length of Random Max r-Sat Converges in Probability to (1-1/2^r)/r
V
Van Gelder, Allen
(QBF 2016)
Short Presentations of Submissions to QBF Eval 2016
Van Gelder, Allen
(POS-16)
The Clashing-Neighbor Relation for Propositional Formulas
Villaret, Mateu
(POS-16)
A Study on Implied Constraints in a MaxSAT Approach to B2B Problems
Vinyals, Marc
(SAT 2016)
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
Voronkov, Andrei
(SAT 2016)
Finding Finite Models in Multi-Sorted First Order Logic
W
Wimmer, Karina
(SAT 2016)
Dependency Schemes for DQBF
Wimmer, Ralf
(SAT 2016)
Dependency Schemes for DQBF
Wimmer, Ralf
(QBF 2016)
Skolem Functions for DQBF
Wintersteiger, Christoph M.
(SAT 2016)
Deciding Bit-Vector Formulas with mcSAT
Woltran, Stefan
(QBF 2016)
Dynamic Programming-based QBF Solving
Y
Yoshinaka, Ryo
(QBF 2016)
QBF Encoding of Generalized Tic-Tac-Toe
Z
Zeljić, Aleksandar
(SAT 2016)
Deciding Bit-Vector Formulas with mcSAT
Zintchenko, Ilia
(SAT 2016)
Presentation of the company Mindi