Subset Models for Justification Logic

10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Lehmann, E., & Studer, T. (2019). Subset Models for Justification Logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11541 LNCS, pp. 433–449). Springer Verlag. https://doi.org/10.1007/978-3-662-59533-6_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free