Fuzzy Horn Clause(HC) Rules and Its Discovery Algorithm 模糊Horn子句规则及其发现算法
Fuzzy procedural interpretation for f - Horn clause rules and the Fuzzy logic program system are presented. 最后,我们成功地给出了f-Horn子句规则的模糊过程解释,并由此引入了模糊逻辑程序系统。
The simulation and correspondence between Horn clause and context-free grammar make the most efficient algorithm-the Earley Algorithm about context-free grammar applied to the implementation of logical programs. Horn子句和上下文无关方法的相似性、对应性,使上下文无关文法的最有效算法&Earley算法的思想,应用于逻辑程序的实现。
This paper discusses the capabilities and methods rules of Horn clause are expressed in relational algebra and SQL, and points out that deductive rules have a strong affinity to views in relational databases. 本文讨论了关系代数及SQL语言表示Horn子句规则的能力与方法,指出关系数据库的视图与规则有很强的相似性。
This paper contains : the development history of logic programming, logic programming and Horn clause, PROLOG language, the features and the parallelism of logic programming, and also some problems existed in logic programming. 本文包括:逻辑程序设计的发展历史,逻辑程序设计与Horn子句、Prolog语言,逻辑程序设计的特点,逻辑程序的并行性以及逻辑程序设计存在的问题。