|Authors:||Ilić Stepić, Angelina
|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Conditional p-adic probability logic||First page:||17||Last page:||24||Conference:||ECAI-2012 Workshop on Weighted logics for Artificial Intelligence WL4AI, Montpellier, France, August 28, 2012.||Editors:||Godo, Lluis
This paper presents the proof-theoretical approach to a p-adic valued conditional probabilistic logic CPLQp. In this logic formulas are built from the finite set of propositional letters. We propose a class of probabilistic models and corresponding infinitary axiomatization for which we prove strong completeness theorem. Decidability of the presented logic is proved.
|Publisher:||IIIA - CSIC|
Show full item record
checked on Jan 17, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.