FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

B
Beyersdorff, Olaf	Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (PDF)
Blinkhorn, Joshua	Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (PDF)
Bonet, Maria	On Dual-Rail Based MaxSAT Solving (PDF, talk)
Buss, Sam	On Dual-Rail Based MaxSAT Solving (PDF, talk)
C
Capelli, Florent	Proof systems for #SAT based on restricted circuits (PDF, talk)
Clymo, Judith	Short Proofs in QBF Expansion (PDF)
D
Dantchev, Stefan	Resolution and the binary encoding of combinatorial principles (PDF, talk)
Das, Anupam	Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
de Wolff, Timo	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
Dressler, Mareike	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
G
Galesi, Nicola	Resolution and the binary encoding of combinatorial principles (PDF, talk)
H
Hinde, Luke	Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (PDF)
I
Ignatiev, Alexey	On Dual-Rail Based MaxSAT Solving (PDF, talk)
J
Jeřábek, Emil	Bounded induction without parameters (PDF, )
K
Kauers, Manuel	The Symmetry Rule for Quantified Boolean Formulas (PDF)
Knop, Alexander	Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk)
Kolokolova, Antonina	Complexity of expander-based reasoning and the power of monotone proofs (PDF, talk)
Kurpisz, Adam	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
M
Marques-Silva, Joao	On Dual-Rail Based MaxSAT Solving (PDF, talk)
Martin, Barnaby	Resolution and the binary encoding of combinatorial principles (PDF, talk)
Morgado, Antonio	On Dual-Rail Based MaxSAT Solving (PDF, talk)
P
Part, Fedor	Resolution with Counting: Different Moduli and Tree-Like Lower Bounds (PDF, talk)
S
Seidl, Martina	The Symmetry Rule for Quantified Boolean Formulas (PDF)
T
Tzameret, Iddo	Resolution with Counting: Different Moduli and Tree-Like Lower Bounds (PDF, talk)

Disclaimer | Powered by EasyChair Smart Program