DC FieldValueLanguage
dc.contributor.authorIkodinović, Nebojšaen
dc.contributor.authorRašković, Miodragen
dc.contributor.authorMarković, Zoranen
dc.contributor.authorOgnjanović, Zoranen
dc.date.accessioned2020-02-18T20:06:31Z-
dc.date.available2020-02-18T20:06:31Z-
dc.date.issued2007-01-01en
dc.identifier.isbn978-354075255-4en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/70-
dc.description.abstractIn this paper we investigate logic which is suitable for reasoning about uncertainty in different situations. A possible-world approach is used to provide semantics to formulas. Axiomatic system for our logic is given and the corresponding strong completeness theorem is proved. Relationships to other systems are discussed.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.subjectAxiomatic system | Logic programming | Theorem proving-
dc.titleMeasure logicen
dc.typeArticleen
dc.relation.conferenceEuropean Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU 2007-
dc.identifier.doi10.1007/978-3-540-75256-1_14-
dc.identifier.scopus2-s2.0-38049178882en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage128-
dc.relation.lastpage138-
dc.relation.volume4724-
dc.description.rankM23-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

6
checked on Nov 23, 2024

Page view(s)

19
checked on Nov 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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