DC FieldValueLanguage
dc.contributor.authorGhilezan, Silviaen
dc.contributor.authorIvetić, Jelenaen
dc.contributor.authorKašterović, Simonaen
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorSavić, Nenaden
dc.date.accessioned2020-02-18T20:06:23Z-
dc.date.available2020-02-18T20:06:23Z-
dc.date.issued2018-01-01en
dc.identifier.isbn978-3-319-72055-5en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/13-
dc.description.abstractReasoning with uncertainty has gained an important role in computer science, artificial intelligence and cognitive science. These applications urge for development of formal models which capture reasoning of probabilistic features. We propose a formal model for reasoning about probabilities of simply typed lambda terms. We present its syntax, Kripke-style semantics and axiomatic system. The main results are the corresponding soundness and strong completeness, which rely on two key facts: the completeness of simple type assignment and the existence of a maximal consistent extension of a consistent set.en
dc.publisherSpringer Link-
dc.relationSchweizerischer Nationalfonds zur förderung der Wissenschaftlichen Forschung-
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.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectProbabilistic logic | Simply typed lambda calculus | Soundness | Strong completenessen
dc.titleProbabilistic reasoning about simply typed lambda termsen
dc.typeConference Paperen
dc.relation.conferenceInternational Symposium on Logical Foundations of Computer Science, LFCS 2018; FL; United States; 8 January 2018 through 11 January 2018-
dc.identifier.doi10.1007/978-3-319-72056-2_11en
dc.identifier.scopus2-s2.0-85039416804en
dc.relation.grantno165549-
dc.relation.grantnoON174008-
dc.relation.grantnoON174026-
dc.relation.grantnoIII44006-
dc.relation.firstpage170-
dc.relation.lastpage189-
dc.relation.volume10703 LNCS-
dc.description.rankM33-
item.cerifentitytypePublications-
item.openairetypeConference Paper-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
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-2253-8285-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

5
checked on Dec 20, 2024

Page view(s)

23
checked on Dec 21, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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