Topic AllData science newsScience newsLife science newsNordic welfare newsHealth newsEducation newsLanguage & cultureSociety & economySustainability newsTeaching & studying at the UniversityHigher education & science policyHelsinki University Library Type AllNewsPress releaseIn briefEditorialArticleProfileEssayColumnCommentBooksSpeech Listing <span class="icon--list-as-blocks"></span><span class="icon--list"></span> 23.8.2021 Data science news Paper accepted to Theory and Practice of Logic Programming In the article, the authors harness recent advances in incremental answer set solving for developing effective algorithms for reasoning tasks in... 16.8.2021 Data science news Paper accepted to FOCS 2021 The work presents the first 2-approximation algorithm for treewidth that is faster than known exact algorithms. 3.8.2021 Data science news Paper accepted to Artificial Intelligence Journal The article provides and detailed overview the 2020 SAT Competition and an extended empirical analysis of the results of the competition. 28.7.2021 Data science news Four papers accepted to CP 2021 Four research papers by the Constraint Reasoning and Optimization Group have been accepted for publication in the proceedings of CP 2021, a... 9.7.2021 Data science news First Place in Model Counting Competition 2021 The SharpSAT-TD exact propositional model counter, implemented by Tuukka Korhonen of the Constraint Reasoning and Optimization group, ranks... 8.7.2021 Data science news VCLA Outstanding Master Thesis Award to Korhonen Tuukka Korhonen of the Constraint Reasoning and Optimization group receives the 2021 Outstanding Master Thesis Award, an international thesis... 13.5.2021 Data science news Paper accepted to Journal of Artificial Intelligence Research In the article, the authors make both algorithmic and complexity-theoretic advances in the study of assumption-based argumentation, a central... 12.5.2021 Data science news Paper accepted to UAI 2021 The work develops methodology for score-based structure learning of directed maximal ancestral graphs as an theoretically appealing model class... 21.4.2021 Data science news Paper accepted to ICALP 2021 The work establishes lower bounds on pure dynamic programming algorithms for maximum weight independent set via modelling such algorithms as... Pages1 2 3 4 5 6 7 Next
23.8.2021 Data science news Paper accepted to Theory and Practice of Logic Programming In the article, the authors harness recent advances in incremental answer set solving for developing effective algorithms for reasoning tasks in...
16.8.2021 Data science news Paper accepted to FOCS 2021 The work presents the first 2-approximation algorithm for treewidth that is faster than known exact algorithms.
3.8.2021 Data science news Paper accepted to Artificial Intelligence Journal The article provides and detailed overview the 2020 SAT Competition and an extended empirical analysis of the results of the competition.
28.7.2021 Data science news Four papers accepted to CP 2021 Four research papers by the Constraint Reasoning and Optimization Group have been accepted for publication in the proceedings of CP 2021, a...
9.7.2021 Data science news First Place in Model Counting Competition 2021 The SharpSAT-TD exact propositional model counter, implemented by Tuukka Korhonen of the Constraint Reasoning and Optimization group, ranks...
8.7.2021 Data science news VCLA Outstanding Master Thesis Award to Korhonen Tuukka Korhonen of the Constraint Reasoning and Optimization group receives the 2021 Outstanding Master Thesis Award, an international thesis...
13.5.2021 Data science news Paper accepted to Journal of Artificial Intelligence Research In the article, the authors make both algorithmic and complexity-theoretic advances in the study of assumption-based argumentation, a central...
12.5.2021 Data science news Paper accepted to UAI 2021 The work develops methodology for score-based structure learning of directed maximal ancestral graphs as an theoretically appealing model class...
21.4.2021 Data science news Paper accepted to ICALP 2021 The work establishes lower bounds on pure dynamic programming algorithms for maximum weight independent set via modelling such algorithms as...