The CoSCo subgroup on Constraint Reasoning and Optimization 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 (including heuristic search and combinatorial optimization techniques) in exactly solving intrinsically hard (NP-complete and beyond) computational tasks. Application-wise a current emphasis is on various computational problems related to machine learning, including different types of clustering, classification, and structure learning tasks.

Contact person: Adjunct Professor Matti Järvisalo
Home page: https://www.hiit.fi/node/1567