期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
基于模糊逻辑的不确定知识处理(Ⅱ)─—模糊逻辑的TABLEAU推理 被引量:1
1
作者 程晓春 刘叙华 《计算机学报》 EI CSCD 北大核心 1996年第12期931-940,共10页
本文基于TABLEAU方法,给出了模糊逻辑中一些至今缺少有效证明论的推理关系的证明论,也给出了作者提出的模糊择优蕴涵的判定过程.据此说明了Yager所给出的推理规则对其所讨论的模糊推理关系是不完备的.分析了本文对前提... 本文基于TABLEAU方法,给出了模糊逻辑中一些至今缺少有效证明论的推理关系的证明论,也给出了作者提出的模糊择优蕴涵的判定过程.据此说明了Yager所给出的推理规则对其所讨论的模糊推理关系是不完备的.分析了本文对前提和结论分别构造TABLEAU推理树的方法在研究推理关系的相关性等方面的直观语义和作为模糊Prolog的推理机所具有的优越性. 展开更多
关键词 模糊蕴涵 tableau法 模糊逻辑 不确定知识处理
下载PDF
Clause-based enhancing mode for tableau algorithm for ALCN
2
作者 古华茂 石锦芹 高济 《Journal of Southeast University(English Edition)》 EI CAS 2008年第3期361-364,共4页
As the tableau algorithm would produce a lot of description overlaps when judging the satisfiabilities of concepts(thus wasting much space),a clause-based enhancing mode designed for the language ALCN is proposed.Th... As the tableau algorithm would produce a lot of description overlaps when judging the satisfiabilities of concepts(thus wasting much space),a clause-based enhancing mode designed for the language ALCN is proposed.This enhancing mode constructs a disjunctive normal form on concept expressions and keeps only one conjunctive clause,and then substitutes the obtained succinctest conjunctive clause for sub-concepts set in the labeling of nodes of a completion tree constructed by the tableau algorithm (such a process may be repeated as many times as needed).Due to the avoidance of tremendous descriptions redundancies caused by applying ∩- and ∪-rules of the ordinary tableau algorithm,this mode greatly improves the spatial performance as a result.An example is given to demonstrate the application of this enhancing mode and its reduction in the cost of space. Results show that the improvement is very outstanding. 展开更多
关键词 tableau algorithm enhancing mode CLAUSE SATISFIABILITY
下载PDF
模态逻辑D演绎过程的化简规则
3
作者 程晓春 孙吉贵 刘叙华 《吉林大学自然科学学报》 CAS CSCD 1995年第2期39-43,共5页
以分析模态逻辑中文字公式的极性为基础,将经典逻辑的Davis-putnam纯文字化简规则推广到了命题模态逻辑D系统的自动演绎中,并给出了一些刻划D逻辑自动演绎特征的化简规则,这些化简规则通过对公式、子公式和公式集的有... 以分析模态逻辑中文字公式的极性为基础,将经典逻辑的Davis-putnam纯文字化简规则推广到了命题模态逻辑D系统的自动演绎中,并给出了一些刻划D逻辑自动演绎特征的化简规则,这些化简规则通过对公式、子公式和公式集的有效性(或不可满足性)的有条件的判断,进行证明过程的剪枝和化简,以提高D逻辑自动演绎的效率;这些化简规则都是依据公式(集)本身的结构特征,可用于D逻辑的任意一种推理实现系统,在机器上是容易实现的。 展开更多
关键词 模态逻辑D系统 化简规则 自动演绎 tableau法
下载PDF
Fuzzy description logic based on vague sets
4
作者 马宗民 王海龙 +1 位作者 严丽 赵法信 《Journal of Southeast University(English Edition)》 EI CAS 2007年第3期399-402,共4页
To enable the representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called vague ALC which is based on vague sets is present... To enable the representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called vague ALC which is based on vague sets is presented. The definition of vague set is introduced and then the syntax and semantics of vague ALC are formally defined. The forms of axioms and assertions in the vague ALC knowledge bases are specified. Finally, the tableau algorithm is developed for the reasoning in the vague ALC. The vague ALC based on vague set uses two degrees of membership instead of a single membership degree in the fuzzy sets and is more accurate in representing the imprecision in the degrees of membership. The vague ALC has more expressive power than ALC and can represent fuzzy knowledge and perform reasoning tasks based on them. Therefore, the vague ALC can enable the representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web. 展开更多
关键词 semantic web description logic fuzzy logic vague sets tableau algorithm
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部