53 citations · 146 across the 18 of their papers we have counts for
7 papers · 1 filter
Reflections on "Incremental Cardinality Constraints for MaxSAT"
Ruben Martins, Saurabh Joshi, Vasco Manquinho +1
To celebrate the first 25 years of the International Conference on Principles and Practice of Constraint Programming (CP) the editors invited the authors of the most cited paper of…
DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability
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 s…
Incremental Cardinality Constraints for MaxSAT
Ruben Martins, Saurabh Joshi, Vasco Manquinho +1
Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to re…
Proceedings Second Workshop on Logics for Component Configuration
Conrad Drescher, Ines Lynce, Ralf Treinen
This volume contains the papers presented at the second international workshop on Logics for Component Configuration (LoCoCo 2011) which was associated with the International Confe…
Solving Linux Upgradeability Problems Using Boolean Optimization
Josep Argelich, Daniel Le Berre, Inês Lynce +2
Managing the software complexity of package-based systems can be regarded as one of the main challenges in software architectures. Upgrades are required on a short time basis and s…
Proceedings First International Workshop on Logics for Component Configuration
Inês Lynce, Ralf Treinen
This volume contains the papers presented at the first international workshop on Logics for Component Configuration (LoCoCo 2010) which was associated with the International Confer…