SAT 2016: 19TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING

A
Alt, Leonardo	OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing
Arif, M. Fareed	BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies
Audemard, Gilles	Extreme Cases in SAT Problems
B
Balabanov, Valeriy	2QBF: challenges and solutions
Balyo, Tomas	HordeQBF: A Modular and Massively Parallel QBF Solver
Becker, Bernd	Dependency Schemes for DQBF
Berend, Daniel	The Normalized Autocorrelation Length of Random Max r-Sat Converges in Probability to (1-1/2^r)/r
Berg, Jeremias	LMHS: A SAT-IP Hybrid MaxSAT Solver
Beyersdorff, Olaf	Lifting QBF Resolution Calculi to DQBF
Bogaerts, Bart	Improved static symmetry breaking for SAT
Brayton, Robert	Heuristic NPN classification for large functions using AIGs and LEXSAT 2QBF: challenges and solutions
Bruynooghe, Maurice	Improved static symmetry breaking for SAT
C
Candeago, Lorenzo	Speeding Up the Constraint-Based Method in Difference Logic
Chau, Cuong	Computing Maximum Unavoidable Subgraphs using SAT Solvers
Chew, Leroy	Lifting QBF Resolution Calculi to DQBF
Czarnecki, Krzysztof	Learning Rate Based Branching Heuristic for SAT Solvers
D
De Micheli, Giovanni	Heuristic NPN classification for large functions using AIGs and LEXSAT
de Oliveira Oliveira, Mateus	Satisfiability via Smooth Pictures
Denecker, Marc	Improved static symmetry breaking for SAT
Devriendt, Jo	Improved static symmetry breaking for SAT
E
Egly, Uwe	On stronger calculi for QBFs Q-Resolution with Generalized Axioms
Elffers, Jan	Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
F
Fichte, Johannes K.	Strong Backdoors for Default Logic
Fremont, Daniel J.	On the Hardness of SAT with Community Structure
G
Ganesh, Vijay	Learning Rate Based Branching Heuristic for SAT Solvers
H
Heule, Marijn	Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer Computing Maximum Unavoidable Subgraphs using SAT Solvers
Hyvärinen, Antti	OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing
I
Ienne, Paolo	Heuristic NPN classification for large functions using AIGs and LEXSAT
Ignatiev, Alexey	BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies MCS Extraction with Sublinear Oracle Calls
Inala, Jeevana Priya	Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
J
Janota, Mikolas	On Q-Resolution and DPLL QBF Solving
Jiang, Jie-Hong Roland	2QBF: challenges and solutions
Johannsen, Jan	Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
Jonas, Martin	Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams
Järvisalo, Matti	LMHS: A SAT-IP Hybrid MaxSAT Solver
K
Khasidashvili, Zurab	Predicate elimination for preprocessing in first-order theorem proving
Kolaitis, Phokion	Coping with Inconsistent Databases: Semantics, Algorithms, and Complexity
Korovin, Konstantin	Predicate elimination for preprocessing in first-order theorem proving
Kullmann, Oliver	Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer
L
Larraz, Daniel	Speeding Up the Constraint-Based Method in Difference Logic
Lauria, Massimo	Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
Liang, Jia	Learning Rate Based Branching Heuristic for SAT Solvers
Lindauer, Marius	SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
Lodha, Neha	A SAT Approach to Branchwidth
Lonsing, Florian	HordeQBF: A Modular and Massively Parallel QBF Solver Q-Resolution with Generalized Axioms
M
Magnard, Thomas	Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
Manthey, Norbert	BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
Marek, Victor	Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer
Marescotti, Matteo	OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing
Marques-Silva, Joao	BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies MCS Extraction with Sublinear Oracle Calls
Meier, Arne	Strong Backdoors for Default Logic
Mencia, Carlos	BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies MCS Extraction with Sublinear Oracle Calls
Mengel, Stefan	Parameterized Compilation Lower Bounds for Restricted CNF-formulas
Mishchenko, Alan	Heuristic NPN classification for large functions using AIGs and LEXSAT 2QBF: challenges and solutions
Monniaux, David	Satisfiability Testing, a Disruptive Technology in Program Verification
Mull, Nathan	On the Hardness of SAT with Community Structure
N
Nordstrom, Jakob	Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
O
Oliveras, Albert	Speeding Up the Constraint-Based Method in Difference Logic
Oparin, Vsevolod	Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle
Ordyniak, Sebastian	A SAT Approach to Branchwidth
P
Peitl, Tomáš	Long Distance Q-Resolution with Dependency Schemes
Penaloza, Rafael	BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies
Petkovska, Ana	Heuristic NPN classification for large functions using AIGs and LEXSAT
Poupart, Pascal	Learning Rate Based Branching Heuristic for SAT Solvers
Previti, Alessandro	MCS Extraction with Sublinear Oracle Calls
R
Rabe, Markus N.	Incremental Determinization
Reger, Giles	Finding Finite Models in Multi-Sorted First Order Logic
Rodríguez Carbonell, Enric	Speeding Up the Constraint-Based Method in Difference Logic
Rubio, Albert	Speeding Up the Constraint-Based Method in Difference Logic
Ruemmer, Philipp	Deciding Bit-Vector Formulas with mcSAT
S
Saikko, Paul	LMHS: A SAT-IP Hybrid MaxSAT Solver
Scharpfenecker, Patrick	Solution-Graphs of Boolean Formulas and Isomorphism
Schaub, Torsten	From SAT to ASP and back!
Schindler, Irina	Strong Backdoors for Default Logic
Schmidt, Renate	Lifting QBF Resolution Calculi to DQBF
Scholl, Christoph	Dependency Schemes for DQBF 2QBF: challenges and solutions
Seidl, Martina	Q-Resolution with Generalized Axioms
Seshia, Sanjit A.	On the Hardness of SAT with Community Structure Incremental Determinization
Sharygina, Natasha	OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing
Simon, Laurent	Extreme Cases in SAT Problems
Singh, Rohit	Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
Slivovsky, Friedrich	Long Distance Q-Resolution with Dependency Schemes
Soeken, Mathias	Heuristic NPN classification for large functions using AIGs and LEXSAT
Solar-Lezama, Armando	Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
Sterin, Baruch	Heuristic NPN classification for large functions using AIGs and LEXSAT
Strejcek, Jan	Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams
Suda, Martin	Lifting QBF Resolution Calculi to DQBF Finding Finite Models in Multi-Sorted First Order Logic
Szeider, Stefan	Long Distance Q-Resolution with Dependency Schemes A SAT Approach to Branchwidth
T
Tentrup, Leander	Non-prenex QBF Solving using Abstraction
Torán, Jacobo	Solution-Graphs of Boolean Formulas and Isomorphism
Twitto, Yochai	The Normalized Autocorrelation Length of Random Max r-Sat Converges in Probability to (1-1/2^r)/r
V
Vinyals, Marc	Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
Voronkov, Andrei	Finding Finite Models in Multi-Sorted First Order Logic
W
Wimmer, Karina	Dependency Schemes for DQBF
Wimmer, Ralf	Dependency Schemes for DQBF
Wintersteiger, Christoph M.	Deciding Bit-Vector Formulas with mcSAT
Z
Zeljić, Aleksandar	Deciding Bit-Vector Formulas with mcSAT
Zintchenko, Ilia	Presentation of the company Mindi

Disclaimer | Powered by EasyChair Smart Program