DC FieldValueLanguage
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorDoder, Draganen
dc.contributor.authorMarković, Zoranen
dc.date.accessioned2020-02-18T20:06:29Z-
dc.date.available2020-02-18T20:06:29Z-
dc.date.issued2011-10-19en
dc.identifier.isbn978-3-642-23962-5en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/50-
dc.description.abstractWe introduce a propositional logic whose formulas are built using the language of CTL*, enriched by two types of probability operators: one speaking about probabilities on branches, and one speaking about probabilities of sets of branches with the same initial state. An infinitary axiomatization for the logic, which is shown to be sound and strongly complete with respect to the corresponding class of models, is proposed.en
dc.publisherSpringer Link-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectBranching time | Probability operators | Propositional logic-
dc.titleA branching time logic with two types of probability operatorsen
dc.typeConference Paperen
dc.relation.conference5th International Conference on Scalable Uncertainty Management, SUM 2011; Dayton, OH; United States; 10 October 2011 through 13 October 2011-
dc.identifier.doi10.1007/978-3-642-23963-2_18en
dc.identifier.scopus2-s2.0-80054089531en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage219-
dc.relation.lastpage232-
dc.relation.volume6929 LNAI-
dc.description.rankM33-
item.fulltextNo Fulltext-
item.openairetypeConference Paper-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

13
checked on Apr 1, 2025

Page view(s)

23
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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