Ilić Stepić, Angelina
Mathematical Institute of the Serbian Academy of Sciences and Arts
|Title:||A Probabilistic Temporal Epistemic Logic: Strong Completeness||Journal:||Logic Journal of the IGPL||First page:||jzac072||Issue Date:||2022||Rank:||~M21a||ISSN:||1367-0751||DOI:||10.1093/jigpal/jzac072||Abstract:||
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|
Show full item record
checked on Dec 3, 2023
This item is licensed under a Creative Commons License