MC Program

MC PROGRAM

Thursday, August 11th

08:30-09:00Coffee & Refreshments

Chair:

09:00	Samuel Teuber and Alexander Weigl Quantifying Software Reliability via Model-Counting (abstract) PRESENTER: Samuel Teuber
09:30	Anna Latour, Behrouz Babaki, Daniël Fokkinga, Marie Anastacio, Holger Hoos and Siegfried Nijssen Stochastic Constraint Optimisation with Applications in Network Analysis (abstract) PRESENTER: Anna Latour
10:00	Dominik Rusovac Rushing and Strolling among Answer Sets - Navigation Made Easy (abstract)

10:30-11:00Coffee Break

Chair:

11:00	Andreas Gittis, Eric Vin and Daniel J. Fremont Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation (abstract) PRESENTER: Andreas Gittis
11:20	Paulius Dilkas Generating Random Weighted Model Counting Instances: An Empirical Analysis with Varying Primal Treewidth (abstract)
11:50	Max Bannach Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class (abstract)

12:30-14:00Lunch Break

Lunches will be held in Taub hall and in The Grand Water Research Institute.

Chair:

14:00	Hisao Tamaki Heuristic computation of exact treewidth - some improvements and more experimental evaluations (abstract)
14:30	Arne Meier Counting Complexity for Projected Reasoning in Abstract Argumentation (abstract)
15:00	Friedrich Slivovsky and Stefan Szeider A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth (abstract) PRESENTER: Friedrich Slivovsky

15:30-16:00Coffee Break

Chair:

16:00	Paulius Dilkas and Vaishak Belle Recursive Solutions to First-Order Model Counting (abstract) PRESENTER: Paulius Dilkas
16:30	Yong Lai, Kuldeep S. Meel and Roland Yap Scalable Uniform Sampling via Efficient Knowledge Compilation (abstract) PRESENTER: Yong Lai
17:00	Priyanka Golia, Mate Soos, Sourav Chakraborty and Kuldeep S. Meel Designing Samplers is Easy: The Boon of Testers (abstract) PRESENTER: Priyanka Golia

18:00-19:30Workshop Dinner (at the Technion, Taub Terrace Floor 2) - Paid event