检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《北京大学学报(自然科学版)》1999年第5期589-601,共13页Acta Scientiarum Naturalium Universitatis Pekinensis
摘 要:提出了信念格上的多值非循环有限自动机并给出了特征和的算法,分别与 Rounds Kasper和 Dawar Shanker 的非循环有限自动机相比较,这一理论扩展了自然语言语义运算的能力。定义了最小不相容特征描述逻辑和它的语义,并为该逻辑提供了一个充分且完备的证明系统。最后,证明了最小不相容特征描述逻辑的可满足性问题是 NFeature structures are used in represention of linguistic knowledge.Rounds and K asper proposed the acyclic finite automaton to describe the feature structures ( f\|structures) on which Rounds\|Kasper Logic is defined.Later,several persons pr oposed various logics that include negation in Rounds\|Kasper\|like framework.In this article,a description of multiple\|valued feature structures based on beli ef lattice is established,which extends the ability of semantic operations.Then ,Minimally Inconsistent Feature Description Logic and its semantics are defined. W e also showed some properties of them.Finally,we presented a sound and complete proof system for our logic and a theorem of NP\|completeness.
分 类 号:TP301.1[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249