Asymptotic Conditional Probabilities: The Unary Case
From MaRDI portal
Publication:4875444
DOI10.1137/S0097539793257034zbMath0848.03004MaRDI QIDQ4875444
Adam J. Grove, Daphne Koller, Joseph Y. Halpern
Publication date: 27 October 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
complexityfinite model theorydegree of beliefprinciple of indifferenceasymptotic probabilitylabeled structures
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Probability and inductive logic (03B48) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Model theory of finite structures (03C13)
Related Items (8)
The effect of combination functions on the complexity of relational Bayesian networks ⋮ From statistical knowledge bases to degrees of belief ⋮ Inference Processes for Quantified Predicate Knowledge ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Towards the entropy-limit conjecture ⋮ Entailment with near surety of scaled assertions of high conditional probability ⋮ Equivocation axiom on first order languages ⋮ Probabilistic characterisation of models of first-order theories
This page was built for publication: Asymptotic Conditional Probabilities: The Unary Case
