DevOps & Infrastructure
Evaluate Boolean Expression
Evaluate and simplify Boolean expressions using truth tables, algebraic laws (De Morgan, distributive, absorption, idempotent, consensus), and Karnaugh maps for up to six variables. Use when you need to reduce a Boolean expression to its minimal sum-of-products or product-of-sums form, verify logical equivalence between two expressions, or prepare a minimized function for gate-level implementation.
- Publisher / source
- pjt222/agent-almanac (found on the CSV list)
- Upstream record
- pjt222/agent-almanac
- Version
- Version 1
- Published
- Publication review
- Approved for publication · recorded passed scan 2026-11-03
- Content fingerprint
07a0526db13e3fd6d47b1a6c1ebb9526f695003d2c2b5ad7442668d38020e55e