Subset models for justification logic

Lehmann, Eveline; Studer, Thomas (July 2019). Subset models for justification logic. Lecture notes in computer science, 11541, pp. 433-449. Springer 10.1007/978-3-662-59533-6_26

Preview	Text subsetmodelsWollic.pdf - Accepted Version Available under License Publisher holds Copyright. Download (364kB) | Preview
	Text Lehmann-Studer2019_Chapter_SubsetModelsForJustificationLo.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (324kB) | Request a copy

We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new justification logic that is sound and complete with respect to our semantics. Moreover, we present another variant of our semantics that corresponds to traditional justification logic.

These types of models offer us a versatile tool to work with justifications, e.g. by extending them with a probability measure to capture uncertain justifications. Following this strategy we will show that they subsume Artemov’s approach to aggregating probabilistic evidence.

Interest & Impact

Downloads

122 since deposited on 21 Oct 2019
33 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item