摘要
自动推理是人工智能研究的一个重要内容,基于归结原理的自动推理是自动推理研究的重要分支。基于语言真值格蕴涵代数的格值逻辑系统能处理带有可比较项和不可比较项的信息或知识,为自动推理研究提供了严格的逻辑基础。给出了语言真值格蕴涵代数LV(n×2)的一些性质,在基于十八元语言真值格蕴涵代数LV(9×2)的格值命题逻辑系统LV(9×2)P(X)框架下,刻画了1-IESF和2-IESF型对应广义文字的结构,给出了其广义文字的可归结性。这些工作将为基于语言真值格值逻辑系统的归结自动推理提供重要的研究基础。
Automated reasoning is an important realm in artificial intelligence. Resolution-based automated reasoning is one of the research branches. Lattice-valued logic system based on lattice implication algebra can deal with information or knowledge with comparability and incomparability, provide a stick logical foundation for automated reasoning. The present paper gave some properties of linguistic truth-valued lattice implication algebra ~v（n^2）. Under lattice-valued propositional logic system 2F-v（g^2）P（X）based on linguistic truth-valued lattice implication algebra Afv（92）with eighteen elements, the structures of generalized literals about 1-IESF and 2-IESF were given. In addition, the resolution determi- nation of generalized literals was obtained. These works can offer an important foundation for automated reasoning based on linguistic truth-valued lattice-valued logic system.
出处
《计算机科学》
CSCD
北大核心
2013年第2期237-240,273,共5页
Computer Science
基金
国家自然科学基金(61175055)
国家自然科学青年基金项目(61100046)
河南工业大学高层次人才基金项目(2012BS012)资助
关键词
自动推理
格值逻辑系统
语言真值格蕴涵代数
广义文字
归结
Automated reasoning, Lattice-valued logic system, Linguistic truth-valued lattice implication algebra, Genera-lized literal, Resolution
