Optimization

Constraint Satisfaction and BioInformatics

At INRA (Institut National de la Recherche Agronomique) @ Toulouse I was post-doctoral fellow doing research in WCSP algorithms applied to Bioinformatic problems. An optimization library for solving WCSP and Bayesian Networks, translated to a WCSP (also called SoftCsp), is currently being developped. Toulbar2 solves pedigree problems of up to 100000 variables.

  • Toulbar2. C++ optimization library download.

Publications in the field

  • Soft arc consistency revisited. MC Cooper, S de Givry, M Sánchez, T Schiex, M Zytnicki, T Werner. Artificial Intelligence 174 (7), 449-478. 2010
  • Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. M. Sanchez, S. de Givry, T. Schiex. Constraints, 13(1), 2008 (special issue in Bioinformatics) Constraints Journal Impact Factor: 0.969 Journal Citation Reports 2007, Thomson Reuters. Download pdf
  • Virtual Arc Consistency for Weighted CSP. M. Cooper, S. de Givry, M. Sanchez, T. Schiex and M. Zytnicki. Proc. of AAAI’2008. Chicago, USA. Core A+. Download pdf
  • Arc coherence virtuelle pour CSP ponderes. M. Cooper, S. de Givry, M. Sanchez, T. Schiex and M. Zytnicki. Actes de JFPCI’2008. Nantes, France. Download pdf
  • TagSNP selection using Weighted CSP and Russian Doll Search with Tree Decomposition.  D. Allouche, S. de Givry, M. Sanchez, T. Schiex In the Proc. of the Workshop on Constraint Based Methods for Bioinformatics, Lisbon, Portugal. 2009. Download pdf
  • Russian Doll Search with Tree Decomposition. M. Sanchez, D. Allouche, S. de Givry, T. Schiex Proc. of IJCAI’09. 2009. Pasadena (CA). USA. Core A+. Download pdf
  • Russian Doll Search with Tree Decomposition. M. Sanchez, D. Allouche, S. de Givry, T. Schiex. Soft’08 Workshop attached to CP’08 conference, Sydnay, Australia. Download pdf
  • Poupees russes et decomposition arborescente. M. Sanchez, D. Allouche, S. de Givry, T. Schiex Actes de JFPC 2009, Nantes. Download pdf

Constraint Satisfaction Problems (CSP)

At IIIA (Institute of Artificial Intelligence) of CSIC Universitat Autonoma de Barcelona (UAB), I did my PHD thesis in the field of Constraint Satisfaction Problems (CSP) and Weighted CSP.

CSP Publications

  • Contributions to Search and Inference Algorithms for CSP and WCSP. By M. Sanchez. In Monografies de l’Institut d’Investigació d’intel.ligència artificial (IIIA, CSIC) ISBN 84-00-08432-2, 2006.
  • Tree Decomposition with Function Filtering. By M. Sanchez, J. Larrosa & P. Meseguer. In Principles and Practice of Constraint Programming CP2005. Sitges, 2005. Ranking: Core A. Download pdf
  • Improving Tree Decomposition Methods With Function Filtering. By M. Sanchez, J. Larrosa, P. Meseguer. Poster In International Join Conference on Artificial Intelligence IJCAI 2005 . Edinburgh, UK, 2005. Core A+. Download pdf
  • Improving the Applicability of Adaptive Consistency: Preliminary Results. By M. Sanchez, P. Meseguer & J. Larrosa. Poster Principles and Practice of Constraint Programming CP2004. Toronto, Canada, 2004. Core A. Download pdf
  • Using constraints with memory to implement variable elimination. By M. Sanchez, P. Meseguer & J. Larrosa. In Proceedigns of the European Conference on Artificial Intelligence – ECAI-2004. Valencia, Spain, 2004. Core A. Download pdf
  • Current approaches for solving overconstrained problems. By P. Meseguer, N. Bouhmala, T. Bouzoubaa, M. Irgens, M. Sánchez-Fibla Constraints Journal vol. 8, num. 1, 9-39, 2003.
  • Pseudo-tree search with soft constraints. By J. Larrosa, P. Meseguer & M. Sanchez. In European Conference on Artificial Intelligence – ECAI2002. Lyon, France. Core A. Download pdf
  • Opportunistic Specialization in Russian Doll Search. By P. Meseguer, M. Sánchez-Fibla , G. Verfaillie. Proceedings of Principles and Practice of Constraint Programming, CP02. LNCS 2470, Ed. P. van Hentenryck. 264-279, 2002. Core A. Download pdf
  • Specializing Russian Doll Search. By P. Meseguer, M. Sánchez-Fibla Proceedings of Principles and Practice of Constraint Programming, CP01, LNCS 2239, Ed. T. Walsh, 464-478, 2001. Core A. Download pdf
  • Lower Bounds for Non-binary Constraint Optimization. By P. Meseguer, J. Larrosa, M. Sánchez-Fibla. Proceedings of Principles and Practice of Constraint Programming, CP01, LNCS 2239, Ed. T. Walsh, 317-331, 2001. Core A. Download pdf
  • A tree-based Russian Doll Search. By Pedro Meseguer and Marti Sanchez-Fibla  in Workshop on Soft Constraints CP 2000 and also CCIA