no code implementations • 10 May 2015 • Miguel Neves, Ruben Martins, Mikoláš Janota, Inês Lynce, Vasco Manquinho
Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are found early.
no code implementations • 10 May 2015 • Miguel Neves, Inês Lynce, Vasco Manquinho
The most successful parallel SAT and MaxSAT solvers follow a portfolio approach, where each thread applies a different algorithm (or the same algorithm configured differently) to solve a given problem instance.
no code implementations • 28 Dec 2020 • Margarida Ferreira, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, Ruben Martins
Experimental results show that FOREST successfully returns the desired regular expression in 72% of the instances and outperforms REGEL, a state-of-the-art regular expression synthesizer.
no code implementations • 14 Apr 2022 • Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco Manquinho, José Rui Figueira
First, we show that it is possible to use MCS enumeration to solve MOBO problems such that each MCS necessarily corresponds to a Pareto-optimal solution.
no code implementations • 22 Apr 2022 • João Cortes, Inês Lynce, Vasco Manquinho
In the last decade, a plethora of algorithms for single-objective Boolean optimization has been proposed that rely on the iterative usage of a highly effective Propositional Satisfiability (SAT) solver.
1 code implementation • 28 Aug 2023 • Daniel Ramos, Hailie Mitchell, Inês Lynce, Vasco Manquinho, Ruben Martins, Claire Le Goues
By leveraging code examples mined from the library source and automatically generated code examples based on the pull requests, we infer transformation rules in \comby, a language for structural code search and replace.