启发式回溯算法求解约束满足问题

针对一个典型的具有可变取值域的随机约束满足问题,提出了利用度启发式策略和最少约束值启发式策略来选择变量进行赋值的不完备回溯算法。该算法首先通过度启发式来确定待赋值变量的顺序,然后利用最少约束值启发式对选择的变量进行赋值,最后在有限时间内通过回溯得到变量的一组取值。用此算法对由RB模型生成的随机实例进行求解,实验结果表明,与经典的回溯算法相比,该算法具有显著的优越性。在控制参数(即约束紧度)进入相变区域时,该算法能在较短的时间内有效地找到实例的解。     

智能回溯的两大途径

本文详细介绍了获得智能回溯的两个基本方法:最小不一致演绎树和最大可合一约束集。逻辑程序求解失败时,这两种方法均可分析引起失败的原因,前者在与失败有关的子句空间内进行回溯,后者找出所有可能的回溯点,以便选择最佳回溯点进行回溯。     

数独基于规则的逐步枚举算法设计

给出了数独(Sudoku)的6条性质,并在此基础上提出了6条推理规则,然后结合空格填写的一个一组,两个一组及更多个一组的枚举算法,在枚举中进行推理.使推理和枚举结合起来,对有唯一解的数独问题,其求解速度比回溯法快得多,同时也能完成许多数独软件无法进行推理计算的数独难题.用两个数独难题进行验证,表明该方法十分有效.     

遗传算法在多目标决策中的应用研究

1 引言多目标优化是实践中广泛存在的一种优化问题,其理论研究已经取得了一些进展,但是在算法上还不太成熟。一种求解方法是将各个目标加权,从而将多目标问题转化为单目标问题。另一种方法是求多目标规划问题的非劣解(Pareto意义下的最优解),供决策者从中选择。本文主要讨论如何求解多目标优化问题的Pareto有效解。现在,考虑如下带有等式约束和不等式约束的多目标优化问题。     

Visual Prolog的搜索控制机制分析

回溯机制是逻辑程序设计的重要设施。回溯本身是一种获得目标所有可能解的良好方法。然而回溯也有副作用,一是它可能导致Visual Prolog给出多余的答案,而Visual Prolog自己不能区分实质上相同的两个解,因此会降低效率;二是尽管一个特殊的目标已被满足,但是回溯机制可能还会强迫Visual Prolog继续手找另外的解,因此会增加系统开销。在这些情况下,必须仔细控制目标搜索求解的回溯过程。本文在揭示Visual Prolog回溯机制所存在问题的基础上,通过实例,对Visual Prolog的静态截断机制、失败谓词fail与否定谓词not等控制谓词,以及动态截断机制等所构成的完整的目标搜索求解控制机制进行了详细分析,从而揭示出回溯机制和搜索求解控制机制的本质特性及应用机理。     

面向知识图谱约束问答的强化学习推理技术

知识图谱问答任务通过问题分析与知识图谱推理,将问题的精准答案返回给用户,现已被广泛应用于智能搜索、个性化推荐等智慧信息服务中.考虑到关系监督学习方法人工标注的高昂代价,学者们开始采用强化学习等弱监督学习方法设计知识图谱问答模型.然而,面对带有约束的复杂问题,现有方法面临两大挑战:(1)多跳长路径推理导致奖励稀疏与延迟;(2)难以处理约束问题推理路径分支.针对上述挑战,设计了融合约束信息的奖励函数,能够解决弱监督学习面临的奖励稀疏与延迟问题;设计了基于强化学习的约束路径推理模型COPAR,提出了基于注意力机制的动作选择策略与基于约束的实体选择策略,能够依据问题约束信息选择关系及实体,缩减推理搜索空间,解决了推理路径分支问题.此外,提出了歧义约束处理策略,有效解决了推理路径歧义问题.采用知识图谱问答基准数据集对COPAR的性能进行了验证和对比.实验结果表明:与现有先进方法相比,在多跳数据集上性能相对提升了2%-7%,在约束数据集上性能均优于对比模型,准确率提升7.8%以上.     

基于环境Pareto 支配选择策略的有约束多目标差分进化算法

在处理有约束多目标问题的进化算法中, 目前普遍采用Deb 教授提出的约束占优的直接支配选择策略. 在约束处理中, 优秀不可行解与优秀可行解同样重要, 但在直接支配选择策略中, 不可行解被选择的几率很小. 针对此问题, 设计一种环境Pareto 支配的选择策略, 并基于此提出用于解决有约束多目标问题的差分进化算法. 对经典测试函数进行仿真计算, 结果表明, 与其他算法相比, 所提出的算法具有更高的收敛性和稳定性.

     

未知环境下基于约束点的移动机器人路径规划

针对未知环境中障碍物种类多样性和位置不确定性的特点,提出了基于约束点的路径规划方法。首先对机器人在未知环境中检测到的局部障碍物信息进行分类和几何特征属性描述,得其约束点信息,然后引入改进后的A*算法,将其搜索范围局限于约束点上,计算约束点的评价函数值后得到子目标点,机器人到达子目标点后,若陷入死区,则采取回溯路径策略,重新选择子目标点,否则根据该点所属的障碍物种类采取跨越或绕行避障策略,最后移动机器人在未知环境中顺利到达目标点。仿真研究说明本文提出的路径规划方法具有可行性和有效性。     

模糊概率SDG模型及故障推理方法

基于符号有向图(SDG)的故障诊断方法具有良好的完备性和易于解释性,但其存在分辨率差的缺陷,为此提出基于模糊概率SDG模型和贝叶斯推理的半定量故障诊断方法.用模糊变量表示节点变量,用条件概率表(CPT)表达节点间的定性因果关系,利用贝叶斯推理和回溯搜索找出故障源候选解的集合,并对候选解进行排序.最后建立了某卫星一次电源系统的诊断模型.仿真结果表明,该方法有效地提高了诊断的分辨率,适用于航天器在轨故障诊断.     

合一和回溯智能加速部件的设计与实现

本文设计了一个高效的合一和回溯智能加速部件，在实现时我们运用了自己提出的优化线性合一算法超前检查智能回溯策略。经测试和分析表明，采用该加速部件的Ｐｒｏｌｏｇ实现系统的效率要比软件实现提高十倍以上。     

PELAS-program error-locating assistant system

Error localization in program debugging is the process of identifying program statements which cause incorrect behavior. A prototype of the error localization assistant system which guides a programmer during debugging of Pascal programs is described. The system is interactive: it queries the programmer for the correctness of the program behavior and uses answers to focus the programmer's attention on an erroneous part of the program (in particular, it can localize a faulty statement). The system differs from previous approaches in that it makes use of the knowledge of program structure, which is derived automatically. The knowledge of program structure is represented by the dependence network which is used by the error-locating reasoning mechanism to guide the construction, evaluation, and modification of hypothesis of possible causes of the error. Backtracking reasoning has been implemented in the reasoning mechanism     

ModEnPBT: A Modified Backtracking Ensemble Pruning algorithm

This paper proposes a new Modified Backtracking Ensemble Pruning algorithm (ModEnPBT), which is based upon the design idea of our previously proposed Ensemble Pruning via Backtracking algorithm (EnPBT), and however, aiming at overcoming its drawback of redundant solution space definition. Solution space of ModEnPBT is compact with no repeated solution vectors, therefore it possesses relatively higher searching efficiency compared with EnPBT algorithm. ModEnPBT still belongs to the category of Backtracking algorithm, which can systematically search for the solutions of a problem in a manner of depth-first, which is suitable for solving all those large-scale combinatorial optimization problems. Experimental results on three benchmark classification tasks demonstrate the validity and effectiveness of the proposed ModEnPBT.     

用回跳法求解稳定婚姻问题

介绍了稳定婚姻问题和解决该问题的回溯法;在回溯法的基础上提出了改进算法回跳法;从理论上和实验上证明了回跳法的效率远高于回溯法的效率。     

基于回代信赖域的电阻层析成像算法

针对电阻层析成像(ERT)技术中反演问题的病态性,提出一种改进的回代信赖域算法BTR(Backtracking Trust Region),并将其应用于气/水两相流的可视化测量。该算法通过信赖域算法获得迭代方向,通过回代技术获得迭代步长,可在减小重建误差的同时,提高成像速度。利用Comsol软件进行仿真,并设计ERT系统对各种典型流型进行测量,验证了算法的可行性。通过与Landweber算法、共轭梯度算法和现存的信赖域算法的比较,证明本文方法明显改进了成像精度和实时性。     

用回溯法求哈密顿通路

回溯法是一种按照深度优先的策略从根结点开始搜索解空间树的算法，该算法可以用来求出问题的全部解，也可以在求出问题的一个解之后停止对问题的求解，即只求该问题是否有解。哈密顿通路就是判断图中是否存在一条通过所有顶点一次且仅一次的路径。本文主要讲的就是用回溯法来求解一个任意的图中是否存在一条哈密顿通路的问题，并用具体的算法来实现它。     

Reasoning from last conflict(s) in constraint programming

Constraint programming is a popular paradigm to deal with combinatorial problems in artificial intelligence. Backtracking algorithms, applied to constraint networks, are commonly used but suffer from thrashing, i.e. the fact of repeatedly exploring similar subtrees during search. An extensive literature has been devoted to prevent thrashing, often classified into look-ahead (constraint propagation and search heuristics) and look-back (intelligent backtracking and learning) approaches. In this paper, we present an original look-ahead approach that allows to guide backtrack search toward sources of conflicts and, as a side effect, to obtain a behavior similar to a backjumping technique. The principle is the following: after each conflict, the last assigned variable is selected in priority, so long as the constraint network cannot be made consistent. This allows us to find, following the current partial instantiation from the leaf to the root of the search tree, the culprit decision that prevents the last variable from being assigned. This way of reasoning can easily be grafted to many variations of backtracking algorithms and represents an original mechanism to reduce thrashing. Moreover, we show that this approach can be generalized so as to collect a (small) set of incompatible variables that are together responsible for the last conflict. Experiments over a wide range of benchmarks demonstrate the effectiveness of this approach in both constraint satisfaction and automated artificial intelligence planning.     

PROLOG运行机制的辅助理解工具

用表意图形的方法研究了人工智能语言ＰＲＯＬＯＧ的各种语法成份，找出一套有效的辅助理解工具，它能准确清晰地图解ＰＲＯＬＯＧ程序，如目标和子句，谓词ＦＡＩＬ和回溯，以及截断谓词等内容。文中特别用两个例子详述了在ＰＲＯＬＯＧ语言中最难理解的递归过程。最后，简述了矩形表示法，该工具的图册和配套的图形动画软件。     

Improved backtracking search algorithm for pseudo dynamic active earth pressure on retaining wall supporting c-Ф backfill

Optimization algorithms are effective and powerful tools for solving the non-linear optimization problems. Backtracking Search Optimization Algorithm (BSA) is a newly proposed Evolutionary Algorithm (EA) and has been applied to optimize different complex optimization problems in science and engineering. In the present study, a new adaptive control parameter based Improved Backtracking Search Optimization Algorithm (IBSA) is suggested. Due to the validation of the suggested method, it has been applied to CEC2005 benchmark functions and the simulation results are compared with different existing algorithms. Also, it has been used to determine active earth pressure on retaining wall supporting c-Ф backfill using the pseudo dynamic method. Simulation result shows that the proposed method is suitable to solve such type of problems and the results obtained are found satisfactory.     

Temporal reasoning about fuzzy intervals

Traditional approaches to temporal reasoning assume that time periods and time spans of events can be accurately represented as intervals. Real-world time periods and events, on the other hand, are often characterized by vague temporal boundaries, requiring appropriate generalizations of existing formalisms. This paper presents a framework for reasoning about qualitative and metric temporal relations between vague time periods. In particular, we show how several interesting problems, like consistency and entailment checking, can be reduced to reasoning tasks in existing temporal reasoning frameworks. We furthermore demonstrate that all reasoning tasks of interest are NP-complete, which reveals that adding vagueness to temporal reasoning does not increase its computational complexity. To support efficient reasoning, a large tractable subfragment is identified, among others, generalizing the well-known ORD Horn subfragment of the Interval Algebra (extended with metric constraints).     

Process and Policy: Resource-Bounded NonDemonstrative Reasoning

This paper investigates the appropriateness of formal dialectics as a basis for nonmonotonic reasoning and defeasible reasoning that takes computational limits seriously. Rules that can come into conflict should be regarded as policies, which are inputs to deliberative processes. Dialectical protocols are appropriate for such deliberations when resources are bounded and search is serial.
AI, it is claimed here, is now perfectly positioned to correct many misconceptions about reasoning that have resulted from mathematical logic's enormous success in this century: among them, (1) that all reasons are demonstrative, (2) that rational belief is constrained, not constructed, and (3) that process and disputation are not essential to reasoning. AI mainly provides new impetus to formalize the alternative (but older) conception of reasoning, and AI provides mechanisms with which to create compelling formalism that describes the control of processes.
The technical contributions here are: the partial justification of dialectic based on controlling search; the observation that nonmonotonic reasoning can be subsumed under certain kinds of dialectics; the portrayal of inference in knowledge bases as policy reasoning; the review of logics of dialogue and proposed extensions; and the preformal and initial formal discussion of aspects and variations of dialectical systems with nondemonstrative reasons.