53 citations · 136 across the 17 of their papers we have counts for
5 papers · 1 filter
Can LLMs Build a MaxSAT Solver from Papers? The CoreForge Experience
Ruben Martins
We report on CoreForge, an experience in using large language models (LLMs) to build an unweighted MaxSAT solver from research papers rather than from an existing solver codebase.…
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…
Approximation Strategies for Incomplete MaxSAT
Saurabh Joshi, Prateek Kumar, Ruben Martins +1
Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarante…
Generalized Totalizer Encoding for Pseudo-Boolean Constraints
Saurabh Joshi, Ruben Martins, Vasco Manquinho
Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are used to model many real-world problems. A common approach to solve these constraints is to encode them…
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…