FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

Editors: Jan Johannsen and Olaf Beyersdorff

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

Disclaimer | Powered by EasyChair Smart Program