We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/On the Semantics of Arbitration
PeriodicalsMathematics

On the Semantics of Arbitration

Checking your access to this record.

Abstract & Overview

Revision and update operators add new information to some old information represented by a logical theory. Katsuno and Mendelzon show that both revision and update operators can be characterized as accomplishing a minimal change in the old information to accommodate the new information. Arbitration operators add two or more weighted informations together where the weights indicate the relative importance of the informations rather than a strict priority. This paper shows that arbitration operators can be also characterized as accomplishing a minimal change. The operator of model-fitting is also defined and analyzed in the paper.

Cite this record

Peter Zsolt Revesz (1997). On the Semantics of Arbitration. International Journal of Algebra and Computation, 07(02), 133–160. https://doi.org/10.1142/s0218196797000095

Copy in another style

Revesz, P. Z. (1997). On the Semantics of Arbitration. International Journal of Algebra and Computation, 07(02), 133–160. https://doi.org/10.1142/s0218196797000095
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.