Semirings of Evidence

Baur, Michael; Studer, Thomas (April 2020). Semirings of Evidence. In: Dastani, Mehdi; Dong, Huimin; van der Torre, Leon (eds.) Logic and Argumentation. International Conference, CLAR 2020, Proceedings. Lecture Notes in Computer Science: Vol. 12061 (pp. 42-57). Springer 10.1007/978-3-030-44638-3_3

[img] Text
se.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (265kB) | Request a copy

In traditional justification logic, evidence terms have the syn-tactic form of polynomials, but they are not equipped with the corre-sponding algebraic structure. We present a novel semantic approach tojustification logic that models evidence by a semiring. Hence justificationterms can be interpreted as polynomial functions on that semiring. Thisprovides an adequate semantics for evidence terms and clarifies the roleof variables in justification logic. Moreover, the algebraic structure makesit possible to compute with evidence. Depending on the chosen semiringthis can be used to model trust, probabilities, cost, etc. Last but notleast the semiring approach seems promising for obtaining a realizationprocedure for modal fixed point logics

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF) > Logic and Theory Group (LTG)
08 Faculty of Science > Institute of Computer Science (INF)

UniBE Contributor:

Baur, Michael and Studer, Thomas

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

ISBN:

978-3-030-44637-6

Series:

Lecture Notes in Computer Science

Publisher:

Springer

Language:

English

Submitter:

Atefeh Rohani

Date Deposited:

02 Sep 2020 09:12

Last Modified:

02 Sep 2020 09:12

Publisher DOI:

10.1007/978-3-030-44638-3_3

BORIS DOI:

10.7892/boris.146172

URI:

https://boris.unibe.ch/id/eprint/146172

Actions (login required)

Edit item Edit item
Provide Feedback