Predicting learnt clauses quality in modern sat solvers, IJCAI ,
Decompositions of all different, global cardinality and related constraints, Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI'09 ,
URL : https://hal.archives-ouvertes.fr/lirmm-00382607
Abstract, Theory and Practice of Logic Programming, vol.5, issue.1-2 ,
DOI : 10.1016/0743-1066(95)00121-2
URL : https://hal.archives-ouvertes.fr/hal-01117539
Translating pseudo-boolean constraints into sat, Journal on Satisfiability, Boolean Modeling and Computation, vol.2, issue.1 -4, pp.1-2 ,
On the subgraph epimorphism problem, Discrete Applied Mathematics, vol.162 ,
DOI : 10.1016/j.dam.2013.08.008
URL : https://hal.archives-ouvertes.fr/hal-01098527
A graphical method for reducing and relating models in systems biology, Bioinformatics, vol.26, issue.18 ,
DOI : 10.1093/bioinformatics/btq388
URL : https://hal.archives-ouvertes.fr/hal-01431335
Qmaxsat: A partial max-sat solver system description, Journal on Satisfiability Boolean Modeling and Computation, vol.8 ,
BioModels Database: a free, centralized database of curated, published, quantitative kinetic models of biochemical and cellular systems, Nucleic Acid Research, vol.1, issue.34, pp.689-691, 2006. ,