逻辑程序语言的智能控制策略

Intelligent Control Strategy of Logic Programming languages

本文试图对逻辑程序语言的控制问题提出一个解决办法。本文从 Kowalski 的most showing,least finding 原则出发,通过一个谓词复杂性函数及简单的智能回溯方法的描述,提出一个谓词复杂性最小和智能回溯的控制策略。

In this paper,a method to solve the control problem of logic programming languages is given and discussed in detail.To begin with the principle of“most showing and least finding”(by Kowalski),We describe in detail a heuristic function to measure the complexity of a predicate and a simple method of intellgent backtracking.Finally,art intelligent control strategy of logic programming languages,which is based on the principle of minimum complexity of predicate and intelligent backtracking,is proposed.Several existing problems are then discussed.