P. Flener, J. Pearson, and M. Agren, Introducing esra, a Relational Language for Modelling Combinatorial Problems, LOPSTR'03, pp.214-232, 2003.
DOI : 10.1007/978-3-540-25938-1_18

A. M. Frisch, M. Grum, C. Jefferson, B. M. Hernandez, and I. Miguel, The design of ESSENCE: A constraint language for specifying combinatorial problems, p.7, 2007.

L. Garcia-de, M. J. Banda, K. Marriott, R. Rafeh, and M. Wallace, The modelling language Zinc, pp.700-705

N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck et al., Mini- Zinc: Towards a standard CP modelling language, pp.529-543
DOI : 10.1007/978-3-540-74970-7_38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.9321

G. J. Duck, P. J. Stuckey, and S. Brand, ACD Term Rewriting, LNCS, vol.4079, pp.117-131, 2006.
DOI : 10.1007/11799573_11

K. Mckinnon and H. Williams, Constructing integer programming models by the predicate calculus, Annals of Operations Research, vol.14, issue.1, pp.227-246, 1989.
DOI : 10.1007/BF02022101

P. Refalo, Linear Formulation of Constraint Programming Models and Hybrid Solvers, 6th Intl. Conf. on Principles and Practice of Constraint Programming, pp.369-383, 2000.
DOI : 10.1007/3-540-45349-0_27

R. Rafeh, M. J. Garcia-de-la-banda, K. Marriott, and M. Wallace, From Zinc to Design Model, 9th Intl. Symposium on Practical Aspects of Declarative Languages (PADL'07, pp.215-229, 2007.
DOI : 10.1007/978-3-540-69611-7_14

T. Frühwirth, Theory and practice of constraint handling rules, The Journal of Logic Programming, vol.37, issue.1-3, pp.95-138, 1998.
DOI : 10.1016/S0743-1066(98)10005-5

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., The Maude 2.0 System, Rewriting Techniques and Applications (RTA'03). Volume 2706 of LNCS, pp.76-87, 2003.
DOI : 10.1007/3-540-44881-0_7

Q. Li, Y. Guo, and T. Ida, Modelling integer programming with logic: Language and implementation, IEICE Transactions of Fundamentals of Electronics, issue.8, pp.1673-1680, 2000.

E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Discrete Applied Mathematics, vol.89, issue.1-3, pp.3-44, 1998.
DOI : 10.1016/S0166-218X(98)00136-X

G. Tseitin, On the complexity of derivation in propositional calculus, Studies in Constructive Mathematics and Mathematical Logic Automation of Reasoning, pp.115-125, 1968.

J. Hooker, Integrated Methods for Optimization, 2007.
DOI : 10.1007/978-1-4614-1900-6

D. Baatar, N. Boland, S. Brand, and P. J. Stuckey, Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches, LNCS, vol.4510, pp.1-15, 2007.
DOI : 10.1007/978-3-540-72397-4_1

A. M. Frisch, C. Jefferson, B. M. Hernández, and I. Miguel, The rules of constraint modelling, 19th International Joint Conference on Artificial Intelligence (IJCAI'05, pp.109-116, 2005.

N. Tamura, A. Taga, S. Kitagawa, and M. Banbara, Compiling finite linear CSP into SAT, pp.590-603

O. Ohrimenko, P. Stuckey, and M. Codish, Propagation = Lazy Clause Generation, pp.544-558
DOI : 10.1007/978-3-540-74970-7_39