亲属关系的逻辑意义及其自动推理  

Logic meaning of kinship relations and kindred automatic reasoning

作　　者：陈振宇[1] 袁毓林[2] 张秀松[2] 周强[3] 

机构地区：[1]复旦大学中国语言文学系,上海200433 [2]北京大学中文系/汉语语言学研究中心,北京100871 [3]清华大学信息技术研究院语音和语言技术中心,北京100084

出　　处：《计算机工程与应用》2009年第16期43-47,共5页Computer Engineering and Applications

基　　金：国家高技术研究发展计划(863)(No.2007AA01Z173);国家自然科学基金(No.60573185)~~

摘　　要：用一阶谓词逻辑设计了一个亲属关系的自动推理模型。首先,把亲属关系(称谓)视为谓词,相关的人物视为变元,把亲属关系和有关性质用"或"、"与"及"逆"等运算符号联结成亲属关系表达式。然后,选取11种基本的亲属关系作为亲属基元,并构造亲属基元转换和化简的九大定理,用以描写和定义其他一百多种亲属关系,从而形成亲属关系转换的核心知识库。最后,给出一种简洁的亲属关系转换算法,主要包括连接、求逆、化简和组配等运算。Authors designed a kindred automatic reasoning model based on one-order predicate logic.Firstly authors regarded kinship relation as a predicate and the people involved as its variables,and connected the kinship relations and related properties with disjunction,conjunction and converse operators to form expressions of kinship relation.Then authors chose 11 basic kinship relations as a set of kindred atoms and constructed 9 great theorems whereby to derive the definitions of another more than one hundred kinship relations,which worked as a kernel knowledge base for the kindred automatic reasoning model.Finally authors gave a succinct algorithm of kinship relation reasoning,including connection,reverse and simplification operation.

关 键 词：一阶谓词逻辑 亲属关系 自动推理 亲属关系表达式 求逆 化简 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]