Josep Argelich Romà

Universitat de Lleida C./ Jaume II, 69 25001 Lleida (Spain) Phone: +34 973 70 27 64

Departament d'Informàtica i Enginyeria Industrial Grup de Recerca en Intel·ligència Artificial E-Mail: Fax: +34 973 70 27 02

About Me

Born in Mollerussa (map) in 1979. Engineer in Computer Science from the Universitat Politècnica de Catalunya, Barcelona, Spain, in 2003. Ph.D. in Computer Science (funded by Ministerio de Educación y Ciencia) from the Universitat de Lleida, Lleida, Spain, in 2008. Currently, I'm working in the Artificial Intelligence Research Group of the Universitat de Lleida.

Projects

• European Commission Project: MANCOOSI: Managing the Complexity of the Open Source Infrastructure. FP7-ICT-214898, 2008-2011.
• Fundação para a Ciência e a Tecnologia Project: BSOLO - Boolean constraint SOLving and Optimization. PTDC/EIA/76572/2006, 2008-2010.
• Ministerio de Educación y Ciencia Project: Many-Valued Logics Algorithms for SAT and Max-SAT. TIN2007-68005-C04-02, 2007-2010.
• Ministerio de Educación y Ciencia Project: Impact of Modelling in SAT and Max-SAT. Acción Integrada HP2005-0147, 2006-2007.
• Ministerio de Educación y Ciencia Project: Solving Combinatorial Problems with Hard and Soft Constraints Using Satisfiability Algorithms. TIC2003-00950, 2003-2006.
• Ministerio de Educación y Ciencia Project: Classical and Many-Valued Logics: Foundations and Applications. TIC2001-1577-C03-03, 2001-2004.

Publications

• J. Marques-Silva, J. Argelich, A. Graça and I. Lynce. Boolean Lexicographic Optimization. In 17th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA-2010, Bologna, Italy, To be published in CEUR-WS, 2010.
• J. Argelich, D. Le Berre, I. Lynce, J. Marques-Silva and P. Rapicault. Solving Linux Upgradeability Problems Using Boolean Optimization. In Workshop on Logics for Component Configuration, 13th International Conference on Theory and Applications of Satisfiability Testing, SAT-2010, Edinburgh, Scotland, EPTCS 29, 2010. (DOI Bookmark)
• J. Argelich, A. Cabiscol, I. Lynce and F. Manyà. New Insights into Encodings from MaxCSP into Partial MaxSAT. In 40th International Symposium on Multiple-Valued Logic, ISMVL-2010, Barcelona, Spain, pages 46-52, IEEE CS Press, 2010. (DOI Bookmark)

• J. Argelich, I. Lynce and J. Marques-Silva. On Solving Boolean Multilevel Optimization Problems. In 21st International Joint Conference on Artificial Intelligence, IJCAI-2009, Pasadena, USA, pages 393-398, Conference Proceedings, 2009. (pdf)
• J. Argelich, A. Cabiscol, I. Lynce and F. Manyà. Sequential Encodings from Max-CSP into Partial Max-SAT. In 12th International Conference on Theory and Applications of Satisfiability Testing, SAT-2009, Swansea, UK, pages 161-166, Springer LNCS 5584, 2009. (DOI Bookmark)
• J. Argelich, A. Cabiscol, I. Lynce and F. Manyà. Regular Encodings from Max-CSP into Partial Max-SAT. In 39th International Symposium on Multiple-Valued Logic, ISMVL-2009, Naha, Japan, pages 196-202, IEEE CS Press, 2009. (DOI Bookmark)

• J. Argelich and I. Lynce. CNF instances from the software package installation problem. In 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA-2008, Udine, Italy, CEUR-WS 451, 2008. (pdf)
• J. Argelich. Max-SAT Formalisms with Hard and Soft Constraints. PhD Thesis, 2008. (pdf)
• J. Argelich, C. M. Li, F. Manyà and J. Planes. The First and Second Max-SAT Evaluations. Journal on Satisfiability, 4:251-278, 2008. (pdf)
• J. Argelich, A. Cabiscol, I. Lynce and F. Manyà. Modelling Max-CSP as Partial Max-SAT. In 11th International Conference on Theory and Applications of Satisfiability Testing, SAT-2008, Guangzhou, P. R. China, pages 1-15, Springer LNCS 4996, 2008. (DOI Bookmark)
• J. Argelich, C. M. Li and F. Manyà. A Preprocessor for Max-SAT Solvers. In 11th International Conference on Theory and Applications of Satisfiability Testing, SAT-2008, Guangzhou, P. R. China, pages 16-20, Springer LNCS 4996, 2008. (DOI Bookmark)
• J. Argelich, A. Cabiscol, I. Lynce and F. Manyà. Encoding Max-CSP into Partial Max-SAT. In 38th International Symposium on Multiple-Valued Logic, ISMVL-2008, Dallas, USA, pages 106-111, IEEE CS Press, 2008. (DOI Bookmark)

