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.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
pjt222/agent-almanac422026년 10월 15일 업데이트