DC FieldValueLanguage
dc.contributor.authorDoder, Draganen
dc.contributor.authorSavić, Nenaden
dc.contributor.authorOgnjanović, Zoranen
dc.date.accessioned2020-02-18T20:06:23Z-
dc.date.available2020-02-18T20:06:23Z-
dc.date.issued2018-01-01en
dc.identifier.isbn978-3-319-90049-0en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/12-
dc.description.abstractWe present a propositional logic for reasoning about higher-order upper and lower probabilities. The main technical result is the proof of decidability of the introduced logical system. We also show that the axiomatization for the corresponding logic without iterations of operators, which we developed in our previous work, is also complete for the new class of models presented in this paper.en
dc.publisherSpringer Link-
dc.relationAdvanced Techniques of Cryptology, Image Processing and Computational Topology for Information Security-
dc.relationRepresentations of logical structures and formal languages and their application in computing-
dc.relationDevelopment of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education-
dc.relationSNSF project 200021 165549-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectCompleteness theorem | Decidability | Probabilistic logic | Upper and lower probabilitiesen
dc.titleA decidable multi-agent logic with iterations of upper and lower probability operatorsen
dc.typeConference Paperen
dc.relation.conference10th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2018; Budapest; Hungary; 14 May 2018 through 18 May 2018-
dc.identifier.doi10.1007/978-3-319-90050-6_10en
dc.identifier.scopus2-s2.0-85046890785en
dc.relation.firstpage170-
dc.relation.lastpage185-
dc.relation.volume10833 LNCS-
dc.description.rankM33-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeConference Paper-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174008e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174026e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/044006e.php-
crisitem.project.fundingProgramDirectorate for Education & Human Resources-
crisitem.project.fundingProgramDirectorate for Social, Behavioral & Economic Sciences-
crisitem.project.fundingProgramNATIONAL HEART, LUNG, AND BLOOD INSTITUTE-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Education & Human Resources/1740089-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Social, Behavioral & Economic Sciences/1740267-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NIH/NATIONAL HEART, LUNG, AND BLOOD INSTITUTE/5R01HL044006-04-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

4
checked on May 23, 2024

Page view(s)

80
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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