FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
PC PROGRAM

Days: Saturday, July 7th Sunday, July 8th

Saturday, July 7th

View this program: with abstractssession overviewtalk overviewside by side with other conferences

10:30-11:00Coffee Break
12:30-14:00Lunch Break
14:00-15:30 Session 28K
Location: Maths L6
14:00
Space Proof Complexity beyond Resolution (abstract)
15:00
Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (abstract)
15:30-16:00Coffee Break
16:00-18:10 Session 31M
Location: Maths L6
16:00
On OBBD Proofs (abstract)
17:00
Resolution and the binary encoding of combinatorial principles (abstract)
17:20
Resolution with Counting: Different Moduli and Tree-Like Lower Bounds (abstract)
17:40
Proof systems for #SAT based on restricted circuits (abstract)
19:45-22:00 Workshops dinner at Balliol College

Workshops dinner at Balliol College. Drinks reception from 7.45pm, to be seated by 8:15 (pre-booking via FLoC registration system required; guests welcome).

Location: Balliol College
Sunday, July 8th

View this program: with abstractssession overviewtalk overviewside by side with other conferences

09:00-10:30 Session 34L: Joint QBF / Proof Complexity session (joint with QBF)
Location: Maths L5
09:00
Lower Bound Techniques for QBF Proof Systems (abstract)
10:00
Towards the Semantics of QBF Clauses (abstract)
10:30-11:00Coffee Break
11:00-12:30 Session 38N: Joint QBF / Proof Complexity session (joint with QBF)
Location: Maths L5
11:00
Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (abstract)
11:30
Short Proofs in QBF Expansion (abstract)
11:50
The Symmetry Rule for Quantified Boolean Formulas (abstract)
12:10
Discussion (abstract)
12:30-14:00Lunch Break
14:30-15:30 Session 41
Location: Maths L6
14:30
Complexity of expander-based reasoning and the power of monotone proofs (abstract)
15:00
Towards theories for positive polynomial time and monotone proofs with extension (abstract)
15:30-16:00Coffee Break
16:00-17:50 Session 42N
Location: Maths L6
16:00
A Comparison of Algebraic and Semi-Algebraic Proof Systems (abstract)
17:00
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (abstract)
17:30
On Dual-Rail Based MaxSAT Solving (abstract)