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 studies include exactly solving machine learning problems (different types of clustering, classification, and structure learning tasks) via constrained optimization, and computational aspects of argumentation theory.
Constraint Reasoning and Optimization
Järvisalo to give keynote talk at SAFA 2018
Matti Järvisalo invited to give the keynote talk at the 2nd International Workshop on Systems and Algorithms for Formal Argumentation in Warsaw...
Jeremias Berg defends PhD thesis
On May 25 2018, Berg successfully defended his doctoral thesis on Solving Optimization Problems via Maximum Satisfiablity.
Two papers accepted to IJCAI-ECAI 2018
Two papers from the Constraint Reasoning and Optimization group will be presented in July 2018 at IJCAI-ECAI 2018, the 27th International Joint...
SAT Competition and MaxSAT Evaluation 2018
The Constraint Reasoning and Optimization group is involved in co-organizing the main SAT and MaxSAT solver competitions in 2018.
Järvisalo to chair Pragmatics of SAT 2018
Matti Järvisalo will act as Program Committee chair together with Daniel Le Berre for the 2018 edition of the Pragmatics of SAT workshop.