约束逻辑程序设计的变量压缩事件分析

Event Analysis of Variables Narrowing in CLP

该文涉及的约束逻辑程序设计(CLP)是一在二叉树上进行搜索的过程,提高搜索效率是CLP的主要研究方向之一。在CLP中约束推理机是核心,由变量组、约束过滤器、临时容器、推理引擎组成。在介绍了约束推理机激活过滤器,对变量进行区间压缩后,提出引入变量事件,总结为三种类型:SINGLE、BOUND和DOMCHG,用于减少过滤器的激发次数。实验结果表明,变量事件能够促进约束推理机的搜索效率,缩短二叉树搜索的时间,可以更快寻找到答案。

Constraint logic programming in the paper is to search nodes in one binary tree and is useful for solving combinatorial problems such as optimization and scheduling.The searching runtime is one important division for constraint programming research.Constraint tree search engine is the core of constraint programming and includes variables,constraint filters,store and propagation engine.After how to waken filters for constraint programming is shown,Event occurrence of variables is introduced to reduce wakening times of filters.Event type has three,SINGLE,BOUND and DOMCHG.Test shows event occurrence of variables can improve tree search efficiency and reduce runtime of searching the binary tree to get solutions with less time.