tididi for Python

tididi represents Boolean functions as Tree Decision Diagrams (TDDs). Build a circuit from rules, combine it with other circuits, and query the satisfying assignments without listing them. Counts are exact Python integers; weighted sums can be exact fractions.

Start with A first circuit. The configuration tutorial builds a small rule system and follows a user’s choices. The reachability tutorial uses conjunction, quantification, and renaming to explore a directed graph.

• A first circuit
• Using and reusing circuits

Worked examples

• 1. Configuration rules
• 2. What are we counting?
• 3. Probabilities under changing assumptions
• 4. Reachability in a directed graph
• 5. Tables and updates
• 6. Saving and loading related circuits
• 7. Choosing a variable grouping
• 8. Errors, limits, and retained scratch
• 9. A custom minimum-cost calculation
• 10. Inspecting circuit size

Reference

• Python API
• Functions, vtrees, and circuit size

Download an application tutorial as a runnable program or notebook from the bottom of its page.