Introducing ESRA, a relational language for modelling combinatorial problems

DOI10.1007/978-3-540-25938-1_18MaRDI QIDQ5713943zbMATH OpenOpenAlexFDO

Authors Pierre Flener, Justin Pearson, Magnus Ågren

Publication date 27 December 2005

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

Full work available at URL https://doi.org/10.1007/b98080

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• A modeling layer for constraint-programming libraries
• Introduction to the constraint language NCL
• Essence: A constraint language for specifying combinatorial problems
• High-level modelling and reformulation of constraint satisfaction problems
• Combining relational algebra, SQL, constraint modelling, and local search

Cited in

(8)

• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• Automated reformulation of specifications by safe delay of constraints
• A semantic account for modularity in multi-language modelling of search problems
• ESRA
• MiningZinc: a declarative framework for constraint-based mining
• Logic Programming
• The design of the zinc modelling language
• Essence: A constraint language for specifying combinatorial problems

Describes a project that uses

Uses Software

• NP-SPEC
• SALSA

This page was built for publication: Introducing ESRA, a relational language for modelling combinatorial problems

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