臺灣博碩士論文加值系統

我們的資料庫，Cadabia，是以Class Algebra為理論基礎，同時使用IS-A hierarchy架構，並提供使用者做Class Algebra的query。類別代數也以物件導向架構為基礎，在類別物件和關係中操作。
我們實做了一個針對query處理的程式，可以將使用者query的字串紀錄下來，同時進行分析、一般化。一般化即是把同一個class 的query用有系統且統一的節點表達出來。藉由我們的程式，我們可以逐一分析在每一個query之間是否有包含的關係，然後可以它們是否有IS-A hierarchy的關係。

Our database, Cadabia, is based on the theory of “Class Algebra”, and it uses an IS-A hierarchy structure which is based on that theory. The Cadabia database also provides queries based on Class Algebra. Class Algebra describes object-oriented structures and operations involving objects and relations.
We have implemented a program that can analyze and normalize the query strings. Normalization represents the query input by systematically adjusting the query into a unique formal form represented by a graph. We can see which queries are subsumed by others, thus arranging class definitions into the IS-A hierarchy.

Chapter 1. Introduction..........................................................................1
1-1 Cadabia...............................................................................................................1
1-2 Goals of SDNF...................................................................................................2
1-3 Outline ...............................................................................................................2
Chapter 2. Background...........................................................................3
2-1 Ontology.............................................................................................................3
2-2 Class Algebra......................................................................................................4
2-2-1 IS-A Hierarchy........................................................................................5
2-2-2 Extents and Intents.................................................................................6
2-2-3 Binary Relations with Domain/Range Declarations..............................9
2-3 SDNF................................................................................................................11
Chapter 3. Algorithm and Approach...........................................13
3-1 Ways to Get the SDNF.....................................................................................13
3-2 Attribute Relation Operators............................................................................14
3-3 True Complement and Pseudo Complement....................................................16
3-4 Algorithm.........................................................................................................21
3-4-1 Subsumption Check..............................................................................23
3-4-2 Simplification.......................................................................................25
3-4-3 Getting Resolvents...............................................................................26
3-5 Explanation of Uniqueness...............................................................................31
Chapter 4. System Implementation...............................................32
4-1 Partially ordered sets........................................................................................32
4-2 Program Interface.............................................................................................34
Chapter 5. Conclusions and Future Work................................37
5-1 Conclusions......................................................................................................37
5-2 Future Work......................................................................................................37
References............................................................................................................39

[1] Buehrer and Tzu-Yang Wang, "The Cadabia Database Project", The 14thWorkshop on Object-Oriented Techmology and Applications, Ywan Jr University, Jung Li, Sept. 12, 2003, pp.385-92
[2] Buehrer and Li-Ren Chien, "Knowledge Creation Using Class Algebra", IEEE NLP-KE 2003, Beijing, China, Oct. 26-29, 2003, pp.108-113
[3] Buehrer and Li-Ren Chien, Reasoning with Class Algebra", Proceedings of IASTED International Conference on Neural Networks and Computational Intelligence (accepted), Grindewald, Switzerland, Feb. 23-25, 2004.
[4] D.J. Buehrer, "An Object-Oriented Class Algebra", in Proceedings of ICCI '95: 7th International Conference on Computing and Information, Peterborough, Ontario, Canada, July 5-8, 1995, pp.669-685.
[5] IEEE Standard Upper Ontology Working Group (SUO WG) http://suo.ieee.org/
[6] Ontology Works Incorporated http://ontologyworks.com/what_is_ontology.php
[7] Buehrer and Chee-Hwa Lee, "Class Algebra for Ontology Reasoning", Proc. of TOOLS Asia 99 (Technology of Object-Oriented Languages and Systems, 31st International Conference), IEEE Press, Nanjing, China, Sept. 22-25, pp.2-13
[8] Paul E. van der Vet and Nicolaas J.I. Mars, “Bottom-Up Construction Ontologies”, IEEE Transactions on Knowledge and data Engineering, Vol. 10, No. 4, July/August, 1998, pp.513-526.
[9] Disjunctive Normal Form http://wiki.tcl.tk/14060
[10] Lo Tse-Win, “An Implementation of a Class Algebra Database Server”, A thesis submitted to Institute of Computer Science and Information Engineering College of Engineering, National Chung Cheng University, Taiwan, June, 2001.
[11] Huang Sheng-Yuan, “A Semantic Web Middle Layer”, A thesis submitted to Institute of Computer Science and Information Engineering College of Engineering, National Chung Cheng University, Taiwan, June, 2004.
[12] Randall Davis and Douglas B. Lenat, Knowledge-Based Systems in Artificial Intelligence, McGraw-Hill, Inc., New York, 1982.
[13] Buehrer, Daniel J., “Class Algebra as a Description Logic”, International Description Logic Workshop, Boston, AAAI Press Tech. Report WS-96-05, Nov. 2-4, 1996, pp.92-96.
[14] Java Platform, Standard Edition, JDK 5.0 Documentation
http://java.sun.com/j2se/1.5.0/docs/api/index.html
[15] propositional resolution http://logic.stanford.edu/classes/cs157/2005fall/notes/chap05.pdf