On the computational aspects of the maximal specificity in probabilistic explanation

MaRDI QIDQ2895851zbMATH OpenFDO

Authors S. O. Speranskij

Publication date 13 July 2012

Published in Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

zbMATH Keywords

complexitydecidabilitycomputabilityinductive logicprobability logicmaximal specificity

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Logic in the philosophy of science (03A10)

Recommendations

• On measuring the specificity of if-then rules
• Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
• Computational aspects of probability logics
• Complexity results for probabilistic answer set programming
• scientific article; zbMATH DE number 5148415

This page was built for publication: On the computational aspects of the maximal specificity in probabilistic explanation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895851)