Linear 0-1 inequalities and extended clauses, 1994. ,
DOI : 10.1007/978-3-642-46955-8_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.3566
A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization, 1995. ,
Feature Models, Grammars, and Propositional Formulas, Lecture Notes in Computer Science, vol.3714, pp.7-20, 2005. ,
DOI : 10.1007/11554844_3
A first step towards a framework for the automated analysis of feature models, Managing Variability for Software Product Lines: Working With Variability Mechanisms, 2006. ,
FaMa, Proceeding of the First International Workshop on Variability Modelling of Software-intensive Systems (VAMOS), 2007. ,
DOI : 10.1007/978-3-642-36583-6_11
Symbolic Model Checking without BDDs, Lecture Notes in Computer Science, vol.1579, pp.193-207, 1999. ,
DOI : 10.1007/3-540-49059-0_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8033
Qualitative choice logic, Artificial Intelligence, vol.157, issue.1-2, pp.203-237, 2004. ,
DOI : 10.1016/j.artint.2004.04.006
URL : http://doi.org/10.1016/j.artint.2004.04.006
The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971. ,
DOI : 10.1145/800157.805047
On solving covering problems Linear-time algorithms for testing the satisfiability of propositional horn formulae, Design Automation Conference, pp.197-202267, 1984. ,
Translating pseudo-boolean constraints into sat, Journal on Satisfiability Boolean Modeling and Computation (JSAT), vol.2, pp.1-26, 2006. ,
An extensible sat-solver, Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing, pp.502-518, 2003. ,
Stochastic Local Search, 2004. ,
DOI : 10.1201/9781420010749.ch19
Second DIMACS implementation challenge : cliques, coloring and satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, 1996. ,
Managing the Complexity of Large Free and Open Source Package-Based Software Distributions, 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06), pp.199-208, 2006. ,
DOI : 10.1109/ASE.2006.49
URL : https://hal.archives-ouvertes.fr/hal-00149566
On using cutting planes in pseudo-boolean optimization, Journal on Satisfiability Boolean Modeling and Computation (JSAT), vol.2, pp.209-219, 2006. ,
The first evaluation of pseudo-boolean solvers (pb'05), Journal on Satisfiability Boolean Modeling and Computation (JSAT), vol.2, pp.103-143, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00110082
Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001. ,
DOI : 10.1145/378239.379017
Pueblo: A Hybrid Pseudo- Boolean SAT Solver, Journal on Satisfiability Boolean Modeling and Computation (JSAT), vol.2, pp.165-182, 2006. ,
DOI : 10.1109/date.2005.246
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.3692
Safe composition of product lines, Proceedings of the 6th international conference on Generative programming and component engineering , GPCE '07, pp.95-104, 2007. ,
DOI : 10.1145/1289971.1289989
Finding Minimal Unsatisfiable Cores of Declarative Specifications, Lecture Notes in Computer Science, vol.5014, pp.326-341, 2008. ,
DOI : 10.1007/978-3-540-68237-0_23
Kodkod: A Relational Model Finder, Lecture Notes in Computer Science, vol.4424, pp.632-647, 2007. ,
DOI : 10.1007/978-3-540-71209-1_49
OPIUM: Optimal Package Install/Uninstall Manager, 29th International Conference on Software Engineering (ICSE'07), pp.178-188, 2007. ,
DOI : 10.1109/ICSE.2007.59
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.323.8468