|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2011, Volume 11, Issue 4, Pages 78–93
(Mi vngu102)
|
|
|
|
On Computational Aspects of Maximal Specificity in Probabilistic Explanation
S. O. Speranski Novosibirsk State University
Abstract:
In the present paper the computational aspects of the formal requirement of maximal specificity are investigated. This requirement is imposed on rules in the language of propositional classical logic when given a computable rational-valued probability measure over the language. We prove undecidability for several general problems of discovering maximally specific rules and probability measures for which the collection of all specific rules is computable; establish decidability of the set of maximally specific rules if certain natural conditions are met; study the question whether it is possible to uniformly obtain decision procedures in case these conditions hold; estimate the complexity of introduced subclasses of measures in the arithmetical hierarchy.
Keywords:
inductive and probability logic, maximal specificity, decidability, computability, complexity.
Received: 04.09.2010
Citation:
S. O. Speranski, “On Computational Aspects of Maximal Specificity in Probabilistic Explanation”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 11:4 (2011), 78–93
Linking options:
https://www.mathnet.ru/eng/vngu102 https://www.mathnet.ru/eng/vngu/v11/i4/p78
|
Statistics & downloads: |
Abstract page: | 287 | Full-text PDF : | 122 | References: | 56 | First page: | 7 |
|