On the semantics of arbitration

被引:112
作者
Revesz, PZ [1 ]
机构
[1] UNIV NEBRASKA,DEPT COMP ENGN & SCI,LINCOLN,NE 68588
关键词
D O I
10.1142/S0218196797000095
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:133 / 160
页数:28
相关论文
共 40 条
  • [1] ABITEBOUL S, 1990, PROCEEDINGS OF THE NINTH ACM SIGACT-SIGMOD-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, P218, DOI 10.1145/298514.298575
  • [2] ABITEBOUL S, 1985, 11TH P INT C VER LAR, P1
  • [3] ON THE LOGIC OF THEORY CHANGE - PARTIAL MEET CONTRACTION AND REVISION FUNCTIONS
    ALCHOURRON, CE
    GARDENFORS, P
    MAKINSON, D
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (02) : 510 - 530
  • [4] BANCILHON F, 1981, ACM T DATABASE SYST, V4, P557
  • [5] Baral C., 1992, Computational Intelligence, V8, P45, DOI 10.1111/j.1467-8640.1992.tb00337.x
  • [6] Baral C., 1991, IEEE Transactions on Knowledge and Data Engineering, V3, P208, DOI 10.1109/69.88001
  • [7] BENCZUR A, 1995, P 4 S PROGR LANG SOF, P404
  • [8] BENCZUR A, IN PRESS CLASSICAL W
  • [9] HYPOTHETICAL DATALOG - COMPLEXITY AND EXPRESSIBILITY
    BONNER, AJ
    [J]. THEORETICAL COMPUTER SCIENCE, 1990, 76 (01) : 3 - 51
  • [10] BORGIDA A, 1985, ACM T DATABASE SYST, V10, P563