Accepted Papers

Links to the accepted papers below will be available after the deadline of the final versions.

Regular Track

• Generalization Bounds for Learning with Linear and Quadratic Side Knowledge
  Theja Tulabandhula and Cynthia Rudin

• Variants of Quantified Linear Programming and Quantified Linear Implication
  Piotr Wojciechowski, Pavlos Eirinakis, and K. Subramani

• Improving Configuration Checking for Satisfiable Random k-SAT Instances
  André Abramé, Djamal Habet, and Donia Toumi

• On Boosting Sparse Parities
  Lev Reyzin

• Behavioral Modeling of Sequential Bargaining Games: Fairness and Limited Backward Induction
  Xia Qu and Prashant Doshi

• Probabilistic Knowledge Representation Using Gröbner Basis Theory
  Gabriele Kern-Isberner, Marco Wilhelm, and Christoph Beierle

• Assertional-based Removed Set Revision of DL-LiteR Belief Bases
  Salem Benferhat, Zied Bouraoui, Odile Papini, and Eric Würbel

• Optimal Sequential Multi-Way Number Partitioning
  Richard E. Korf, Ethan L. Schreiber, and Michael D. Moffitt

• Bag-Connected Tree-Width: A New Parameter for Graph Decomposition
  Philippe Jégou and Cyril Terrioux

• A Sufficient Condition for Learning Unbounded Unions of Languages with Refinement Operators
  Tomohiko Okayama, Ryo Yoshinaka, Keisuke Otaki, and Akihiro Yamamoto

• Weighted Best First Search for Graphical Models
  Natalia Flerova, Radu Marinescu, and Rina Dechter

Special session on Boolean and pseudo-Boolean Functions

• Evaluation of DNF Formulas
  Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, and Tonguç Ünlüyurt

• Efficient SAT-Encoding of Linear CSP Constraints
  Pedro Barahona, Steffen Hölldobler, and Van Hau Nguyen
  Accepted through the regular track

• Reversing the Classification of Weighted Rule Ensembles
  Tibérius O. Bonates, and José W.V. Morais Neto

• Cones of Nonnegative Quadratic Pseudo-Boolean Functions
  Endre Boros and Isabella Lari

• On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas
  Ondřej Čepek and Štefan Gurský

• Linear Separation of Connected Dominating Sets in Graphs
  Nina Chiarelli and Martin Milanič

• Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost
  Ferdinando Cicalese, Eduardo Laber, and Aline Medeiros Saettler

• The Separation Problem for Binary Decision Diagrams
  André A. Ciré and J. N. Hooker

• On Resolution Like Proofs of Monotone Self-Dual Functions
  Daya Gaur

• Representations of All Solutions of Boolean Programming Problems
  Utz-Uwe Haus and Carla Michini

• A Pigeon-Hole Based Encoding of Cardinality Constraints
  Said Jabbour, Lakhdar Saďs, and Yakoub Salhi
  Accepted through the regular track

• Hydras: Complexity on general graphs and a subclass of trees
  Petr Kučera

• About Some UP-Based Polynomial Fragments of SAT
  Mohammad Al-Saedi, Éric Grégoire, Bertrand Mazure, and Lakhdar Saďs
  Accepted through the regular track

• Dualization of Boolean functions Using Ternary Decision Diagrams
  Takahisa Toda

• Probabilistic Analysis of Random Mixed Horn Formulas
  Andreas Wotzlaw, Ewald Speckenmeyer, and Stefan Porschen

Special Session on Computational Social Choice

• From Sentiment Analysis to Preference Aggregation
  Umberto Grandi, Andrea Loreggia, Francesca Rossi and Vijay Saraswat

• The Maximum Likelihood Approach to Voting on Social Networks
  Vincent Conitzer

• Assigning indivisible and categorized items
  Lirong Xia

• Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games
  Anja Rey, Jörg Rothe, Hilmar Schadrack and Lena Schend

• Extending Tournament Solutions
  Felix Brandt, Markus Brill and Paul Harrenstein

Special Session on Mathematical Theories of Natural Language Processing

• Learning Optionality and Repetition
  Meaghan Fowlie

• Networks of morphological relations
  Sean Fulop and Sylvain Neuvel

• Monads for composing categorical and probabilistic meanings
  Gianluca Giorgolo and Ash Asudeh

• Finite-state subset approximation of phrase structure
  Mans Hulden and Miikka Silfverberg

• Hybrid Distributions of Strings
  James Rogers

• Tableau-Based Model Generation for Relational Syllogistic Logics
  Erik Wennstrom

Special Session on Theory of Machine Learning

• The sample complexity of agnostic learning with deterministic labels
  Shai Ben-David and Ruth Urner

• Toward a Theory of Pattern Discovery
  Jonathan Huggins and Cynthia Rudin

• Boosting Conditional Probability Estimators
  Dan Gutfreund, Aryeh Kontorovich, Ran Levy, and Michal Rosen-Zvi

• Generalization Bounds for Partially Linear Models
  Ruitong Huang and Csaba Szepesvári

• Robust Optimization using Machine Learning for Uncertainty Sets
  Theja Tulabandhula and Cynthia Rudin