Accepted Papers
Links to the accepted papers below will be available after the deadline of the final versions.
Regular Track
- On the computational complexities of Quantified Integer Programming variants
Piotr Wojciechowski, K. Subramani and Pavlos Eirinakis - Computing multiple c-revision using OCF knowledge base
Salem Benferhat and Amen Ajroud - Voter Control in k-Approval and k-Veto under Partial Information
Christian Reger - Causal Discovery by Randomness Test
Steven Prestwich, Armagan Tarim and Ibrahim Ozkan - Complexity of Control by Partitioning Veto and Maximin Elections
Cynthia Maushagen and Jörg Rothe - Conjunctive Choice Logic
Abdelhamid Boudjelida and Salem Benferhat - Z-Equilibrium For a CSP Game
Kahina Bouchama, Mohammed Said Radjef and Lakhdar Sais - Robust Sequential Prediction in Linear Regression with Student’s t-distribution
Jussi Määttä and Teemu Roos - False-Name-Proof Recommendations in Social Networks
Markus Brill, Vincent Conitzer, Rupert Freeman and Nisarg Shah - Rules for Choosing Societal Tradeoffs
Vincent Conitzer, Rupert Freeman, Markus Brill and Yuqian Li - Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners)
Markus Brill, Rupert Freeman and Vincent Conitzer - The Effect of Domain Modeling on Efficiency of Planning
Roman Barták and Jindřich Vodrážka - Recovering Social Networks by Observing Votes
Benjamin Fish, Yi Huang and Lev Reyzin - Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems
T. K. Satish Kumar - Benchmarking recovery theorems for the DC-SBM
Yali Wan and Marina Meila - Partial Collective Matrix Factorization and its PAC Bound
Chao Lan, Xiaoli Li, Yujie Deng and Jun Huan - Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results
Junkyu Lee, Radu Marinescu and Rina Dechter - Sentence Entailment in Compositional Distributional Semantics
Esma Balkır, Dimitri Kartsaklis and Mehrnoosh Sadrzadeh
Special Session on Boolean and pseudo-Boolean Functions
- 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 - A Classification Model to Predict the Rate of Decline of Kidney Function
Ersoy Subasi, Munevver M. Subasi, Michael Lipkowitz, John Roboz and Peter Hammer - Generating models of a matched formula with a polynomial delay
Petr Savicky and Petr Kučera - Logical Analysis of Multiclass Data
Munevver M. Subasi and Juan F. Avila-Herrera - Knowledge compilation from DNF to switch-list representations.
Ondřej Čepek and Radek Hušek - On the Goal Value of a Boolean Function
Eric Bach, Lisa Hellerstein and Devorah Kletenik - A combinatorial min-max theorem and minimization of pure-Horn functions
Endre Boros, Ondřej Čepek and Kaz Makino - Efficient Selection of Suspect Sets in Unreachable State Diagnosis
Ryan Berryhill and Andreas Veneris - Cascading Solution to Data Dependence Constraints with Z3
Eric W. D. Rozier and Kristin Y. Rozier - Application of Hierarchical Hybrid Encodings to Solve CSPs as Equivalent SAT Problems
Miroslav N. Velev and Ping Gao
Special Session on Computational Approaches to Proof Construction
A collection of all the talks together with their respective abstracts is available here.
- Formalizing Mathematics using the Lean Theorem Prover
Leonardo de Moura - Learning Intelligent Theorem Proving from Large Formal Corpora
Josef Urban - Computational Approaches to Open Problems in Combinatorics
Ilias Kotsireas
Special Session on Integrating Constraint Programming and Operations Research
A collection of all the talks together with their respective abstracts is available here.
- Grammar-Based Integer Programming Models and Methods for Employee Scheduling Problems
Bernard Gendron and Louis-Martin Rousseau - Detecting and Exploiting Global Structures in MIP
Domenico Salvagnin - Model Combinators in the Scheduling Domain
Laurent Michel and Daniel Fontaine - Solving Non-Linear Pseudo-Boolean Optimization Problems by Constraint Integer Programming
Michael Winkler - Hybrid Approaches Based on Lagrangian Relaxation
André Ciré - Decompositions Based on Decision Diagrams
David Bergman - An Integrated Solver for Multi-index Assignment
Stathis Plitsos, Dimitrios Magos and Ioannis Mourtos - Decomposition Methods for the Travelling Purchaser Problem
Kyle E. C. Booth, Tony T. Tran and J. Christopher Beck - Logic-Based Benders Decomposition for Multiagent Scheduling with Sequence-dependent Costs
Aliza Heching and John Hooker