(Enter summary)
Abstract: : Katsuno and Mendelzon divide theory change, the problem of
adding new information to a logical theory, into two types: revision and update.
We propose a third type of theory change: arbitration. The key idea is the following:
the new information is considered neither better nor worse than the old
information represented by the logical theory. The new information is simply one
voice against a set of others already incorporated into the logical theory. From
this follows that arbitration should... (Update)
Context of citations to this paper: More
...one that makes behaviour di erences between the families. The three families stated next are well known, the family has been used in [Rev93, Rev97] the family in [Rev97, LM99, KP99] and the 4 family in [KP98, KP99] De nition 4 Let be a knowledge set, I be an...
.... of combining possibly inconsistent pieces of information, known as merging, has started to receive more attention recently [7, 1, 2, 5, 6, 13, 12, 15]. In this paper we propose a framework for the modelling of merging operations. The proposal has its roots in the work of Spohn...
Cited by: More
Two Approaches to Merging Knowledge Bases - James Delgrande And
(Correct)
A Negotiation-Style Framework for Non-Prioritised Revision - Booth (2001)
(Correct)
Repairing Inconsistent Databases: A.. - Arieli, Denecker, ..
(Correct)
Similar documents (at the sentence level):
18.3%: On the Semantics of Arbitration - Revesz (1995)
(Correct)
Similar documents based on text: More All
0.4: Arbitration: A Commutative Operator for Belief Revision - Liberatore, Schaerf (1995)
(Correct)
0.4: The Impact of Link Arbitration on Switch Performance - Marius Pirvu Laxmi (1999)
(Correct)
0.4: On the Logic of Merging - Konieczny, Pino-Pérez (1998)
(Correct)
Related documents from co-citation: More All
13: Propositional knowledge base revision and minimal change (context) - Katsuno, Mendelzon - 1991
13: atore and M. Schaerf. Arbitration (or How to Merge Knowledge Bases (context) - Liber - 1998
11: the logic of merging
- ebastien, Ram et al. - 1998
BibTeX entry: (Update)
P. Z. Revesz. On the semantics of theory change: Arbitration between old and new information. Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 71--82, 1993. http://citeseer.ist.psu.edu/revesz93semantics.html More
@inproceedings{ revesz93semantics,
author = "Peter Z. Revesz",
title = "On the Semantics of Theory Change: Arbitration Between Old and New Information",
pages = "71--82",
year = "1993",
url = "citeseer.ist.psu.edu/revesz93semantics.html" }
Citations (may not include all citations):
1
follows because if / is unsatisfiable (context) - Axiom
1
Assume now that there is a theory change operator that satis.. (context) - Hence, implies et al.
1
is satisfiable then / ffi (context) - If
1
Then note that / 1 implies (context) - Let, above
1
OE implies / ffi (context) - ffi
1
OE implies / \Pi (context) - Pi
1
Hence assume that both are satisfiable (context) - to, the et al.
1
and I 62 Min (context) - that, Mod
1
there is some model J in Mod (context) - Assume, Mod et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cse.unl.edu/~revesz/html): More
Knowledgebase Transformations - Grahne, Mendelzon, Revesz (1992)
(Correct)
Problem Solving in the DISCO Constraint Database System - Revesz
(Correct)
A Closed Form Evaluation For Datalog Queries With Integer.. - Revesz (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC