摘要
本文详细介绍了获得智能回溯的两个基本方法:最小不一致演绎树和最大可合一约束集。逻辑程序求解失败时,这两种方法均可分析引起失败的原因,前者在与失败有关的子句空间内进行回溯,后者找出所有可能的回溯点,以便选择最佳回溯点进行回溯。
Two fundamental approaches to intelligent backtrack are described in detail in this paper, that is, the minimum inconsistent deduction tree by Bruynooghe and the maximum unifiable constraint sets by Cox, When the execution of a logic program arrived at a failure, both of the methods analyse the causes of the failure. The former one makes backtrack within the set of clauses relevent to the failure, while the latter one generates all the possible backtracking points to the best point to start.
出处
《计算机工程与设计》
CSCD
北大核心
1989年第3期12-20,共9页
Computer Engineering and Design
