Volume 18, Issue 1, January 2013

ISSN: 1383-7133 (Print) 1572-9354 (Online)

In this issue (5 articles)

  1. No Access

    Letter

    On the reification of global constraints

    Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson Pages 1-6
    Look Inside Get Access

  2. No Access

    OriginalPaper

    On the hardness of solving edge matching puzzles as SAT or CSP problems

    Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu Pages 7-37
    Look Inside Get Access

  3. No Access

    OriginalPaper

    Structural tractability of enumerating CSP solutions

    Gianluigi Greco, Francesco Scarcello Pages 38-74
    Look Inside Get Access

  4. No Access

    OriginalPaper

    View-based propagator derivation

    Christian Schulte, Guido Tack Pages 75-107
    Look Inside Get Access

  5. No Access

    OriginalPaper

    On matrices, automata, and double counting in constraint programming

    Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson Pages 108-140
    Look Inside Get Access