DC FieldValueLanguage
dc.contributor.authorPerović, Aleksandaren
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorRašković, Miodragen
dc.contributor.authorMarković, Zoranen
dc.date.accessioned2020-02-18T20:06:30Z-
dc.date.available2020-02-18T20:06:30Z-
dc.date.issued2008-11-28en
dc.identifier.isbn978-3-540-87802-5en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/60-
dc.description.abstractThe paper offers a proof of the compactness theorem for the -valued polynomial weight formulas. We also provide a complete axiomatization for the polynomial weight formulas.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.subjectPolynomial weights | Complete axiomatization | Probabilistic logics-
dc.titleHow to restore compactness into probabilistic logics?en
dc.typeArticleen
dc.relation.conference11th European Conference on Logics in Artificial Intelligence, JELIA 2008; Dresden; Germany; 28 September 2008 through 1 October 2008-
dc.identifier.doi10.1007/978-3-540-87803-2_28en
dc.identifier.scopus2-s2.0-56649083384en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage338-
dc.relation.lastpage348-
dc.relation.volume5293 LNAI-
dc.description.rankM23-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

6
checked on Jun 21, 2024

Page view(s)

88
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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