DC FieldValueLanguage
dc.contributor.authorKokkinis, Ioannisen
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorStuder, Thomasen
dc.date.accessioned2020-02-18T20:06:25Z-
dc.date.available2020-02-18T20:06:25Z-
dc.date.issued2016-01-01en
dc.identifier.isbn978-3-319-27683-0en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/20-
dc.description.abstractWe present a probabilistic justification logic, PPJ, to study rational belief, degrees of belief and justifications.We establish soundness and completeness for PPJ and show that its satisfiability problem is decidable. In the last part we use PPJ to provide a solution to the lottery paradox.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.subjectDecidability | Justification logic | Lottery paradox | Probabilistic logic | Strong completenessen
dc.titleProbabilistic justification logicen
dc.typeConference Paperen
dc.relation.conferenceInternational Symposium on Logical Foundations of Computer Science, LFCS 2016; Deerfield Beach; United States; 4 January 2016 through 7 January 2016-
dc.identifier.doi10.1007/978-3-319-27683-0_13en
dc.identifier.scopus2-s2.0-84952802891en
dc.relation.firstpage174-
dc.relation.lastpage186-
dc.relation.volume9537-
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-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

24
checked on Jun 14, 2024

Page view(s)

44
checked on May 10, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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