NSF Young Investigator: Constraint Programming Languages

约束在许多应用领域是无处不在的，包括运筹学（包装和调度）、硬件设计（电路验证）、计算语言学、计算机图形学和软件工程。约束编程语言有望显著减少这些应用程序的开发时间，同时保持合理的效率。这个项目的目的是研究约束编程语言的设计、实现和应用。同时考虑了应用语言和面向对象语言。设计问题关注于如何最好地支持所考虑的应用程序的已建立范例。实现研究考虑了各种约束系统的约束求解、蕴涵和泛化算法的设计。它还研究了约束编程语言的静态分析，以减少过程语言和基于约束的语言之间的性能差距，从而导致针对各种语言的优化编译器的发展。最后，应用程序验证项目中开发的技术和实现，并演示该技术的潜在影响。

Constraints are ubiquitous in many application areas including operations research (packing and scheduling), hardware design (circuit verification), computational linguistics, computer graphics, and software engineering. Constraint programming languages hold the promise of reducing the development time of these applications significantly, while preserving a reasonable efficiency. The purpose of this project to study the design, implementation, and applications of constraint programming languages. Both applicative and object-oriented languages are considered. Design issues focus on how best to support established paradigms for the applications considered. Implementation research considers the design of algorithms for constraint solving, entailment, and generalization for a variety of constraint systems. It also investigates the static analysis of constraint programming languages to reduce the performance gap between procedural and constraint-based languages, leading to the development of optimizing compilers for a variety of languages. Finally, applications validate the technology and implementation developed in the project and demonstrate the potential impact of the technology.