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
2019 IJCAI-JAIR Best Paper Prize
The 2019 IJCAI-JAIR Best Paper Prize awarded article, co-authored by Matti Järvisalo, was selected from more than 250 articles published in the...
Paper accepted to Journal of Artificial Intelligence Research
The work proposes novel form of synthesis in the context of abstract argumentation, a topical area of AI research, and both analysis the...
Paper accepted at ICTAI 2019
The work proposed the use of betweenness centrality as a structural heuristic for speeding up exact model counting.
Mu-toksia blows away competition at ICCMA 2019
The Mu-toksia argumentation reasoning engine implemented by Andreas Niskanen of the Constraint Reasoning and Optimization group takes top...
Two papers accepted to Journal on Satisfiability, Boolean Modeling and Computation
The papers cover the 2018 editions of SAT Competitions and MaxSAT Evaluations, the two main competitive events in their respective areas.