1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/2724
DC FieldValueLanguage
dc.contributor.authorIlić-Stepić, Angelinaen_US
dc.contributor.authorOgnjanović, Zoranen_US
dc.contributor.authorIkodinović, Nebojšaen_US
dc.date.accessioned2025-10-09T16:25:48Z-
dc.date.available2025-10-09T16:25:48Z-
dc.date.issued2012-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/2724-
dc.description.abstractThis paper presents the proof-theoretical approach to a p-adic valued conditional probabilistic logic CP LQp . 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.en_US
dc.language.isoenen_US
dc.publisherConsejo Superior de Investigaciones Cientificas CSICen_US
dc.titleConditional p-adic probability logicen_US
dc.typeConference Objecten_US
dc.relation.conferenceEuropean Conference on Artificial Intelligence ECAI (20 ; 2012 ; Montpellier)en_US
dc.relation.publicationWorking Papers ECAI-­‐2012 Workshop on Weighted Logics for Artificial Intelligence WL4Aen_US
dc.identifier.urlhttp://www.iiia.csic.es/wl4ai/-
dc.identifier.urlhttps://www.lirmm.fr/ecai2012/images/stories/ecai_doc/pdf/workshop/W34_wl4ai-working-notes.pdf-
dc.description.rankM33en_US
dc.relation.firstpage17en_US
dc.relation.lastpage24en_US
item.languageiso639-1en-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.openairetypeConference Object-
crisitem.author.orcid0000-0003-3832-760X-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check


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