摘要
提出了信念格上的多值非循环有限自动机并给出了特征和的算法，分别与 Ｒｏｕｎｄｓ Ｋａｓｐｅｒ和 Ｄａｗａｒ Ｓｈａｎｋｅｒ 的非循环有限自动机相比较，这一理论扩展了自然语言语义运算的能力。定义了最小不相容特征描述逻辑和它的语义，并为该逻辑提供了一个充分且完备的证明系统。最后，证明了最小不相容特征描述逻辑的可满足性问题是 Ｎ
Feature 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.
出处
《北京大学学报（自然科学版）》
CAS
CSCD
北大核心
1999年第5期589-601,共13页
Acta Scientiarum Naturalium Universitatis Pekinensis
关键词
信念格
有限自动机
蕴涵
特征和
多值特征结构
belief lattice
multiple\|valued acyclic finite autom aton
subsumption
feature sum
minimally inconsistent feature description logic
