research
∙
08/28/2023
MELT: Mining Effective Lightweight Transformations from Pull Requests
Software developers often struggle to update APIs, leading to manual, ti...
share
research
∙
04/22/2022
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization
In the last decade, a plethora of algorithms for single-objective Boolea...
research
∙
04/14/2022
Exact and approximate determination of the Pareto set using minimal correction subsets
Recently, it has been shown that the enumeration of Minimal Correction S...
research
∙
02/12/2021
SOAR: A Synthesis Approach for Data Science API Refactoring
With the growth of the open-source data science community, both the numb...
research
∙
12/28/2020
FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions
Form validators based on regular expressions are often used on digital f...
research
∙
10/10/2019
Reflections on "Incremental Cardinality Constraints for MaxSAT"
To celebrate the first 25 years of the International Conference on Princ...
research
∙
05/10/2015
DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability
The most successful parallel SAT and MaxSAT solvers follow a portfolio a...
research
∙
05/10/2015
Exploiting Resolution-based Representations for MaxSAT Solving
Most recent MaxSAT algorithms rely on a succession of calls to a SAT sol...
research
∙
08/20/2014
Incremental Cardinality Constraints for MaxSAT
Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolea...
research
∙
07/26/2012
On When and How to use SAT to Mine Frequent Itemsets
A new stream of research was born in the last decade with the goal of mi...
research
∙
10/07/2009
