@inbook {IOPORT.06104457,
    author       = {Walsh, Toby},
    title        = {Exploiting constraints.},
    year         = {2012},
    booktitle    = {Inductive logic programming. 21st international conference, ILP 2011, Windsor Great Park, UK, July 31 -- August 3, 2011. Revised selected papers},
    isbn         = {978-3-642-31950-1},
    pages        = {7-13},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-642-31951-8_3},
    abstract     = {Summary: Constraints can be exploited in paradigms outside of constraint programming. In particular, powerful global constraints can often be decomposed into small primitives and these decompositions can simulate complex propagation algorithms that perform sophisticated inference about a problem. We illustrate this approach with examples of exploiting constraints in propositional satisfiability (SAT), pseudo-Boolean (PB) solving, integer linear programming (ILP) and answer set programming (ASP).},
    identifier   = {06104457},
}