This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Basic Mathematical Framework for Conceptual Graphs
February 2006 (vol. 18 no. 2)
pp. 261-271
ASCII Text
x 
 
Philip H.P. Nguyen, Dan Corbett, "A Basic Mathematical Framework for Conceptual Graphs," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 2, pp. 261-271, February, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TKDE.2006.18,
author = {Philip H.P. Nguyen and Dan Corbett},
title = {A Basic Mathematical Framework for Conceptual Graphs},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {18},
number = {2},
issn = {1041-4347},
year = {2006},
pages = {261-271},
doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.18},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - A Basic Mathematical Framework for Conceptual Graphs
IS - 2
SN - 1041-4347
SP261
EP271
EPD - 261-271
A1 - Philip H.P. Nguyen,
A1 - Dan Corbett,
PY - 2006
KW - Index Terms- Graph algorithms
KW - knowledge representation formalisms and methods
KW - ontology design.
VL - 18
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 
Based on the original idea of Sowa on conceptual graph and a recent formalism by Corbett on ontology, this paper presents a rigorous mathematization of basic concepts encountered in the Conceptual Structure Theory, including canon, ontology, conceptual graph, projection, and canonical formation operations, with the aim of deriving their mathematical properties and applying them to future research and development on knowledge representation. Our proposed formalism enhances the Conceptual Structure Theory and enables it to compare favorably with other alternative methods such as the Formal Concept Analysis theory.

