DC FieldValueLanguage
dc.contributor.authorIlić Stepić, Angelina-
dc.contributor.authorOgnjanović, Zoran-
dc.contributor.authorIkodinović, Nebojša-
dc.contributor.editorGodo, Lluis-
dc.contributor.editorPrade, Henri-
dc.date.accessioned2020-06-15T15:23:21Z-
dc.date.available2020-06-15T15:23:21Z-
dc.date.issued2012-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/3032-
dc.description.abstractThis 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.-
dc.publisherIIIA - CSIC-
dc.titleConditional p-adic probability logic-
dc.typeConference Paper-
dc.relation.conferenceECAI-2012 Workshop on Weighted logics for Artificial Intelligence WL4AI, Montpellier, France, August 28, 2012.-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage17-
dc.relation.lastpage24-
dc.description.rankM33-
item.openairetypeConference Paper-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0002-9771-1196-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

Page view(s)

74
checked on May 9, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.