Thumbnail Image
Publication

PackUp: tools for package upgradability solving, system description

Date
2012
Abstract
This paper presents PackUp1. (PACKage UPgradability with Boolean formulations) a framework for solving the the software package upgradability problem. Earlier versions of the framework (cudf2msu, cudf2pbo) participated in the 3rd MISC-live, an international competition organized by the European project MANCOOSI. The framework encodes the problem as a weighted partial MaxSAT formula and invokes a dedicated solver to solve the formula. The framework supports two types of solvers: weighted partial MaxSAT solvers and optimization pseudo-Boolean (OPB) solvers. The paper discusses the design of the framework and the speci cs of the problem encoding.
Supervisor
Description
peer-reviewed
Publisher
IOP Publishing
Citation
Journal on Satisfiability, Boolean Modeling and Computation;8, pp. 89-94
Collections
Lero - The Science Foundation Ireland Research Centre for Software
Show all metadata
Files
Thumbnail Image
Janota_2012_packup.pdf
Adobe PDF, 672.54 KB
Keywords
package upgradability problem, MaxSAT, boolean optimization
ULRR Identifiers
https://hdl.handle.net/10344/2756
 https://doi.org/10.34961/696
Funding code
Funding Information
Science Foundation Ireland (SFI), European Research Council (ERC), FCT
Sustainable Development Goals
External Link
License
Embedded videos