FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
SAT PROGRAM

Days: Monday, July 9th Tuesday, July 10th Wednesday, July 11th Thursday, July 12th

Monday, July 9th

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

10:30-11:00Coffee Break
11:00-12:15 Session 45F: SAT Invited Talk: Christoph Scholl
11:00
Welcome to SAT 2018 (abstract)
11:05
Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications (abstract)
12:30-14:00Lunch Break
14:00-15:30 Session 47F: MaxSAT
14:00
Approximately Propagation Complete and Conflict Propagating Constraint Encodings (abstract)
14:30
Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT (abstract)
15:00
Solving MaxSAT with Bit-Vector Optimization (abstract)
15:30-16:00Coffee Break
16:00-18:00 Session 49F: CDCL
16:00
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers (abstract)
16:30
Machine Learning-based Restart Policy for CDCL SAT Solvers (abstract)
17:00
Chronological Backtracking (abstract)
17:30
Centrality-Based Improvements to CDCL Heuristics (abstract)
19:00-21:30 FLoC reception at Ashmolean Museum

FLoC reception at Ashmolean Museum. Drinks and canapés available from 7pm (pre-booking via FLoC registration system required; guests welcome).

Tuesday, July 10th

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

09:00-10:30 Session 50E: Model Counting
09:00
Fast Sampling of Perfectly Uniform Satisfying Assignments (abstract)
09:30
Fast and Flexible Probabilistic Model Counting (abstract)
10:00
Exploiting Treewidth for Projected Model Counting and its Limits (abstract)
10:30-11:00Coffee Break
12:30-14:00Lunch Break
14:00-15:30 Session 53F: QBF I
Chair:
14:00
Circuit-based Search Space Pruning in QBF (abstract)
14:30
Symmetries for QBF (abstract)
15:00
Local Soundness for QBF Calculi (abstract)
15:30-16:00Coffee Break
16:00-17:00 Session 55F: QBF II
16:00
QBF as an Alternative to Courcelle's Theorem (abstract)
16:30
Polynomial-Time Validation of QCDCL Certificates (abstract)
17:00-18:30 Session 56: FLoC Public Lecture: Stuart Russell

Doors open at 4:30 pm; please be seated by 4:50 pm (attendance is free of charge and all are welcome; please register).

17:00
Unifying Logic and Probability: the BLOG Language (abstract)
Wednesday, July 11th

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

09:00-10:30 Session 57F: Theory
09:00
Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT (abstract)
09:30
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving (abstract)
10:00
Cops-Robber games and the resolution of Tseitin formulas (abstract)
10:30-11:00Coffee Break
12:30-14:00Lunch Break
15:30-16:00Coffee Break
16:00-17:00 Session 64E: MUS
16:00
Minimal unsatisfiability and minimal strongly connected digraphs (abstract)
16:30
Finding all Minimal Safe Inductive Sets (abstract)
19:00-21:30 FLoC banquet at Examination Schools

FLoC banquet at Examination Schools. Drinks and food available from 7pm (pre-booking via FLoC registration system required; guests welcome).

Thursday, July 12th

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

10:30-11:00Coffee Break
11:00-12:00 Session 71E: SMT
11:00
Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition (abstract)
11:30
Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization (abstract)
12:30-14:00Lunch Break
14:00-15:30 Session 73G: Tools & Applications II
14:00
ALIAS: A Modular Tool for Finding Backdoors for SAT (abstract)
14:30
PySAT: A Python Toolkit for Prototyping with SAT Oracles (abstract)
15:00
Constrained Image Generation Using Binarized Neural Networks with Decision Procedures (abstract)
15:30-16:00Coffee Break