{"paper":{"title":"Fast Belief Update Using Order-of-Magnitude Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Moises Goldszmidt","submitted_at":"2013-02-20T15:20:47Z","abstract_excerpt":"We present an algorithm, called Predict, for updating beliefs in causal networks quantified with order-of-magnitude probabilities.  The algorithm takes advantage of both the structure and the quantification of the network and presents a polynomial asymptotic complexity.  Predict exhibits a conservative behavior in that it is always sound but not always complete.  We provide sufficient conditions for completeness and present algorithms for testing these conditions and for computing a complete set of plausible values.  We propose Predict as an efficient method to estimate probabilistic values an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4950","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}