SAT 2014 LNCS PROCEEDINGS: AUTHOR INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index

Shortcuts: A B C D F G H I J K L M N O P R S T V W

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