Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Metabolic Pathways as Temporal Logic Programs Read chapter Read first chapter

2016 | OriginalPaper | Chapter

Approximate Unification in the Description Logic \(\mathcal {FL}_0\)

Authors : Franz Baader, Pavlos Marantidis, Alexander Okhotin

Published in: Logics in Artificial Intelligence

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Unification in description logics (DLs) has been introduced as a novel inference service that can be used to detect redundancies in ontologies, by finding different concepts that may potentially stand for the same intuitive notion. It was first investigated in detail for the DL \(\mathcal {FL}_0\), where unification can be reduced to solving certain language equations. In order to increase the recall of this method for finding redundancies, we introduce and investigate the notion of approximate unification, which basically finds pairs of concepts that “almost” unify. The meaning of “almost” is formalized using distance measures between concepts. We show that approximate unification in \(\mathcal {FL}_0\) can be reduced to approximately solving language equations, and devise algorithms for solving the latter problem for two particular distance measures.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Hilbert-Style Axiomatization for Hybrid XPath with Data
next chapter Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis
Footnotes
1
In the first line below we assume, as usual, that \(\min \emptyset = \infty \) and \(2^{-\infty } = 0\).
 
2
An ILTA \((\varSigma , Q, Q_0, \delta )\) is trim if every state is reachable from an initial state and \(\delta (q,a) \ne \emptyset \) for all \(q\in Q, a\in \varSigma \).
 
Literature
1.
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press (2003)
2.
3.
Baader, F., Marantidis, P., Okhotin, A.: Approximately solving set equations. In: Ghilardi, S., Schmidt-Schauß, M. (eds.) Proceedings of the 30th International Workshop on Unification (UNIF 2016), Porto (2016)
4.
5.
6.
Baader, F., Okhotin, A.: On language equations with one-sided concatenation. Fundamenta Informaticae 126(1), 1–35 (2013)MathSciNetMATH
7.
Baader, F., Tobies, S.: The inverse method implements the automata approach for modal satisfiability. In: Goré, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 92–106. Springer, Heidelberg (2001). doi:10.​1007/​3-540-45744-5_​8 CrossRef
8.
Banach, S.: Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundamenta Mathematicae 3(1), 133–181 (1922)MATH
9.
Ecke, A., Peñaloza, R., Turhan, A.-Y.: Computing role-depth bounded generalizations in the description logic \(\cal {ELOR}\). In: Timm, I.J., Thimm, M. (eds.) KI 2013. LNCS (LNAI), vol. 8077, pp. 49–60. Springer, Heidelberg (2013). doi:10.​1007/​978-3-642-40942-4_​5 CrossRef
10.
11.
Kapur, D., Narendran, P.: Complexity of unification problems with associative-commutative operators. J. Autom. Reason. 9, 261–288 (1992)MathSciNetCrossRefMATH
12.
Kreyszig, E.: Introductory Functional Analysis With Applications. Wiley, New York (1978). Wiley Classics LibraryMATH
13.
14.
Lehmann, K., Turhan, A.-Y.: A framework for semantic-based similarity measures for \(\cal {ELH}\)-concepts. In: Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS (LNAI), vol. 7519, pp. 307–319. Springer, Heidelberg (2012). doi:10.​1007/​978-3-642-33353-8_​24 CrossRef
15.
Munkres, J.: Topology. Featured Titles for Topology Series. Prentice Hall, Upper Saddle River (2000)MATH
16.
Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1999)MATH
17.
Tongphu, S., Suntisrivaraporn, B.: On desirable properties of the structural subsumption-based similarity measure. In: Supnithi, T., Yamaguchi, T., Pan, J.Z., Wuwongse, V., Buranarach, M. (eds.) JIST 2014. LNCS, vol. 8943, pp. 19–32. Springer, Heidelberg (2015). doi:10.​1007/​978-3-319-15615-6_​2 CrossRef
Metadata
Title
Approximate Unification in the Description Logic
Authors
Franz Baader
Pavlos Marantidis
Alexander Okhotin
Copyright Year
2016
Book
Logics in Artificial Intelligence

Print ISBN: 978-3-319-48757-1

Electronic ISBN: 978-3-319-48758-8

Copyright Year: 2016

DOI
https://doi.org/10.1007/978-3-319-48758-8_4

Premium Partner

    Image Credits