Authors: Dautović, Šejla 
Affiliations: Mathematics 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A Probabilistic Logic Between LPP1 and LPP2
Journal: Logica Universalis
Issue Date: 1-Jan-2022
Rank: ~M22
ISSN: 1661-8297
DOI: 10.1007/s11787-022-00301-z
An extension of the propositional probability logic LPP2 given in Ognjanović et al. (Probability Logics. Probability-Based Formalization of Uncertain Reasoning, Theoretical Springer, Cham, Switzerland, 2016) that allows mixing of propositional formulas and probabilistic formulas is introduced. We describe the corresponding class of models, and we show that the problem of deciding satisfiability is in NP. We provide infinitary axiomatization for the logic and we prove that the axiomatization is sound and strongly complete.
Keywords: Completeness theorem | Decidability | Probabilistic logic
Publisher: Springer Link
Project: Advanced artificial intelligence techniques for analysis and design of system components based on trustworthy BlockChain technology - AI4TrustBC 

Show full item record


checked on May 23, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.