And-inverter graph¶
A directed acyclic representation of Boolean logic using two-input AND nodes and optional edge inversions.
Core Idea¶
Variables and constants form terminals, conjunction forms internal nodes and complemented edges encode negation, providing a structurally simple basis for scalable rewriting, hashing and verification. Arbitrary gates are decomposed into AND and NOT, common subexpressions share graph nodes and local equivalence-preserving rewrites optimize structure while outputs reference selected nodes or complements. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
And-inverter graph belongs to logic synthesis and is useful where the analyst can specify the typed logic synthesis carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the Boolean function and input variables, DAG nodes and topological order, two-input AND semantics, complemented-edge convention, constants and outputs, structural hashing, equivalence and size or depth metrics are explicit. The scope is broad within that domain but bounded by the need for the Boolean function and input variables, DAG nodes and topological order, two-input AND semantics, complemented-edge convention, constants and outputs, structural hashing, equivalence and size or depth metrics are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the Boolean function and input variables, DAG nodes and topological order, two-input AND semantics, complemented-edge convention, constants and outputs, structural hashing, equivalence and size or depth metrics are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to And-inverter graph. And-inverter graph compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed logic synthesis carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the Boolean function and input variables, DAG nodes and topological order, two-input AND semantics, complemented-edge convention, constants and outputs, structural hashing, equivalence and size or depth metrics are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of logic synthesis because they reuse the typed logic synthesis carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, Arbitrary gates are decomposed into AND and NOT, common subexpressions share graph nodes and local equivalence-preserving rewrites optimize structure while outputs reference selected nodes or complements., and type the carrier, state every parameter and convention in the definition, test that the Boolean function and input variables, DAG nodes and topological order, two-input AND semantics, complemented-edge convention, constants and outputs, structural hashing, equivalence and size or depth metrics are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction And-inverter graph Domain-specific
Parents (1) — more general patterns this builds on
-
And-inverter graph is a kind of Composition Prime
The proposed strict upward parent is
prime:composition.
Hierarchy path (1) — routes to 1 parentless root
- And-inverter graph → Composition → Gestalt Principles → Holism
Neighborhood in Abstraction Space¶
And-inverter graph sits in a crowded region of the domain-specific corpus (15th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Digital Logic & Boolean Networks (9 abstractions)
Nearest neighbors
- Logic gate — 0.92
- Logical cube — 0.92
- Pairing function — 0.92
- Sequential logic — 0.92
- Well-founded semantics — 0.92
Computed from structural-signature embeddings · 2026-09-08