PackUp: Tools for Package Upgradability Solving1 | Zendy

Mikoláš Janota | Zendy; Inês Lynce | Zendy; Vasco Manquinho | Zendy; João MarquesSilva | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

PackUp: Tools for Package Upgradability Solving1

Author(s) -

Mikoláš Janota,

Inês Lynce,

Vasco Manquinho,

João MarquesSilva

Publication year - 2012

Publication title -

journal on satisfiability boolean modeling and computation

Language(s) - English

Resource type - Journals

eISSN - 1875-5011

pISSN - 1574-0617

DOI - 10.3233/sat190090

Subject(s) - maximum satisfiability problem , solver , computer science , boolean satisfiability problem , software , software package , theoretical computer science , programming language , algorithm , boolean function

This paper presents PackUp (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 specifics of the problem encoding.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research