RI: Small: Integrating Logic Based Declarative Programming Paradigms

RI：小型：集成基于逻辑的声明式编程范式

• 批准号: 1018031
• 负责人: Yuanlin Zhang
• 金额: $ 30.01万
• 依托单位: Texas Tech University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2010
• 资助国家: 美国
• 起止时间: 2010-09-01 至 2015-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1018031&HistoricalAwards=false
• 关键词: RI; Small; Integrating; Logic; Based

The project is developing a new, powerful paradigm for declarative programming, capable of solving computational problems that require a large amount of diverse knowledge and use of different reasoning methods. Such problems frequently occur in practice but cannot be solved by more traditional methods of declarative (or procedural) programming. The research includes the development of a language for representing various types of knowledge, algorithms and systems for reasoning about this knowledge, and a methodology of using the language and the systems for solving a large variety of computational problems. Our approach to declarative programming will integrate the ideas from Answer Set Programming (ASP), Constraint Programming (CP), programming methods based on Boolean Satisfiability (SAT) and Satisfiability Modulo Theory (SMT), and with a longer-term goal of including abductive and probabilistic reasoning as well. The approach will be tested on problems in challenging application domains such as a decision support system for space shuttle controllers, secure software systems with complex authorization and obligation policies, and systems capable of planning and scheduling based on non-trivial domain knowledge.

该项目正在为声明性编程开发一种新的，强大的范式，能够解决需要大量不同知识和使用不同推理方法的计算问题。这种问题经常在实践中发生，但无法通过更传统的声明性（或程序）编程来解决。该研究包括开发一种语言，用于代表各种知识，算法和系统来推理这些知识，以及使用该语言和系统来解决各种计算问题的方法。我们的声明性编程方法将整合答案集编程（ASP），约束编程（CP），基于布尔可满足性（SAT）的编程方法和满意度模式理论（SMT），并具有包括外在性和概率推理的长期目标。该方法将在具有挑战性的应用领域的问题上进行测试，例如用于航天飞机控制器的决策支持系统，具有复杂授权和义务策略的安全软件系统以及能够基于非平凡域知识计划和调度的系统。