CAREER: Detecting Interchangeability Relations in Constraint Satisfaction Problems and Exploiting them in Problem Solving and Interactions with Users

职业：检测约束满足问题中的互换性关系，并在问题解决和与用户交互中利用它们

• 批准号: 0133568
• 负责人: Berthe Choueiry
• 金额: $ 60万
• 依托单位: University of Nebraska-Lincoln
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2002
• 资助国家: 美国
• 起止时间: 2002-06-01 至 2008-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0133568&HistoricalAwards=false
• 关键词: CAREER; Detecting; Interchangeability; Relations; Constraint

This is a Faculty Early Career Development (CAREER) award. This project will improve our ability to solve problems in constraint satisfaction, which is a central paradigm for modeling and solving various problems in computer science, engineering, and management. It will do so by designing and evaluating algorithms that discover and exploit the structure embedded in the model of a decision problem formulated as a Constraint Satisfaction Problem (CSP). In particular, the work will investigate how symmetry relations, specified as interchangeability, can be used to build compact and faithful abstractions of CSPs. The goal of these investigations is not only to enhance the performance of solving CSPs, but also to support interactions with human users by allowing them to build and navigate over landscapes of solution spaces. Such techniques will institute a new paradigm in problem solving by making a computer perform as an active, informed assistant rather than as a passive black box. The project's education plan combines curriculum development, course teaching, and individual mentoring of students.This CAREER award recognizes and supports the early career-development activities of a teacher-scholar who is likely to become an academic leader of the twenty-first century. Constraint satisfaction is most commonly used in scheduling and resource allocation applications, as well as in artificial intelligence planning and collaborative problem-solving. Therefore, this research will improve the techniques available to solve very difficult practical problems in a variety of fields.

这是一个教师早期职业发展（Career）奖。这个项目将提高我们解决约束满足问题的能力，约束满足是计算机科学、工程和管理中建模和解决各种问题的核心范式。它将通过设计和评估算法来发现和利用作为约束满足问题（CSP）的决策问题模型中嵌入的结构。特别是，这项工作将研究对称关系如何被指定为互换性，可以用来构建紧凑和忠实的csp抽象。这些研究的目标不仅是提高解决csp的性能，而且还通过允许人类用户构建和导航解决方案空间的景观来支持与人类用户的交互。这些技术将使计算机成为一个主动的、知情的助手，而不是一个被动的黑匣子，从而在解决问题方面建立一个新的范例。该项目的教育计划结合了课程开发、课程教学和学生个人辅导。该奖项旨在表彰和支持有可能成为21世纪学术领袖的教师学者的早期职业发展活动。约束满足最常用于调度和资源分配应用，以及人工智能规划和协作解决问题。因此，这项研究将改进现有的技术，以解决各种领域中非常困难的实际问题。