摘要翻译：
本文介绍了在有限域约束程序设计系统的实现中所使用的领域特定语言，这些语言在SWI-Prolog和YAP-PROLOG中作为库（clpfd）提供。这些DSL用于传播子选择和约束具体化。在这些领域中，它们导致了简明的规范，易于阅读和推理。在编译时，这些规范被转换为Prolog代码，从而减少解释性运行时开销。所设计的语言也可用于其他有限域约束求解器的实现，并有助于它们的正确性、简洁性和效率。
---
英文标题：
《Domain-specific Languages in a Finite Domain Constraint Programming
  System》
---
作者：
Markus Triska
---
最新提交年份：
2011
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  In this paper, we present domain-specific languages (DSLs) that we devised for their use in the implementation of a finite domain constraint programming system, available as library(clpfd) in SWI-Prolog and YAP-Prolog. These DSLs are used in propagator selection and constraint reification. In these areas, they lead to concise specifications that are easy to read and reason about. At compilation time, these specifications are translated to Prolog code, reducing interpretative run-time overheads. The devised languages can be used in the implementation of other finite domain constraint solvers as well and may contribute to their correctness, conciseness and efficiency.
---
PDF链接：
https://arxiv.org/pdf/1108.6007