Please use this identifier to cite or link to this item: https://doi.org/10.1007/11564089_26
DC FieldValue
dc.titleAbsolute versus probabilistic classification in a logical setting
dc.contributor.authorJain, S.
dc.contributor.authorMartin, E.
dc.contributor.authorStephan, F.
dc.date.accessioned2013-07-04T08:10:00Z
dc.date.available2013-07-04T08:10:00Z
dc.date.issued2005
dc.identifier.citationJain, S.,Martin, E.,Stephan, F. (2005). Absolute versus probabilistic classification in a logical setting. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3734 LNAI : 327-342. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/11564089_26" target="_blank">https://doi.org/10.1007/11564089_26</a>
dc.identifier.isbn354029242X
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40685
dc.description.abstractGiven a set W of logical structures, or possible worlds, a set D of logical formulas, or possible data, and a logical formula ψ, we consider the classification problem of determining in the limit and almost always correctly whether a possible world ℳ satisfies ψ, from a complete enumeration of the possible data that are true in ℳ. One interpretation of almost always correctly is that the classification might be wrong on a set of possible worlds of measure 0, w.r.t. some natural probability distribution over the set of possible worlds. Another interpretation is that the classifier is only required to classify a set W′ of possible worlds of measure 1, without having to produce any claim in the limit on the truth of ψ in the members of the complement of W′ in W. We compare these notions with absolute classification of W w.r.t. a formula that is almost always equivalent to ψ in W, hence investigate whether the set of possible worlds on which the classification is correct is definable. Finally, in the spirit of the kind of computations considered in Logic programming, we address the issue of computing almost correctly in the limit witnesses to leading existentially quantified variables in existential formulas. © Springer-Verlag Berlin Heidelberg 2005.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/11564089_26
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1007/11564089_26
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume3734 LNAI
dc.description.page327-342
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

144
checked on Jun 23, 2022

Google ScholarTM

Check

Altmetric


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