Solving Linux Upgradeability Problems Using Boolean Optimization
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 systems are expected to be reliable and consistent after that. For each package in the system, a set of dependencies and...
Main Authors: | Josep Argelich, Daniel Le Berre, Inês Lynce, Joao Marques-Silva, Pascal Rapicault |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-07-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1007.1021v1 |
Similar Items
-
Haplotype Inference with Boolean Satisfiability
by: Lynce, Ines, et al.
Published: (2008) -
Solving SAT Problem by Pseudo-Boolean Optimization Engine
by: Chi-Cheng Hu, et al.
Published: (2008) -
Closed Classes of Boolean Functions Problems Solving
by: A. V. Arkhangelskaya
Published: (2011-12-01) -
Solving the Boolean satisfiability problem using the parallel paradigm
by: Hoessen, Benoît
Published: (2014) -
Solving Quantified Boolean Formulas
by: Samulowitz, Horst Cornelius
Published: (2008)