• J. Argelich, C. M. Li and F. Manyà. An Improved Exact Solver for Partial Max-SAT. In The International Conference on Nonconvex Programming: Local & Global Approaches, NCP-2007, Rouen, France, pages 230-231, Conference Proceedings, 2007. (pdf)
• J. Argelich and F. Manyà. Partial Max-SAT Solvers with Clause Learning. In 10th International Conference on Theory and Applications of Satisfiability Testing, SAT-2007, Lisbon, Portugal, pages 28-40, Springer LNCS 4501, 2007. (DOI Bookmark)

• J. Argelich and F. Manyà. Learning Hard Constraints in Max-SAT. In 11th Annual ERCIM Workshop on Constrant Solving and Constraint Programming, CSCLP-2006, Caparica, Portugal, pages 5-12, Workshop Proceedings, 2006. (pdf)
• J. Argelich, X. Domingo, F. Manyà and J. Planes. Towards Solving Many-Valued MaxSAT.In 36th International Symposium on Multiple-Valued Logic, ISMVL-2006, Singapore, paper 26, IEEE CS Press, 2006. (DOI Bookmark)
• J. Argelich and F. Manyà. Exact Max-SAT Solvers for Over-Constrained Problems. Journal of Heuristics, 12(4-5):375-392, 2006. (DOI Bookmark)

• J. Argelich and F. Manyà. Solving Over-Constrained Problems with SAT. In 11th International Conference on Principles and Practice of Constraint Programming, CP-2005, Sitges, Spain, page 838, Springer LNCS 3709, 2005. (DOI Bookmark, extended version in pdf)
• J. Argelich and F. Manyà. Solving Over-Constrained Problems with SAT Technology. In 8th International Conference on Theory and Applications of Satisfiability Testing, SAT-2005, St. Andrews, UK, pages 1-15, Springer LNCS 3569, 2005. (DOI Bookmark)

• J. Argelich and F. Manyà. An Exact Max-SAT Solver for Over-Constrained Problems. In 6th International Workshop on Preferences and Soft Constraints, 10th International Conference on Principles and Practice of Constraint Programming, CP-2004, Toronto, Canada, pages 1-11, Workshop Proceedings, 2004. (pdf)
• J. Argelich and F. Manyà. Solving Over-Constrained Problems with Max-SAT Algorithms. In Workshop on Modelling and Solving Problems with Constraints, 16th European Conference on Artificial Intelligence, ECAI-2004, Valencia, Spain, pages 116-124, Workshop Proceedings, 2004. (pdf)
• J. Argelich. Solving Over-Constrained Problems with Max-SAT Technology. Diploma de Estudios Avanzados (DEA), Universitat de Lleida, 2004.

• J. Argelich. Resolución de Problemas Combinatorios con Restricciones Soft Utilizando Algoritmos de Max-SAT. Projecte de Final de Carrera de l'Enginyeria en Informàtica, Universitat Politècnica de Catalunya, 2003. (pdf)

• J. Argelich, R. Bejar, A. Cabiscol, C. Fernandez, C. Gomes and F. Manyà. Generating Hard Feasible Schedules. In 6th European Conference on Planning, ECP-2001, Toledo, Spain, pages 361-366, Springer LNAI, 2001. (pdf)
• J. Argelich. Generación de Problemas de Scheduling Computacionalmente Difíciles. Projecte de Final de Carrera de l'Enginyeria Tècnica en Informàtica de Gestió, Universitat de Lleida, 2001. (pdf)

Activities

• Co-organizer of MAX-SAT Evaluation 2006.
• Co-organizer of MAX-SAT Evaluation 2007.
• Co-organizer of MAX-SAT Evaluation 2008.
• Co-organizer of MAX-SAT Evaluation 2009.
• Co-organizer of MAX-SAT Evaluation 2010.

Teaching

• Comerç Electrònic. Màster en Enginyeria de Programari Lliure/Enginyeria en Informàtica (EPS), Universitat de Lleida, 2009-2010.
• Metodologia i Tecnologia de la Programació. Enginyeria Tècnica en Informàtica de Sistemes (EPS), Universitat de Lleida, 2003-2008/2009-2010.
• Realitzar Presentacions amb Eines Informàtiques. Institut de Ciències de l'Educació, Lleida, Spain, 2004.
• Creació de Webs Interactives. Universitat d'Estiu de la UdL, Lleida, Spain, 2004.

Off Topic

• Sudoku's web page, Universitat de Lleida, 2005.