Semirings of evidence

被引:1
作者
Baur, Michael [1 ]
Studer, Thomas [1 ]
机构
[1] Univ Bern, Inst Comp Sci, CH-3012 Bern, Switzerland
基金
瑞士国家科学基金会;
关键词
Justification logic; semiring; completeness; realization; LOGICAL OMNISCIENCE; PROVABILITY;
D O I
10.1093/logcom/exab007
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models evidence by a semiring. Hence justification terms can be interpreted as polynomial functions on that semiring. This provides an adequate semantics for evidence terms and clarifies the role of variables in justification logic. Moreover, the algebraic structure makes it possible to compute with evidence. Depending on the chosen semiring this can be used to model trust, probabilities, cost, etc. Last but not least the semiring approach seems promising for obtaining a realization procedure for modal fixed point logics.
引用
收藏
页码:2084 / 2106
页数:23
相关论文
共 40 条
  • [1] Afshari B, 2017, IEEE S LOG
  • [2] Alt J., 2001, LNCS, V2183, P22, DOI [DOI 10.1007/3--540-45504-3_2, 10.1007/3-- 540-45504- 3_2]
  • [3] Putting Lipstick on Pig: Enabling Database-style Workflow Provenance
    Amsterdamer, Yael
    Davidson, Susan B.
    Deutch, Daniel
    Milo, Tova
    Stoyanovich, Julia
    Tannen, Val
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 5 (04): : 346 - 357
  • [4] Amsterdamer Yael, 2011, PODS, P153
  • [5] [Anonymous], 2000, BASIC PROOF THEORY
  • [6] Artemov S., 2019, JUSTIFICATION LOGIC
  • [7] Artemov S., 2009, THEORETICAL ASPECTS, P14, DOI [DOI 10.1145/1562814.1562821, 10.1145/1562814.1562821]
  • [8] The intensional lambda calculus
    Artemov, Sergei
    Bonelli, Eduardo
    [J]. LOGICAL FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, 4514 : 12 - +
  • [9] Artemov S, 2006, LECT NOTES COMPUT SC, V4207, P135
  • [10] Justified common knowledge
    Artemov, Sergei
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 357 (1-3) : 4 - 22