Procedural code generation vs static expansion in modelling languages for constraint programming

DOI10.1007/978-3-642-19486-3_3MaRDI QIDQ3085936zbMATH OpenOpenAlexFDO

Authors Julien Martin, Thierry Martinez, François Fages

Publication date 1 April 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19486-3_3

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• From Rules to Constraint Programs with the Rules2CP Modelling Language
• Processes, Terms and Cycles: Steps on the Road to Infinity
• scientific article; zbMATH DE number 1045433
• A comparative study of eight constraint programming languages over the Boolean and finite domains
• Compiling constraints in clp(FD)

Cited in

(2)

• Rules2CP
• From Rules to Constraint Programs with the Rules2CP Modelling Language

This page was built for publication: Procedural code generation vs static expansion in modelling languages for constraint programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085936)