• Aucun résultat trouvé

Revising Ontologies

N/A
N/A
Protected

Academic year: 2022

Partager "Revising Ontologies"

Copied!
1
0
0

Texte intégral

(1)

Revising Ontologies

Renata Wassermann

Computer Science Department, University of S˜ao Paulo, Brazil [email protected]

Abstract. In this talk, I will first summarize our work in the last 10 years on adapting AGM style Belief Revision to deal with Description Logics. The usual AGM representation results depend on many assump- tions on the underlying logics which do not hold for DLs. We have char- acterized contraction and revision for DLs, providing constructions, sets of rationality postulates and representation theorems for belief bases and belief sets. In the second part, I will present some experimental results with OWL and discuss current efforts on bridging the gap between theory and practice.

Références

Documents relatifs

The main idea and benefit of belief graphical models is factoring a joint uncertainty measure in the form of a combination of local measures thanks to independence relations that

traditional partial meet contraction on belief bases closed by a consequence operation that is between the classical consequence operator and the identity (i.e., the base

I If the set of beliefs is already consistent with the new information, then the review coincides with expansion, but if new knowledge is inconsistent with any previous beliefs,

From the revision point of view, our voting example consists of three candidate options a, b and c and several voters who express their total preferences regarding these options..

The method involves determining a rep- resentative set of ‘boundary’ probability distributions consistent with the current belief base, revising each of these probability

In so doing, we will then also need to code the machinery that computes the overall < from each of the individual voter’s preference relations. This could be done either by a set

ت نم لك راذنإ نىعبم ،ماعلا عدرلا في تلثتم تيلا ةبوقعلا فادهلأ اقيقتح ،ءاوس دح ىلع ينمرلمجا هل لوس باقعلبا ديدهتلا قيرط نع هيلع موكلمحا هيف راس يذلا وحنلا

The first method finds a single representative belief state through maximum entropy inference and the second method revises boundary belief states using minimum cross-entropy