Project-Team Tasc
Members
Overall Objectives
Research Program
Application Domains
Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub

previous Previous | up Home

Bibliography

Major publications by the team in recent years
  • 1N. Beldiceanu, M. Carlsson, S. Demassey, T. Petit.
    Global Constraint Catalog: Past, Present and Future, in: Constraints, 2007, vol. 12, no 1, pp. 21-62.
    http://hal.archives-ouvertes.fr/hal-00481554/en/
  • 2N. Beldiceanu, M. Carlsson, S. Demassey, E. Poder.
    New Filtering for the cumulative constraint in the context of non-overlapping rectangles, in: Annals of Operations Research, 2010, pp. 1-20. [ DOI : 10.1007/s10479-010-0731-0 ]
    http://hal.archives-ouvertes.fr/hal-00485563/en/
  • 3N. Beldiceanu, M. Carlsson, E. Poder, R. Sadek, C. Truchet.
    A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects, in: 13th International on Principles and Practice of Constraint Programming (CP'07) 13th International on Principles and Practice of Constraint Programming (CP'07), Brown États-Unis, 2007, vol. 4741, pp. 180-194.
    http://hal.archives-ouvertes.fr/hal-00481558/en/
  • 4N. Beldiceanu, P. Flener, X. Lorca.
    Combining tree Partitioning, Precedence, and Incomparability Constraints, in: Constraints, 2008, vol. 13, no 4, pp. 459-489. [ DOI : 10.1007/s10601-007-9040-x ]
    http://hal.archives-ouvertes.fr/hal-00481533/en/
  • 5C. Bessiere, R. Debruyne.
    Theoretical Analysis of Singleton Arc Consistency and Its Extensions", in: Artificial Intelligence, 01 2008, vol. 172, no 1, pp. 29-41.
    http://hal-lirmm.ccsd.cnrs.fr/lirmm-00230949/en/
  • 6C. Bessiere, T. Petit, B. Zanuttini.
    Making Bound Consistency as Effective as Arc Consistency, in: IJCAI'09, 2009.
    http://hal-lirmm.ccsd.cnrs.fr/lirmm-00382609/en/
  • 7H. Cambazard, N. Jussien.
    Identifying and exploiting problem structures using explanation-based constraint programming, in: Constraints, 2006, vol. 11, no 4, pp. 295-313. [ DOI : 10.1007/s10601-006-9002-8 ]
    http://hal.archives-ouvertes.fr/hal-00293899/en/
  • 8G. Chabert, N. Beldiceanu.
    Sweeping with Continous Domains, in: 16th International Conference on Principles and Practice of Constraint Programming (CP'10), St Andrews, Scotland, D. Cohen (editor), Lecture Notes in Computer Science, Springer-Verlag, 2010, vol. 6308, pp. 137-151.
  • 9G. Chabert, L. Jaulin.
    Contractor Programming, in: Artificial Intelligence, 2009, vol. 173, pp. 1079-1100. [ DOI : 10.1016/j.artint.2009.03.002 ]
    http://hal.archives-ouvertes.fr/hal-00428957/en/
  • 10J.-M. Normand, A. Goldsztejn, M. Christie, F. Benhamou.
    A Branch and Bound Algorithm for Numerical MAX-CSP, in: LNCS The 14th International Conference on Principles and Practice of Constraint Programming, Australie, 09 2008, vol. 5202/2008, pp. 205-219, Best student paper award. [ DOI : 10.1007/978-3-540-85958-1_14 ]
    http://hal.archives-ouvertes.fr/hal-00481180/en/
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 11A. Letort.
    Passage à l'échelle pour les contraintes d'ordonnancement multi-ressources, Ecole des Mines de Nantes, October 2013.
    http://hal.inria.fr/tel-00932215

Articles in International Peer-Reviewed Journals

  • 12N. Beldiceanu, M. Carlsson, P. Flener, J. Pearson.
    On Matrices, Automata, and Double Counting in Constraint Programming, in: Constraints, January 2013, vol. 18, no 1, pp. 108-140. [ DOI : 10.1007/s10601-012-9134-y ]
    http://hal.inria.fr/hal-00758531
  • 13N. Beldiceanu, M. Carlsson, P. Flener, J. Pearson.
    On the Reification of Global Constraints, in: Constraints, January 2013, vol. 18, no 1, pp. 1-6. [ DOI : 10.1007/s10601-012-9132-0 ]
    http://hal.inria.fr/hal-00754252
  • 14N. Beldiceanu, P. Flener, J.-N. Monette, J. Pearson, H. Simonis.
    Toward sustainable development in constraint programming, in: Constraints, December 2013.
    http://hal.inria.fr/hal-00874276
  • 15M. Bodirsky, M. Hermann, F. Richoux.
    Complexity of Existential Positive First-Order Logic, in: Journal of Logic and Computation, 2013, vol. 23, no 4, pp. 753-760. [ DOI : 10.1093/logcom/exr043 ]
    http://hal.inria.fr/hal-00870985
  • 16B. Crawford, R. Soto, E. Monfroy, W. Palma, C. Castro, F. Paredes.
    Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization, in: Expert Systems with Applications (ESWA), 2013, vol. 40, no 5, pp. 1690-1695.
    http://hal.inria.fr/hal-00872942
  • 17E. Monfroy, C. Castro, B. Crawford, R. Soto, F. Paredes, C. Figueroa.
    A Reactive and Hybrid Constraint Solver, in: Journal of Experimental & Theoretical Artificial Intelligence, 2013, vol. 25, no 1, pp. 1-22.
    http://hal.inria.fr/hal-00872971
  • 18S. Ontañon, G. Synnaeve, A. Uriarte, F. Richoux, D. Churchill, M. Preuss.
    A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft, in: IEEE Transactions on Computational Intelligence and AI in games, 2013, vol. 5, no 4, pp. 1-19.
    http://hal.inria.fr/hal-00871001
  • 19C. Prud'Homme, X. Lorca, R. Douence, N. Jussien.
    Propagation Engine Prototyping with a Domain Specific Language, in: Constraints, 2013, 21 p. [ DOI : 10.1007/s10601-013-9151-5 ]
    http://hal.inria.fr/hal-00867604
  • 20R. Soto, B. Crawford, C. Galleguillos, E. Monfroy, F. Paredes.
    A hybrid ac3-tabu search algorithm for solving sudoku puzzles, in: Expert Systems with Applications, 2013, vol. 40, no 15, pp. 5817-5821.
    http://hal.inria.fr/hal-00875733
  • 21R. Soto, B. Crawford, S. Misra, W. Palma, E. Monfroy, C. Castro, F. Paredes.
    Choice functions for Autonomous Search in Constraint Programming: GA vs PSO, in: Technical Gazette, 2013, vol. 20, no 4, pp. 621-629.
    http://hal.inria.fr/hal-00875551
  • 22M. Wahbi, R. Ezzahir, C. Bessiere, E. H. Bouyakhf.
    Nogood-Based Asynchronous Forward Checking Algorithms, in: Constraints, July 2013, vol. 18, no 3, pp. 404-433. [ DOI : 10.1007/s10601-013-9144-4 ]
    http://hal.inria.fr/hal-00816928

International Conferences with Proceedings

  • 23A. Arbelaez, P. Codognet, C. Truchet.
    Using Runtime Distributions for the Analysis and Parallelization of Local Search for SAT, in: ICLP'13, Istanbul, Turkey, August 2013, 12 p.
    http://hal.inria.fr/hal-00872982
  • 24N. Beldiceanu, I. Georgiana, A. Lenoir, H. Simonis.
    Describing and Generating Solutions for the EDF Unit Commitment Problem with the ModelSeeker, in: 19th International Conference on Principles and Practice of Constraint Programming (CP'13), Uppsala, Sweden, C. Schulte (editor), Lecture Notes in Computer Science, Springer, September 2013, vol. 8124, pp. 733–748. [ DOI : 10.1007/978-3-642-40627-0_54 ]
    http://hal.inria.fr/hal-00874326
  • 25C. Bessiere, R. Ezzahir, M. Wahbi.
    Asynchronous Forward Bounding Revisited, in: CP'2013: 19th International Conference on Principles and Practice of Constraint Programming, Sweden, 2013, 10 p.
    http://hal.inria.fr/lirmm-00839024
  • 26B. Crawford, R. Soto, F. Johnson, E. Monfroy.
    Ants can schedule software projects, in: HCI International, Vegas, United States, Communications in Computer and Information Science, Springer, 2013, vol. 373, pp. 635-639, Poster paper.
    http://hal.inria.fr/hal-00875266
  • 27B. Crawford, R. Soto, E. Monfroy.
    Cultural algorithms for the set covering problem, in: The 4th International Conference in Swarm Intelligence, Harbin, China, Lecture Notes in Computer Science, Springer, 2013, vol. 7929.
    http://hal.inria.fr/hal-00875270
  • 28A. Derrien, T. Petit.
    The Energetic Reasoning Checker Revisited, in: CP Doctoral Program 2013, Uppsala, Sweden, September 2013, pp. 55-60.
    http://hal.inria.fr/hal-00873940
  • 29J. Du Boisberranger, D. Gardy, X. Lorca, C. Truchet.
    When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent, in: Meeting on Analytic Algorithmics and Combinatorics, New Orleans, Louisiana, USA, United States, M. Nebel, W. Szpankowski (editors), January 2013, pp. 80-90.
    http://hal.inria.fr/hal-00867576
  • 31C. Leon de la Barra, B. Crawford, R. Soto, E. Monfroy.
    Adaptive and multilevel approach for constraint solving, in: HCI International, Harbin, China, Communications in Computer and Information Science, Springer, 2013, vol. 373, pp. 650-654.
    http://hal.inria.fr/hal-00875279
  • 32C. Leon de la Barra, R. Soto, B. Crawford, C. Allendes, H. Berendsen, E. Monfroy.
    Modeling the portfolio selection problem with constraint programming, in: HCI International, Harbin, China, Communications in Computer and Information Science, Springer, 2013, vol. 373, pp. 645-649, Poster paper.
    http://hal.inria.fr/hal-00875285
  • 33A. Letort, M. Carlsson, N. Beldiceanu.
    A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint, in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference (CPAIOR'13), Yorktown Heights, NY, United States, C. P. Gomes, M. Sellman (editors), Lecture Notes in Computer Science, Springer, June 2013, vol. 7874, pp. 144-159.
    http://hal.inria.fr/hal-00874286
  • 34J.-N. Monette, N. Beldiceanu, P. Flener, J. Pearson.
    A Parametric Propagator for Discretely Convex Pairs of Sum Constraints, in: 19th International Conference on Principles and Practice of Constraint Programming (CP'13), Uppsala, Sweden, C. Schulte (editor), Lecture Notes in Computer Science, Springer, September 2013, vol. 8124, pp. 529-544. [ DOI : 10.1007/978-3-642-40627-0_40 ]
    http://hal.inria.fr/hal-00874309
  • 35E. Monfroy, B. Crawford, R. Soto.
    Automatic triggering of constraint propagation, in: The 13th International Conference Computational Science and Its Applications, Ho Chi Minh, Viet Nam, Lecture Notes in Computer Science, Springer, 2013, vol. 7975, pp. 452-461.
    http://hal.inria.fr/hal-00875541
  • 36E. Monfroy, B. Crawford, R. Soto.
    Interleaving constraint propagation: An efficient cooperative search with branch and bound, in: The 8th International Workshop on Hybrid Metaheuristics, Ischia, Italy, Lecture Notes in Computer Science, Springer, 2013, vol. 7919, pp. 52-61.
    http://hal.inria.fr/hal-00875542
  • 37N. Narodytska, T. Petit, M. Siala, T. Walsh.
    Three Generalizations of the FOCUS Constraint, in: 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), Beijing, China, Sep 2013, ISBN 978-1-57735-633-2.
    http://hal.inria.fr/hal-00871750
  • 38N. Razakarison, N. Beldiceanu, M. Carlsson, H. Simonis.
    GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials, in: The Sixth Annual Symposium on Combinatorial Search (SOCS'13), Leavenworth, WA, United States, M. Helmert, G. Röger (editors), Malte Helmert and Gabriele Röger, July 2013.
    http://hal.inria.fr/hal-00874297
  • 39R. Soto, S. Caro, B. Crawford, E. Monfroy.
    Robust solutions for a robotic manipulator optimization problem, in: The 5th International Work-Conference on the Interplay Between Natural and Artificial Computation, Mallorca, Spain, Lecture Notes in Computer Science, Springer, 2013, vol. 7931, pp. 451-460.
    http://hal.inria.fr/hal-00875554
  • 40R. Soto, B. Crawford, D. Riquelme, E. Monfroy.
    A GUI for modeling regular constraints, in: HCI International, Las vegas, United States, Communications in Computer and Information Science, 2013, vol. 373, pp. 660-663, Extended abstract.
    http://hal.inria.fr/hal-00875754
  • 41C. Truchet, F. Richoux, P. Codognet.
    Prediction of Parallel Speed-ups for Las Vegas Algorithms, in: 42nd International Conference on Parallel Processing, Lyon, France, IEEE, 2013, pp. 160-169. [ DOI : 10.1109/ICPP.2013.25 ]
    http://hal.inria.fr/hal-00870979

National Conferences with Proceedings

  • 42C. Prud'Homme, X. Lorca, R. Douence, N. Jussien.
    Prototyper des Moteurs de Propagation avec un DSL, in: Journées française de la Programmation par Contraintes, Aix-en-Provence, France, 2013, pp. 279-288.
    http://hal.inria.fr/hal-00867713
  • 43M. Wahbi, R. Ezzahir, C. Bessiere, E. H. Bouyakhf.
    Maintien asynchrone de la consistance d'arc dans la recherche distribuée synchrone, in: JFPC'2013: Journées Francophones de Programmation par Contraintes, Aix-en-Provence, France, 2013, 10 p.
    http://hal.inria.fr/lirmm-00830408

Conferences without Proceedings

  • 44J.-G. Fages, G. Chabert, C. Prud'Homme.
    Combining finite and continuous solvers Towards a simpler solver maintenance, in: The 19th International Conference on Principles and Practice of Constraint Programming, Uppsala, Sweden, September 2013, TRICS'13 Workshop: Techniques foR Implementing Constraint programming Systems.
    http://hal.inria.fr/hal-00904069
  • 45H. Simonis, N. Beldiceanu.
    A Model Seeker: Extracting Global Constraint Models From Positive Examples, in: 2013 INFORMS Computing Society Conference, Santa Fe, United States, January 2013.
    http://hal.inria.fr/hal-00754361

Internal Reports

Other Publications


previous Previous | up Home