SAT 2015: 18TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING

A
Abraham, Erika	SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
Achlioptas, Dimitris	Random Formulas are Irrelevant, Right?
Ansótegui, Carlos	Using Community Structure to Detect Relevant Learnt Clauses
Argelich, Josep	Max-SAT Evaluation 2015
Arif, M. Fareed	Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
Aziz, Rehan Abdul	Projected Model Counting
B
Balabanov, Valeriy	Speeding up MUS Extraction with Preprocessing and Chunking
Balyo, Tomáš	HordeSat: A Massively Parallel Portfolio SAT Solver SAT Race 2015
Becker, Bernd	Laissez-Faire Caching for Parallel #SAT Solving Preprocessing for DQBF
Biere, Armin	Evaluating CDCL Variable Scoring Schemes
Bloem, Roderick	Reactive Synthesis
Bova, Simone	On Compiling CNFs into Structured Deterministic DNNFs
Burchard, Jan	Laissez-Faire Caching for Parallel #SAT Solving
C
Cai, Shaowei	CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
Capelli, Florent	On Compiling CNFs into Structured Deterministic DNNFs
Chen, Ruiwen	Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
Chu, Geoffrey	Projected Model Counting
Corzilius, Florian	SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
Czarnecki, Krzysztof	SATGraf: Visualising the Evolution of SAT Formula Structure in Solvers
D
Dershowitz, Nachum	Hints Revealed
Dillig, Isil	Abductive Inference and Its Applications in Program Analysis, Verification, and Synthesis
Douglass, Adam	Constructing SAT filters with a quantum annealer
E
Egly, Uwe	Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
F
Falkner, Stefan	SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
Fischmeister, Sebastian	SATGraf: Visualising the Evolution of SAT Formula Structure in Solvers
Fröhlich, Andreas	Evaluating CDCL Variable Scoring Schemes
G
Ganesh, Vijay	SATGraf: Visualising the Evolution of SAT Formula Structure in Solvers
Ganian, Robert	Community Structure Inspired Algorithms for SAT and #SAT
Giráldez-Cru, Jesus	Using Community Structure to Detect Relevant Learnt Clauses
Gitina, Karina	Preprocessing for DQBF
H
Hsu, Tzu-Chien	QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
Hutter, Frank	SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
Hyvärinen, Antti E. J.	Search-Space Partitioning for Parallelizing SMT Solvers
I
Ignatiev, Alexey	SAT-Based Formula Simplification
Iser, Markus	Recognition of Nested Gates in CNF Formulas
Ivrii, Alexander	Mining Implied Literals for Incremental SAT Speeding up MUS Extraction with Preprocessing and Chunking
J
Janota, Mikolas	Exploiting Resolution-based Representations for MaxSAT Solving
Jiang, Jie-Hong Roland	QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
Junges, Sebastian	SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
K
Kalechstain, Jonathan	Hints Revealed
Kalla, Priyank	Formal Verification of Arithmetic Datapaths using Algebraic Geometry and Symbolic Computation
Kaufmann, Michael	A New Approach to Partial MUS Enumeration
King, Andrew	Constructing SAT filters with a quantum annealer
Kremer, Gereon	SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
Kullmann, Oliver	Computing maximal autarkies with few and simple oracle queries
L
Levy, Jordi	Using Community Structure to Detect Relevant Learnt Clauses
Liang, Jia Hui	SATGraf: Visualising the Evolution of SAT Formula Structure in Solvers
Lindauer, Marius	SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
Lindsay, William	SATGraf: Visualising the Evolution of SAT Formula Structure in Solvers
Lonsing, Florian	Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
Luo, Chuan	CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
Lynce, Ines	Exploiting Resolution-based Representations for MaxSAT Solving
M
Mangal, Ravi	Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
Manquinho, Vasco	Exploiting Resolution-based Representations for MaxSAT Solving
Manthey, Norbert	Recognition of Nested Gates in CNF Formulas Pseudo-Boolean Evaluation 2015
Marescotti, Matteo	Search-Space Partitioning for Parallelizing SMT Solvers
Marques-Silva, Joao	SAT-Based Formula Simplification Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing SAT-Based Horn Least Upper Bounds Computing maximal autarkies with few and simple oracle queries
Martins, Ruben	Exploiting Resolution-based Representations for MaxSAT Solving
Mencía, Carlos	Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing SAT-Based Horn Least Upper Bounds
Mengel, Stefan	On Compiling CNFs into Structured Deterministic DNNFs
Muise, Christian	Projected Model Counting
N
Naik, Mayur	Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
Neves, Miguel	Exploiting Resolution-based Representations for MaxSAT Solving
Newsham, Zack	SATGraf: Visualising the Evolution of SAT Formula Structure in Solvers
Nist, Jennifer	Preprocessing for DQBF
Nori, Aditya	Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
O
Oh, Chanseok	Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
P
Philipp, Tobias	Pseudo-Boolean Evaluation 2015
Philipp, Tobias	PBLib -- A C++ Toolkit for Encoding Pseudo-Boolean Constraints into CNF
Platzer, André	Proving Hybrid Systems
Previti, Alessandro	SAT-Based Formula Simplification SAT-Based Horn Least Upper Bounds
R
Raymond, Jack	Constructing SAT filters with a quantum annealer
Ryvchin, Vadim	Mining Implied Literals for Incremental SAT Hints Revealed
S
Sanders, Peter	HordeSat: A Massively Parallel Portfolio SAT Solver
Santhanam, Rahul	Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
Scholl, Christoph	Preprocessing for DQBF
Schubert, Tobias	Laissez-Faire Caching for Parallel #SAT Solving
Schupp, Stefan	SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
Sharygina, Natasha	Search-Space Partitioning for Parallelizing SMT Solvers
Simon, Laurent	Using Community Structure to Detect Relevant Learnt Clauses
Sinz, Carsten	HordeSat: A Massively Parallel Portfolio SAT Solver Recognition of Nested Gates in CNF Formulas
Slivovsky, Friedrich	On Compiling CNFs into Structured Deterministic DNNFs
Slobodova, Anna	Pragmatic Approach to Formal Verification
Steinke, Peter	PBLib -- A C++ Toolkit for Encoding Pseudo-Boolean Constraints into CNF
Strichman, Ofer	Mining Implied Literals for Incremental SAT
Stuckey, Peter J.	Projected Model Counting
Su, Kaile	CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
Szeider, Stefan	Community Structure Inspired Algorithms for SAT and #SAT
T
Tomb, Aaron	Applying Satisfiability to the Analysis of Cryptography
Tu, Kuan-Hua	QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
W
Wimmer, Ralf	Preprocessing for DQBF
Z
Zhang, Xin	Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
Zielke, Christian	A New Approach to Partial MUS Enumeration

Disclaimer | Powered by EasyChair Smart Program