Uncertain Reasoning in Justification Logic

Kokkinis, Ioannis (2016). Uncertain Reasoning in Justification Logic. (Dissertation, Institute of Computer Science, Philosophisch-naturwissenschaftliche Fakultät, Universität Bern)

kokphd16.pdf - Accepted Version
Available under License BORIS Standard License.

Download (966kB) | Preview

This thesis studies the combination of two well known formal systems for knowledge representation: probabilistic logic and justification logic. Our aim is to design a formal framework that allows the analysis of epistemic situations with incomplete information. In order to achieve this we introduce two probabilistic justification logics, which are defined by adding probability operators to the minimal justification logic J. We prove soundness and completeness theorems for our logics and establish decidability procedures. Both our logics rely on an infinitary rule so that strong completeness can be achieved. One of the most interesting mathematical results for our logics is the fact that adding only one iteration of the probability operator to the justification logic J does not increase the computational complexity of the logic.

Item Type: Thesis (Dissertation)
Division/Institute: 08 Faculty of Science > Institute of Computer Science (INF)
08 Faculty of Science > Institute of Computer Science (INF) > Logic and Theory Group (LTG)
UniBE Contributor: Kokkinis, Ioannis and Studer, Thomas
Subjects: 000 Computer science, knowledge & systems
500 Science > 510 Mathematics
Language: English
Submitter: Lukas Jaun
Date Deposited: 29 Sep 2016 16:27
Last Modified: 20 Mar 2017 13:47
BORIS DOI: 10.7892/boris.85637
URI: http://boris.unibe.ch/id/eprint/85637

Actions (login required)

Edit item Edit item
Provide Feedback