Switch to: References

Add citations

You must login to add citations.
  1. The Logic ILP for Intuitionistic Reasoning About Probability.Angelina Ilić-Stepić, Zoran Ognjanović & Aleksandar Perović - forthcoming - Studia Logica:1-31.
    We offer an alternative approach to the existing methods for intuitionistic formalization of reasoning about probability. In terms of Kripke models, each possible world is equipped with a structure of the form $$\langle H, \mu \rangle $$ that needs not be a probability space. More precisely, though H needs not be a Boolean algebra, the corresponding monotone function (we call it measure) $$\mu : H \longrightarrow [0,1]_{\mathbb {Q}}$$ satisfies the following condition: if $$\alpha $$, $$\beta $$, $$\alpha \wedge \beta $$, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Logics in Artificial Intelligence: Proceedings of European Workshop, Jelia '96, Évora, Portugal, September 30-October 3, 1996.José Júlio Alferes, Luís Moniz Pereira & Ewa Orlowska (eds.) - 1996 - Berlin and New York: Springer.
    Download  
     
    Export citation  
     
    Bookmark  
  • Multi-agent Logics for Reasoning About Higher-Order Upper and Lower Probabilities.Dragan Doder, Nenad Savić & Zoran Ognjanović - 2020 - Journal of Logic, Language and Information 29 (1):77-107.
    We present a propositional and a first-order logic for reasoning about higher-order upper and lower probabilities. We provide sound and complete axiomatizations for the logics and we prove decidability in the propositional case. Furthermore, we show that the introduced logics generalize some existing probability logics.
    Download  
     
    Export citation  
     
    Bookmark  
  • Completeness theorems for σ–additive probabilistic semantics.Nebojša Ikodinović, Zoran Ognjanović, Aleksandar Perović & Miodrag Rašković - 2020 - Annals of Pure and Applied Logic 171 (4):102755.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Completeness theorem for propositional probabilistic models whose measures have only finite ranges.Radosav Dordević, Miodrag Rašković & Zoran Ognjanović - 2004 - Archive for Mathematical Logic 43 (4):557-563.
    A propositional logic is defined which in addition to propositional language contains a list of probabilistic operators of the form P ≥s (with the intended meaning ‘‘the probability is at least s’’). The axioms and rules syntactically determine that ranges of probabilities in the corresponding models are always finite. The completeness theorem is proved. It is shown that completeness cannot be generalized to arbitrary theories.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Probabilistic Semantics and Calculi for Multi-valued and Paraconsistent Logics.Jaime Ramos, João Rasga & Cristina Sernadas - forthcoming - Studia Logica:1-35.
    We show how to obtain a probabilistic semantics and calculus for a logic presented by a valuation specification. By identifying general forms of valuation constraints we are able to accommodate a wide class of propositional based logics encompassing multi-valued logics like Łukasiewicz 3-valued logic and the Belnap–Dunn four-valued logic as well as paraconsistent logics like $${\textsf{mbC}}$$ and $${\textsf{LFI1}}$$. The probabilistic calculus is automatically generated from the valuation specification. Although not having explicit probability constructors in the language, the rules of the (...)
    Download  
     
    Export citation  
     
    Bookmark