Abstract
Proposing a certain notion of logical completeness as a novel quality criterion for ontologies, we identify and characterise a class of logical propositions which naturally extend domain and range restrictions commonly known from diverse ontology modelling approaches. We argue for the intuitivity of this kind of axioms and show that they fit equally well into formalisms based on rules as well as ones based on description logics. Extending the attribute exploration technique from formal concept analysis (FCA), we present an algorithm for the efficient interactive specification of all axioms of this form valid in a domain of interest. We compile some results that apply when role hierarchies and symmetric roles come into play and demonstrate the presented method in a small example.
This work is supported by the Deutsche Forschungsgemeinschaft (DFG) under the ReaSem project. We furthermore thank Pascal Hitzler and Johanna Völker for their valuable comments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., et al. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
Horrocks, I., Patel-Schneider, P.F.: A proposal for an OWL rules language. In: Proc. of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 723–731. ACM, New York (2004)
McGuinness, D., v. Harmelen, F.: OWL Web Ontology Language Overview. W3C Recommendation (February 10, 2004), http://www.w3.org/TR/owl-features/
Ministry of Law and Justice, Government of India: The Child Marriage Restraint Act. Act No. 19 of 1929 (1929), http://indiacode.nic.in
Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for horn description logics. In: Proceedings of AAAI 2007. LNCS (LNAI), Springer, Heidelberg (2007)
Grosof, B., et al.: Description logic programs: Combining logic programs with description logics. In: Proc. of the International World Wide Web Conference (WWW 2003), pp. 48–57. ACM, New York (2003)
Busch, W.: Die fromme Helene. Diogenes (2003)
Ganter, B.: Two basic algorithms in concept analysis. Technical Report 831, FB4, TH Darmstadt (1984)
Burmeister, P.: Merkmalimplikationen bei unvollständigem Wissen. In: Lex, W. (ed.) Arbeitstagung Begriffsanalyse und Künstliche Intelligenz, TU Clausthal, pp. 15–46 (1991)
Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science 217, 215–233 (1999)
Prediger, S.: Terminologische Merkmalslogik in der formalen Begriffsanalyse. In: Stumme, G., Ganter, B. (eds.) Begriffliche Wissensverarbeitung: Methoden und Anwendungen, pp. 99–124. Springer, Heidelberg (2000)
Baader, F.: Computing a minimal representation of the subsumption lattice of all conjunctions of concepts defined in a terminology. In: Proceedings of KRUSE 1995, Santa Cruz, USA, pp. 168–178 (1995)
Rudolph, S.: An FCA method for the extensional exploration of relational data. In: Ganter, B., de Moor, A. (eds.) Using Conceptual Structures, Contributions to ICCS 2003, Dresden, Germany, Shaker, Aachen, pp. 197–210 (2003)
Rudolph, S.: Relational Exploration - Combining Description Logics and Formal Concept Analysis for Knowledge Specification. Universitätsverlag Karlsruhe, Dissertation (2006)
Baader, F., et al.: Completing description logic knowledge bases using formal concept analysis. In: Veloso, M.M. (ed.) IJCAI, pp. 230–235 (2007)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York (1997)
Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Log. Program. 1, 267–284 (1984)
Maier, D.: The Theory of Relational Databases. Computer Science Press (1983)
Guigues, J.L., Duquenne, V.: Familles minimales d’implications informatives resultant d’un tableau de données binaires. Math. Sci Humaines 95, 5–18 (1986)
Zickwolff, M.: Rule Exploration: First Order Logic in Formal Concept Analysis. PhD thesis, FB4, TH Darmstadt (1991)
Ganter, B., Rudolph, S.: Formal concept analysis methods for dynamic conceptual graphs. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 143–156. Springer, Heidelberg (2001)
Rudolph, S.: Exploring relational structures via FLE. In: Wolff, K.E., Pfeiffer, H.D., Delugach, H.S. (eds.) ICCS 2004. LNCS (LNAI), vol. 3127, pp. 196–212. Springer, Heidelberg (2004)
Rudolph, S., Völker, J., Hitzler, P.: Supporting lexical ontology learning by relational exploration. In: Hill, R., Polovina, S., Priss, U. (eds.) Proceedings of ICCS 2007. LNCS (LNAI), Springer, Heidelberg (2007)
Ganter, B.: Finding closed sets under symmetry. Technical Report 1307, FB4, TH Darmstadt (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rudolph, S. (2008). Acquiring Generalized Domain-Range Restrictions. In: Medina, R., Obiedkov, S. (eds) Formal Concept Analysis. ICFCA 2008. Lecture Notes in Computer Science(), vol 4933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78137-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-78137-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78136-3
Online ISBN: 978-3-540-78137-0
eBook Packages: Computer ScienceComputer Science (R0)