| « | September 2025 | » | | 日 | 一 | 二 | 三 | 四 | 五 | 六 | | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | | | | | |
|
公告 |
| 暂无公告... |
| Blog信息 |
|
blog名称:
日志总数:7
评论数量:0
留言数量:0
访问次数:21269
建立时间:2005年9月18日 |
| |
|
 [语义网学习]描述逻辑手册电子版的第二章中命题2.9证明
原创空间
pascal1977 发表于 2006/1/4 12:32:11 |
| 证明不一定正确，只是个人理解。500)this.width=500'>未命名.bmp
we associate to a terminology T a dependency graph GT , whose nodes are the name symbols in T . If T contains the axiom A ‘ C, then for every occurrence of thename symbol A0 in C, there is an arc from A to A0 in GT . Arcs are labeled as positive and negative. The arc from A to A0 is positive if A0 occurs in C in the scope of an even number of negations, and it is negative if A0 occurs in the scope of an odd number of negations. A sequence of nodes A1; : : : ;An is a path if there is an arc in GT from Ai to Ai+1 for all i = 1;...... ; n-1. A path is a cycle if A1 = An.
Proposition 2.9 Let T be a terminology such that each cycle in GT contains aneven number of negative arcs. Then T is monotone. |
|
|