User partitioning for Maximum Satisfiability
The Maximum Satisfiability (MaxSAT) problem is the optimisation variant of the Satisfiability (SAT) problem. Solving MaxSAT efficiently often involves partitioning the set of soft …
UpMax: User partitioning for MaxSAT
This paper proposes a new framework called UpMax that decouples the partitioning procedure from the MaxSAT solving algorithms. As a result, new partitioning procedures can be …
AlloyMax: Bringing Maximum Satisfaction to Relational Specifications
We propose AlloyMax, an extension of Alloy with a capability to express and analyze problems with optimal solutions. AlloyMax introduces (1) a small addition of language constructs …
Changjian Zhang
•
•
1 min read