摘要
为了解决民法意义上的亲属的结构化表示问题,提出一种可以表示任何亲属的亲属元序列表示法,通过抽象出10种基本的亲属元,可将任意的亲属表示为这些亲属元的有序序列,从而解决了亲属的编码问题及亲属属性判断问题。更重要的是,基于亲属元,构造出了一套非常简洁的亲属求逆和复合运算算法。
For represent relations in civil law, a relation atom sequence for any complicated relations is introduced. By abstract 10 basic relation atoms, any relation is represented in a sequential serial composed of relation atoms. So that it solve relation coding problem and attribution judgment problem. Furthermore, succinct algorithms of relation reverse and complex operation are constructed.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第12期2785-2787,共3页
Computer Engineering and Design
关键词
亲属
亲属元
求逆
复合运算
智能系统
民法
relation
relation atom
reverse
complex
intelligent system
civil law
