tiny.pluck

Overview · API · Code relationships · Verification · Audit

Overview

Probabilistic programming evaluation and weighted model counting over binary decision diagrams. Exact inference compiles programs into reduced ordered binary decision diagrams (ROBDDs).

Compilation tractability depends on variable order, with unfavorable orderings risking exponential node expansion. Callers select between exact compilation and approximate sampling (LPSMC), retaining responsibility for diagram manager allocations.

Definitions

Namespaces

Public namespaces.

• state
• time
• limits
• logger
• random_seed
• cli
• help_topics
• toplevel
• bdd
• pexpr
• runtime
• weight_dd
• definition_order
• source_identity
• thunk_registry
• wmc
• lpsmc
• query_context
• evaluator

Code relationships

Direct static dependencies extracted from parsed source by semantic graph analysis.

Uses: tiny.bench, tiny.choir, tiny.http, tiny.hypothesis, tiny.machine, tiny.python, tiny.reticulum, tiny.sdfii, tiny.sql, tiny.sys, tiny.tldr, tiny.xkb
Used by: tiny.accy, tiny.acp, tiny.choir, tiny.machine, tiny.sdfii, tiny.smg

Verification

No verification records are cataloged for this module in this build.

Audit