Abstraction, Reformulation, and Approximation
Abstraction, Reformulation, and Approximation
复制标题
抽象、重构和近似
DOI：
10.1007/978-3-540-73580-9_16
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Gent I
中科院分区：
文献类型：
--
作者：
Gent I
为了将约束编程应用于特定领域，必须首先将该问题建模为约束满足问题。对于给定的问题，通常有许多可供选择的模型，而制定一个有效的模型需要大量的专业知识。为了减少这一瓶颈，EssenceLanguage允许抽象地指定问题，即不进行建模决策。该规范由共轭系统自动提炼成独立于求解器的约束建模语言Essence‘。然而，转换Essence的模型以用于特定的约束求解器仍然需要大量的工作。本文结合约束求解器Minion讨论了这种“剪裁”过程。
In order to apply constraint programming to a particular domain, the problem must first bemodelledas a constraint satisfaction problem. There are typically many alternative models of a given problem, and formulating an effective model requires a great deal of expertise. To reduce this bottleneck, theEssencelanguage allows the specification of a problemabstractly, i.e. without making modelling decisions. This specification is refined automatically by theConjuresystem to a solver-independent constraint modelling languageEssence′. However, there is still significant work involved in translating anEssence′ model for use with a particular constraint solver. This paper discusses this ‘tailoring’ process with reference to the constraint solverMinion.