Program
Monday, January 4, 2016
Registration (8:00 — 9:00)
Opening Remarks, Greetings (9:00 — 9:15)
Keynote Speaker (9:15 — 10:15)
| Time | Description |
|---|---|
| 9:15 | Computational Fair Division |
| Ariel Procaccia |
Coffee Break (10:20 — 10:40)
Morning Sessions (10:40 — 12:10)
Main Track Session 1
| Time | Description |
|---|---|
| 10:40 | False-Name-Proof Recommendations in Social Networks |
| Markus Brill, Vincent Conitzer, Rupert Freeman and Nisarg Shah | |
| 11:10 | Rules for Choosing Societal Tradeoffs |
| Vincent Conitzer, Rupert Freeman, Markus Brill and Yuqian Li | |
| 11:40 | Recovering Social Networks by Observing Votes |
| Benjamin Fish, Yi Huang and Lev Reyzin |
Special Session on Boolean and pseudo-Boolean Functions 1
| Time | Description |
|---|---|
| 10:40 | Pattern-based Classification and Survival Analysis of Chronic Kidney Disease |
| Munevver M. Subasi, Melissa Moreno, Travaughn Bain, Megan Moreno, Ersoy Subasi, Katherine C. Carroll, Emily R. Cunningham and Michael Lipkowitz | |
| 11:10 | A Classification Model to Predict the Rate of Decline of Kidney Function |
| Ersoy Subasi, Munevver M. Subasi, Michael Lipkowitz, John Roboz and Peter Hammer | |
| 11:40 | Generating models of a matched formula with a polynomial delay |
| Petr Savicky and Petr Kučera |
Lunch (12:10 — 2:00)
On your own.
After Lunch Sessions (2:00 — 3.30)
Main Track Session 2
| Time | Description |
|---|---|
| 2:00 | Complexity of Control by Partitioning Veto and Maximin Elections |
| Cynthia Maushagen and Jörg Rothe | |
| 2:30 | Voter Control in k-Approval and k-Veto under Partial Information |
| Christian Reger | |
| 3:00 | Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners) |
| Markus Brill, Rupert Freeman and Vincent Conitzer |
Special Session on Integrating Constraint Programming and Operations Research 1
| Time | Description |
|---|---|
| 2:00 | Detecting and Exploiting Global Structures in MIP |
| Domenico Salvagnin | |
| 2:30 | Model Combinators in the Scheduling Domain |
| Laurent Michel and Daniel Fontaine | |
| 3:00 | An Integrated Solver for Multi-index Assignment |
| Stathis Plitsos, Dimitrios Magos and Ioannis Mourtos |
Coffee Break (3:30 — 4:00)
Afternoon Sessions (4:00 — 5:30)
Main Track Session 3
| Time | Description |
|---|---|
| 4:00 | Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems |
| T. K. Satish Kumar | |
| 4:30 | Z-Equilibrium For a CSP Game |
| Kahina Bouchama, Mohammed Said Radjef and Lakhdar Sais |
Special Session on Integrating Constraint Programming and Operations Research 2
| Time | Description |
|---|---|
| 4:00 | Solving Non-Linear Pseudo-Boolean Optimization Problems by Constraint Integer Programming |
| Michael Winkler | |
| 4:30 | Hybrid Approaches Based on Lagrangian Relaxation |
| André Ciré | |
| 5:00 | Decompositions Based on Decision Diagrams |
| David Bergman |
Evening
Water Taxi Cruise in Ft. Lauderdale. Exact time to be announced.
Tuesday, January 5, 2016
Keynote Speaker (9:00 — 10:00)
| Time | Description |
|---|---|
| 9:00 | Interplay between machine learning and artificial intelligence |
| Yixin Chen |
Coffee Break (10:00 — 10:30)
Morning Sessions (10:30 — 12:00)
Main Track Session 4
| Time | Description |
|---|---|
| 10:30 | Causal Discovery by Randomness Test |
| Steven Prestwich, Armagan Tarim and Ibrahim Ozkan | |
| 11:00 | Partial Collective Matrix Factorization and its PAC Bound |
| Chao Lan, Xiaoli Li, Yujie Deng and Jun Huan | |
| 11:30 | On the computational complexities of Quantified Integer Programming variants |
| Piotr Wojciechowski, K. Subramani and Pavlos Eirinakis |
Special Session on Computational Approaches to Proof Construction
| Time | Description |
|---|---|
| 10:30 | Formalizing Mathematics using the Lean Theorem Prover |
| Leonardo de Moura | |
| 11:00 | Learning Intelligent Theorem Proving from Large Formal Corpora |
| Josef Urban | |
| 11:30 | Computational Approaches to Open Problems in Combinatorics |
| Ilias Kotsireas |
Lunch (12:10 — 2:00)
On your own.
After Lunch Sessions (2:00 — 3.30)
Main Track Session 5
| Time | Description |
|---|---|
| 2:00 | Conjunctive Choice Logic |
| Abdelhamid Boudjelida and Salem Benferhat | |
| 2:30 | Sentence Entailment in Compositional Distributional Semantics |
| Esma Balkır, Dimitri Kartsaklis and Mehrnoosh Sadrzadeh |
Special Session on Integrating Constraint Programming and Operations Research 3
| Time | Description |
|---|---|
| 2:00 | Grammar-Based Integer Programming Models and Methods for Employee Scheduling Problems |
| Bernard Gendron and Louis-Martin Rousseau | |
| 2:30 | Decomposition Methods for the Travelling Purchaser Problem |
| Kyle E. C. Booth, Tony T. Tran and J. Christopher Beck | |
| 3:00 | Logic-Based Benders Decomposition for Multiagent Scheduling with Sequence-dependent Costs |
| Aliza Heching and John Hooker |
Coffee Break (3:30 — 4:00)
Afternoon Sessions (4:00 — 6:00)
Main Track Session 6
| Time | Description |
|---|---|
| 4:00 | Computing multiple c-revision using OCF knowledge base |
| Salem Benferhat and Amen Ajroud | |
| 4:30 | Robust Sequential Prediction in Linear Regression with Student’s t-distribution |
| Jussi Määttä and Teemu Roos |
Special Session on Boolean and pseudo-Boolean Functions 2
| Time | Description |
|---|---|
| 4:00 | Logical Analysis of Multiclass Data |
| Munevver M. Subasi and Juan F. Avila-Herrera | |
| 4:30 | Knowledge compilation from DNF to switch-list representations |
| Ondřej Čepek and Radek Hušek | |
| 5:00 | On the Goal Value of a Boolean Function |
| Eric Bach, Lisa Hellerstein and Devorah Kletenik | |
| 5:30 | A combinatorial min-max theorem related to Horn minimization |
| Endre Boros, Ondřej Čepek and Kaz Makino |
Evening
Banquet in the hotel. Exact time to be announced.
Wednesday, January 6, 2016
Keynote Speaker (9:00 — 10:00)
| Time | Description |
|---|---|
| 9:00 | Modern Exact and Approximate Combinatorial Optimization Algorithms (max-product and max-sum-product) for Graphical models |
| Rina Dechter |
Coffee Break (10:00 — 10:30)
Morning Sessions (10:30 — 12:00)
Main Track Session 7
| Time | Description |
|---|---|
| 10:30 | The Effect of Domain Modeling on the Performance of Planning Algorithms |
| Roman Barták and Jindřich Vodrážka | |
| 11:00 | Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results |
| Junkyu Lee, Radu Marinescu and Rina Dechter | |
| 11:30 | Benchmarking recovery theorems for the DC-SBM |
| Yali Wan and Marina Meila |
Special Session on Applications of SAT
| Time | Description |
|---|---|
| 10:30 | Application of Hierarchical Hybrid Encodings to Solve CSPs as Equivalent SAT Problems |
| Miroslav N. Velev and Ping Gao | |
| 11:00 | Cascading Solution to Data Dependence Constraints with Z3 |
| Eric W. D. Rozier and Kristin Y. Rozier | |
| 11:30 | Efficient Selection of Suspect Sets in Unreachable State Diagnosis |
| Ryan Berryhill and Andreas Veneris |