The Constraint Reasoning and Optimization group, led by Associate Professor Matti Järvisalo, focuses on the development and analysis of state-of-the-art decision, search, and optimization procedures, and their applications in computationally hard problem domains with real-world relevance. Especially, the group contributes to the development state-of-the-art Boolean satisfiability (SAT) solvers, their extensions to Boolean optimization, and applications of SAT-based and other types of discrete search and optimization procedures in exactly solving intrinsically hard (NP-complete and beyond) computational tasks. Recent domain-specific directions include exact approaches to solving machine learning related optimization problems and computational aspects of argumentation theory.
Constraint Reasoning and Optimization
International Dissertation Award to Berg
Jeremias Berg of the Constraint Reasoning and Optimization Group receives the 2020 Doctoral Research Award of the Association for Constraint ...
Paper accepted to PGM 2020
The work extends and improves the empirical performance of exact approaches to causal discovery in a very general setting.
SAT 2020 Best Paper Award
The SAT 2020 Best Paper Award has been awarded to Jeremias Berg of the Constraint Reasoning and Optimization group.
Second place in PACE Challenge 2020
The SMS solver implemented by Tuukka Korhonen reached second place in the exact treedepth track of 5th Parameterized Algorithms and...
Three papers accepted to KR 2020
Three research papers by the Constraint Reasoning and Optimization Group have been accepted for publication in the proceedings of KR 2020, a...