• Aucun résultat trouvé

A Little Logic Goes a Long Way - Logical Reasoning in Web Data Integration and Ontology Learning

N/A
N/A
Protected

Academic year: 2022

Partager "A Little Logic Goes a Long Way - Logical Reasoning in Web Data Integration and Ontology Learning"

Copied!
1
0
0

Texte intégral

(1)

A Little Logic Goes a Long Way – Logical Reasoning in Web Data Integration and

Ontology Learning

Heiner Stuckenschmidt

Universit¨at Mannheim heiner@informatik.uni-mannheim.de

There is an ongoing dispute in the Semantic Web Community about the use- fulness of (Description) Logic as a basis for describing data on the web. While researchers in logic argue with the benefits of logic in terms of a clean seman- tics and richness of the language, criticism against the use of logic normally focusses on two points: its computational complexity and its inability to rep- resent soft constraints. In this talk, we will address these criticisms and argue that if used in the right way description logics are a valuable tool for typical tasks on the semantic web. We use problem of semantic matchmaking as an example to show that the use of rather inexpressive logics with good computa- tional properties already provide significant benefits by eliminating incoherent matches. In the second part of the talk we address the problem of dealing with soft constraints and show two solutions to this problem that have proven use- ful for matchmaking: Approximate subsumption as a purely logical framework for partial matchmaking and Log-Linear Description Logics as a new combina- tion of Description Logics with (log-linear) probabilistic models. We show that purely logical matchmaking achieves results comparable with state of the art matchmaking systems that rely on similarity functions and present results that show that log-linear description logics outperform existing matching systems.

We conclude that in the context of semantic web applications expressive power of the logics used is less important than the integration with other formalisms and technologies for improving efficiency and the ability to deal with imperfect knowledge.

Références

Documents relatifs

The Condorcet paradox also consists of observing that a certain operation applied to certain objects (individual opinions in the form of preference judgments) gives

ProjMap AtomMap GuardedMap CQMap IncDep PSpace ExpTime 2ExpTime 2ExpTime. LTGD ExpTime ExpTime 2ExpTime 2ExpTime GTGD 2ExpTime 2ExpTime 2ExpTime 2ExpTime FGTGD 2ExpTime

Let X be a n-dimensional compact Alexandrov space satisfying the Perel’man conjecture. Let X be a compact n-dimensional Alexan- drov space of curvature bounded from below by

In this paper a method – assisted by Automated Reasoning Systems – to solve a subproblem, the merging of ontologies, is presented.. A case study of application is drawn from the field

During this 1906 visit, Rinpoche’s father met the 8 th Khachoed Rinpoche, Drupwang Lungtok Tenzin Palzangpo of Khachoedpalri monastery in West Sikkim, and from

This tutorial introduces to Inductive Logic Programming (ILP), being it a major logic-based approach to rule learning, and sur- veys extensions of ILP that turn out to be suitable

- We prove the existence of a minimizer for a multidimen- sional variational problem related to the Mumford-Shah approach to computer vision.. Key words :

(Of course the two ‘almost everywheres’ in this statement refer to ( n − 1 ) - and n-dimensional measure respectively.) We give the proof of Theorem 2.1 in the stated case in which