Abstract
We present an approach to representation and structuring of theories and ontologies based on a formalism of propositional logic programs. Formal concept analysis is adopted to identify structure in theories. This structure, in the form of conjunctive concepts and the relations between them, is used for representation change in theories based on feature construction and iterative program transformation. Ontologies are represented as sets of propositional definite clauses containing named concepts having a superclass–subclass relationship derived from a concept lattice built using formal concept analysis. Logic programming methods are used to incrementally construct and revise such ontologies. An information compression measure is used to guide the operation of structuring theories and ontologies. The clauses defining the ontology are proved to preserve the relationships which hold between formal concepts in the concept lattice. This framework enables inheritance inference not possible from the structured theories alone. Experimental results are presented from an application to a sample of descriptions of computer science academics’ research interests and a reconstruction experiment on randomly generated theories with added noise.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bain, M.: Structured Features from Concept Lattices for Unsupervised Learning and Classification. In: McKay, B., Slaney, J.K. (eds.) Canadian AI 2002. LNCS (LNAI), vol. 2557, pp. 557–568. Springer, Heidelberg (2002)
Foo, N.: Ontology Revision. In: Ellis, G., Levinson, R., Rich, W., Sowa, J. (eds.) ICCS 1995. LNCS (LNAI), vol. 954, pp. 1–14. Springer, Heidelberg (1995)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)
Hogger, C.J.: Essentials of Logic Programming. Clarendon Press, Oxford (1990)
Kim, M., Compton, P.: Incremental Development of Domain-Specific Document Retrieval Systems. In: Handschuh, S., Dieng-Kuntz, R., Staab, S. (eds.) Proceedings of the First International Conference on Knowledge Capture, Calgary, University of Calgary, pp. 69–77 (2001)
Kwok, R.: Formalising Aspects of Theoretical Term Usage. PhD thesis, University of Sydney, Sydney, Australia (1998)
Lloyd, J.W.: Logic Programming, 2nd edn. Springer, Berlin (1987)
Muggleton, S.: Inverse Entailment and Progol. New Generation Computing 13, 245–286 (1995)
Fridman Noy, N., McGuinness, D.L.: Ontology Development 101: A Guide to Creating Your First Ontology. Technical Report KSL-01-05, Knowledge Systems Laboratory, Stanford University, CA (2001)
Richards, T.: Clausal Form Logic: An Introduction to the Logic of Computer Reasoning. Addison-Wesley, Wokingham (1989)
Roychoudhury, A., Kumar, K.N., Ramakrishnan, C.R., Ramakrishnan, I.V.: Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. International Journal on Foundations of Computer Science 13(3), 387–403 (2002)
Schultze-Kremer, S.: Ontologies for Molecular Biology. Pacific Symposium on Biocomputing 3, 693–704 (1998)
Zupan, B.: Machine learning based on function decomposition. PhD thesis, University of Ljubljana, Slovenia (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bain, M. (2003). Inductive Construction of Ontologies from Formal Concept Analysis. In: Gedeon, T.(.D., Fung, L.C.C. (eds) AI 2003: Advances in Artificial Intelligence. AI 2003. Lecture Notes in Computer Science(), vol 2903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24581-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24581-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20646-0
Online ISBN: 978-3-540-24581-0
eBook Packages: Springer Book Archive