Authors: Ognjanović, Zoran 
Ilić Stepić, Angelina 
Perović, Aleksandar
Affiliations: Mathematics 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A probabilistic temporal epistemic logic: Strong completeness
Journal: Logic Journal of the IGPL
Volume: 32
Issue: 1
First page: 94
Last page: 138
Issue Date: 2024
Rank: ~M21a
ISSN: 1367-0751
DOI: 10.1093/jigpal/jzac072
The paper offers a formalization of reasoning about distributed multi-agent systems. The presented propositional probabilistic temporal epistemic logic PTEL is developed in full detail: syntax, semantics, soundness and strong completeness theorems. As an example, we prove consistency of the blockchain protocol with respect to the given set of axioms expressed in the formal language of the logic. We explain how to extend PTEL to axiomatize the corresponding first-order logic.
Publisher: Oxford Academic
Project: Advanced artificial intelligence techniques for analysis and design of system components based on trustworthy BlockChain technology - AI4TrustBC 

Files in This Item:
File Description SizeFormat
ZOgnjanovic.pdf16.78 MBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 9, 2024


checked on May 9, 2024

Google ScholarTM




This item is licensed under a Creative Commons License Creative Commons