一种维持约束网络相容性的双向传播策略

约束满足问题是经典NP-hard问题,其基本算法是递归形式的回溯算法和弧一致性算法.将弧相容与回溯搜索结合,可以有效降低解空间大小.针对弧相容的维持问题,提出一种新的基于时序计数的传播方案,用于增量更新约束子网.将accumulateRevision和pushRevison作为双向修订的主要方法,以减少修订次数和域过滤变量的数量.实验结果表明,与经典的基于关系的方案和基于变量的传播方案相比,该方案的整体求解速度明显提高,且具有较少的修订时间.

Establishment of Knowledge Base Management System and the Type Selection of Mechanism for Mechanism Kinematic Scheme

Firstly data standardization technology and combined classification method have been applied to carry out classification of kinematic behaviors and mechanisms in the mapping field between the kinematic behavior level and the mechanism level of conceptual design.The principle of computer coding and storing have been built to give a fast and broad selection of mechanisms that meets the requirements of basic motion characters.Then on the basis of mentioned above,the heuristic matching propagation principle (HMPP) of kinematic behaviors and its true table serves as a guide to perform mechanism types selection.Finally an application is given to indicate its practicability and effectiveness.