DC FieldValueLanguage
dc.contributor.authorDoder, Draganen_US
dc.contributor.authorOgnjanović, Zoranen_US
dc.contributor.authorSavić, Nenaden_US
dc.contributor.authorStuder, Thomasen_US
dc.date.accessioned2022-05-04T09:28:16Z-
dc.date.available2022-05-04T09:28:16Z-
dc.date.issued2022-03-31-
dc.identifier.isbn978-3-030-98478-6-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4797-
dc.description.abstractWe present a logic for reasoning about higher-order upper and lower probabilities of justification formulas. We provide sound and strongly complete axiomatization for the logic. Furthermore, we show that the introduced logic generalizes the existing probabilistic justification logic PPJ.en_US
dc.publisherSpringer Linken_US
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.subjectJustifcation logic | Probabilistic logic | Strong completeness | Upper and lower probabilitiesen_US
dc.titleIncomplete Information and Justificationsen_US
dc.typeConference Paperen_US
dc.relation.conferenceInternational Tbilisi Symposium on Logic, Language, and Computation TbiLLC 2019: Language, Logic, and Computationen_US
dc.identifier.doi10.1007/978-3-030-98479-3_13-
dc.identifier.scopus2-s2.0-85128447447-
dc.contributor.affiliationMathematicsen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage258-
dc.relation.lastpage278-
dc.relation.volume13206-
dc.description.rankM33-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeConference Paper-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

Page view(s)

73
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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