[1] J.F. Baget and M.L. Mugnier, “The SG Family: Extensions of Simple Conceptual Graphs,” Proc. 17th Int'l Joint Conf. Artificial Intelligence, pp. 205-210, 2001.
[2] J.F. Baget and M.L. Mugnier, “Extensions of Simple Conceptual Graphs: The Complexity of Rules and Constraints,” J. Artificial Intelligence Research, vol. 16, pp. 425-465, 2002.
[3] M. Chein and M.L. Mugnier, “Conceptual Graphs: Fundamental Notions,” Revue d'Intelligence Artificielle, 1992.
[4] M. Chein and M.L. Mugnier, “Concept Types and Coreference in Simple Conceptual Graphs,” Proc. 12th Int'l Conf. Conceptual Structures, 2004.
[5] D. Corbett, Reasoning and Unification over Conceptual Graphs. New York: Kluwer Academic, 2003.
[6] D. Corbett, “Filtering and Merging Knowledge Bases: A Formal Approach to Tailoring Ontologies,” Revue d'Intelligence Artificielle, special issue on tailored information delivery, pp. 463-481, Sept./Oct. 2004.
[7] M. Croitoru and E. Compatangelo, “A Combinatorial Approach to Conceptual Graph Projection Checking,” Proc. 24th SGAI Int'l Conf. Innovative Techniques and Applications of Artificial Intelligence, Dec. 2004.
[8] M. Croitoru and E. Compatangelo, “On Conceptual Graph Projection,” Technical Report AUCS/TR0403, Univ. of Aberdeen, U.K., 2004.
[9] F. Dau, “Concept Graphs without Negations: Standardmodels and Standardgraphs,” Proc. 11th Int'l Conf. Conceptual Structures, 2003.
[10] B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations. Heidelberg, Germany: Springer, 1996 (German version— English translation, 1999).
[11] B. Ganter and R. Wille, “Applied Lattice Theory: Formal Concept Analysis,” Technical Univ. of Dresden, Germany, 1997, http://www.math.tu-dresden.de/ganter/psfiles concept.ps.
[12] A.J. Greimas, Semantique Structurale: Recherche de Methode. Paris: Ed. Larousse, 1966, (reprinted Nouvelle Edition Paris, 1986), and English translation: Structural Semantics: An Attempt at a Method, Lincoln, Neb.: Univ. of Nebraska Press, 1983.
[13] T. Gruber, “A Translation Approach to Portable Ontology Specifications,” Knowledge Acquisition, vol. 5, no. 2, pp. 199-220, 1993.
[14] I. Kant, Logic, 1800 (in German) and R. Hartman, and W. Schwarz Bobbs-Merrill Company, 1974 (in English), http://www-philosophy.ucdavis.edu/kantCONCEPT.HTM , and http://www-philosophy.ucdavis.edu/kantJUDGMENT.HTM .
[15] G. Kemerling, “Arguments and Inference,” The Philosophy Pages, http://www.philosophypages.com/lge01.htm , 2001.
[16] R. Levinson, “UDS: A Universal Data Structure,” Research Report No. UCSC-CRL-94-15, Univ. of California at Santa Cruz, 1994, http://citeseer.ist.psu.edulevinson94uds.html .
[17] G. Mineau, G. Stumme, and R. Wille, “Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis,” Proc. Seventh Int'l Conf. Conceptual Structures, 1999.
[18] M.L. Mugnier, “Knowledge Representation and Reasonings Based on Graph Homomorphism,” Proc. Eighth Int'l Conf. Conceptual Structures, 2000.
[19] N. Noy and M. Musen, “The PROMPT Suite: Interactive Tools For Ontology Merging and Mapping,” Int'l J. Human-Computer Studies, 2003.
[20] A. Puder and A. Alireza, “Service Type Specification through Conceptual Graphs,” Proc. Workshop Visual Reasoning, Proc. 13th Int'l Conf. Automated Deduction, 1996.
[21] J. Sowa, Conceptual Structures— Information Processing in Mind and Machine. Addison-Wesley, 1984.
[22] J. Sowa, Knowledge Representation: Logical, Philosophical, and Computational Foundations. Pacific Grove, Calif.: Brooks Cole Publishing, 1999.
[23] J. Sowa, “Conceptual Graphs,” draft proposed ISO standard for conceptual graphs, 2001, http://www.jfsowa.com/cgcgstand.htm.
[24] P. Stockinger, “Conceptual Analysis and Knowledge Management,” report from Equippe Semiotique Cognitive et Nouveaux Medias, Maison des Sciences de l'Homme, Paris, 1993.
[25] G. Stumme, “Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge,” Wissensmanagement mit Referenzmodellen— Konzepte für die Anwendungssystem und Organisationsgestaltung, J. Becker and R. Knackstedt, eds., pp. 163-174, Heidelberg: Physica, 2002.
[26] G. Stumme and A. Maedche, “FCA-Merge: Bottom-Up Merging of Ontologies,” Proc. Seventh Int'l Conf. Artificial Intelligence, 2001.
[27] G. Stumme, R. Studer, and Y. Sure, “Towards an Order-Theoretical Foundation for Maintaining and Merging Ontologies,” Univ. of Karlsruhe, Germany, 2000, http://www.aifb.uni-karlsruhe.de/WBS/gst/ papers/2000REFMOD00. pdf.
[28] G. Stumme, R. Wille, and U. Wille, “Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods,” Proc. Second European Symp. Principles of Data Mining and Knowledge Discovery, pp. 450-458, 1998.
[29] M. Wermelinger and J.G. Lopes, “Basic Conceptual Structures Theory,” Proc. Second Int'l Conf. Conceptual Structures, 1994.
[30] R. Wille, “Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts,” Ordered Sets, I. Rival, ed., Boston, Dordrecht: Reidel, 1982.
[31] R. Wille, “Conceptual Graphs and Formal Concept Analysis,” Proc. Fifth Int'l Conf. Conceptual Structures, 1997.
[32] R. Wille, “Why Can Concept Lattices Support Knowledge Discovery in Databases?” Proc. Ninth Int'l Conf. Conceptual Structures, 2001.
[33] Wordnet, V.2.1, Cognitive Science Laboratory, Princeton Univ., http:/wordnet.princeton.edu, 2005.

Index Terms:
Index Terms- Graph algorithms, knowledge representation formalisms and methods, ontology design.
Citation:
Philip H.P. Nguyen, Dan Corbett, "A Basic Mathematical Framework for Conceptual Graphs," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 2, pp. 261-271, Feb. 2006, doi:10.1109/TKDE.2006.18
Usage of this product signifies your acceptance of the Terms of Use.