Approximate Evaluation of Logic Programs

逻辑程序的近似评估

• 批准号: 9008737
• 负责人: Suzanne Dietrich
• 金额: $ 1.79万
• 依托单位: Arizona State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1990
• 资助国家: 美国
• 起止时间: 1990-10-01 至 1992-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9008737&HistoricalAwards=false
• 关键词: Approximate; Evaluation; Logic; Programs

Extension tables are a memo structure for logic programs that save the extension of a predicate in a table. Subsequent calls, whose answers are in the table, use a table lookup rather than recomputing the results. Since the terms that are saved are not necessarily ground facts, the induced subsumption ordering on Prolog terms is used to avoid saving redundant information in the table. This duplicate elimination mechanism will be extended by allowing for the specification of orderings other than those given by the subsumption of Prolog terms. This enhanced capability modifies the behavior of the execution method to provide an approximate evaluation of the logic program based on these orderings.

扩展表是逻辑程序的一种备忘录结构， 表中谓词的扩展。 随后的电话，谁的答案 在表中，使用表查找而不是重新计算 结果 由于保存的术语不一定是接地的 事实，Prolog项上的诱导包容排序用于 避免在表中保存冗余信息。 此重复 消除机制将通过允许 除包含所给出的顺序外， Prolog术语 这种增强的功能修改了 执行方法提供逻辑的近似评估 基于这些命令。