Switch to: References

Add citations

You must login to add citations.
  1. Probability Logics for Reasoning About Quantum Observations.Angelina Ilić Stepić, Zoran Ognjanović & Aleksandar Perović - 2023 - Logica Universalis 17 (2):175-219.
    In this paper we present two families of probability logics (denoted _QLP_ and \(QLP^{ORT}\) ) suitable for reasoning about quantum observations. Assume that \(\alpha \) means “O = a”. The notion of measuring of an observable _O_ can be expressed using formulas of the form \(\square \lozenge \alpha \) which intuitively means “if we measure _O_ we obtain \(\alpha \) ”. In that way, instead of non-distributive structures (i.e., non-distributive lattices), it is possible to relay on classical logic extended with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Blockchain self-update smart contract for supply chain traceability with data validation.Cristian Valencia-Payan, David Griol & Juan Carlos Corrales - forthcoming - Logic Journal of the IGPL.
    A sustainable supply chain management strategy reduces risks and meets environmental, economic and social objectives by integrating environmental and financial practices. In an ever-changing environment, supply chains have become vulnerable at many levels. In a global supply chain, carefully tracing a product is of great importance to avoid future problems. This paper describes a self-updating smart contract, which includes data validation, for tracing global supply chains using blockchains. Our proposal uses a machine learning model to detect anomalies on traceable data, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A probabilistic temporal epistemic logic: Decidability.Zoran Ognjanović, Angelina Ilić Stepić & Aleksandar Perović - forthcoming - Logic Journal of the IGPL.
    We study a propositional probabilistic temporal epistemic logic |$\textbf {PTEL}$| with both future and past temporal operators, with non-rigid set of agents and the operators for agents’ knowledge and for common knowledge and with probabilities defined on the sets of runs and on the sets of possible worlds. A semantics is given by a class |${\scriptsize{\rm Mod}}$| of Kripke-like models with possible worlds. We prove decidability of |$\textbf {PTEL}$| by showing that checking satisfiability of a formula in |${\scriptsize{\rm Mod}}$| is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation