VSL 2014: VIENNA SUMMER OF LOGIC 2014

A
Audemard, Gilles	Impact of Community Structure on SAT Solver Performance Lazy clause exchange policy for parallel SAT solvers
B
Bacchus, Fahiem	Cores in Core based MaxSat Algorithms: an Analysis
Balabanov, Valeriy	QBF Resolution Systems and their Proof Complexities
Balint, Adrian	Efficient implementation of SLS solvers and new heuristics for k-SAT with long clauses
Balyo, Tomáš	Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask)
Belov, Anton	MUS Extraction using Clausal Proofs
Beyersdorff, Olaf	Unified characterisations of resolution hardness measures
Biere, Armin	Efficient implementation of SLS solvers and new heuristics for k-SAT with long clauses Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) Detecting cardinality constraints in CNF
Bulatov, Andrei	Approximating highly satisfiable random 2-SAT
C
Capelli, Florent	Hypergraph Acyclicity and Propositional Model Counting
Codish, Michael	Simplifying Pseudo-Boolean Constraints in Residual Number Systems
Creus, Carles	Automatic Evaluation of Reductions between NP-complete Problems
Crăciun, Adrian	Proof complexity and the Lovasz-Kneser Theorem
D
de Haan, Ronald	Fixed-parameter tractable reductions to SAT
De Moura, Leonardo	A Model-Constructing Satisfiability Calculus
Durand, Arnaud	Hypergraph Acyclicity and Propositional Model Counting
F
Fekete, Yoav	Simplifying Pseudo-Boolean Constraints in Residual Number Systems
Fernández, Pau	Automatic Evaluation of Reductions between NP-complete Problems
Finkbeiner, Bernd	Fast DQBF Refutation
Fischmeister, Sebastian	Impact of Community Structure on SAT Solver Performance
Fröhlich, Andreas	Efficient implementation of SLS solvers and new heuristics for k-SAT with long clauses Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask)
G
Gableske, Oliver	An Ising Model inspired Extension of the Product-based MP Framework for SAT
Ganesh, Vijay	Impact of Community Structure on SAT Solver Performance
Godoy, Guillem	Automatic Evaluation of Reductions between NP-complete Problems
H
Heule, Marijn	MUS Extraction using Clausal Proofs Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
Heyman, Tamir	Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
Hunt, Warren	DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
Husam, Husam	Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
I
Ignatiev, Alexey	On Reducing Maximum Independent Set to Minimum Satisfiability
Inaba, Mary	Community Branching for Parallel Portfolio SAT Solvers
Istrate, Gabriel	Proof complexity and the Lovasz-Kneser Theorem
J
Jiang, Jie-Hong Roland	QBF Resolution Systems and their Proof Complexities
Jordan, Charles	MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
Jovanović, Dejan	A Model-Constructing Satisfiability Calculus
Järvisalo, Matti	Conditional Lower Bounds for Failed Literals and Related Techniques
K
Kaiser, Lukasz	MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
Kondoh, Shuya	Community Branching for Parallel Portfolio SAT Solvers
Konev, Boris	A SAT Attack on the Erdos Discrepancy Conjecture
Korhonen, Janne H.	Conditional Lower Bounds for Failed Literals and Related Techniques
Kullmann, Oliver	Unified characterisations of resolution hardness measures
L
Larraz, Daniel	Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
Le Berre, Daniel	Detecting cardinality constraints in CNF
Leong, Lance	Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
Lisitsa, Alexei	A SAT Attack on the Erdos Discrepancy Conjecture
Lonca, Emmanuel	Detecting cardinality constraints in CNF
Lonsing, Florian	MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
Lynce, Ines	Open-WBO: a Modular MaxSAT Solver
M
Mahajan, Yogesh	Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
Manquinho, Vasco	Open-WBO: a Modular MaxSAT Solver
Manthey, Norbert	Detecting cardinality constraints in CNF
Marques-Silva, Joao	On Computing Preferred MUSes and MCSes MUS Extraction using Clausal Proofs On Reducing Maximum Independent Set to Minimum Satisfiability
Martins, Ruben	Open-WBO: a Modular MaxSAT Solver
Mengel, Stefan	Hypergraph Acyclicity and Propositional Model Counting
Miksa, Mladen	Long Proofs of (Seemingly) Simple Formulas
Morgado, Antonio	On Reducing Maximum Independent Set to Minimum Satisfiability
N
Nadel, Alexander	Ultimately Incremental SAT
Narodytska, Nina	Cores in Core based MaxSat Algorithms: an Analysis
Newsham, Zack	Impact of Community Structure on SAT Solver Performance
Nordström, Jakob	Long Proofs of (Seemingly) Simple Formulas A (Biased) Proof Complexity Survey for SAT Practitioners
O
Oliveras, Albert	Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
P
Previti, Alessandro	On Computing Preferred MUSes and MCSes
R
Rodríguez Carbonell, Enric	Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
Rubio, Albert	Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
Ryvchin, Vadim	Ultimately Incremental SAT
S
Sakai, Takayuki	Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
Schöning, Uwe	Efficient implementation of SLS solvers and new heuristics for k-SAT with long clauses
Seidl, Martina	MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
Seto, Kazuhisa	Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
Simon, Laurent	Impact of Community Structure on SAT Solver Performance Lazy clause exchange policy for parallel SAT solvers
Slivovsky, Friedrich	Variable Dependencies and Q-Resolution
Smith, Dan	Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
Sonobe, Tomohiro	Community Branching for Parallel Portfolio SAT Solvers
Strichman, Ofer	Ultimately Incremental SAT
Szeider, Stefan	Variable Dependencies and Q-Resolution Fixed-parameter tractable reductions to SAT
Sæther, Sigve Hortemo	Solving MaxSAT and #SAT on structured CNF formulas
T
Tamaki, Suguru	Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
Telle, Jan Arne	Solving MaxSAT and #SAT on structured CNF formulas
Tentrup, Leander	Fast DQBF Refutation
V
Vatshelle, Martin	Solving MaxSAT and #SAT on structured CNF formulas
W
Wang, Cong	Approximating highly satisfiable random 2-SAT
Wetzler, Nathan	DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
Widl, Magdalena	QBF Resolution Systems and their Proof Complexities

Disclaimer | Powered by EasyChair Smart Program