tididi for CΒΆ
A circuit represents a Boolean function. You can combine circuits to describe valid configurations, count or weight their solutions, and transform relations to explore a transition system. The C interface calls the same implementation as the Rust and Python libraries.
Start with a small formula, then choose a tutorial close to your application. The later chapters cover ownership, resource limits, and custom evaluation.
- 1. Your first circuit
- 2. Choose valid configurations
- 3. What are we counting?
- 4. Evaluate probabilities
- 5. Explore a directed graph
- 6. Build and update a Boolean table
- 7. Save related circuits
- 8. Group related variables
- 9. Ownership and errors
- 10. Handle operation limits
- 11. Find a cheapest configuration
- 12. Inspect circuit size
- 13. API reference