Diagrammatic & Model-Based Reasoning

← Back to Domain-Specific Families

Abstractions about diagrams, state spaces, constraints, labyrinths, visual logic, process models, and computational agents used to represent reasoning.

12 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• AI-complete — An informal label for tasks believed to require capabilities as broad as artificial general intelligence rather than a narrow specialized method.
• Block diagram — A high-level system representation that depicts principal functions or components as blocks connected by lines showing declared relationships or flows.
• Constraint satisfaction — The search for assignments to variables from declared domains such that every stated constraint is simultaneously satisfied.
• Diagrammatic reasoning — Inference conducted through structured visual representations whose spatial relations carry semantic and inferential force.
• Euler diagram — A set diagram representing only the inclusion, overlap and disjointness relations that actually hold among the depicted classes.
• IDEF0 — Model a system's functions as hierarchically decomposed activity boxes with Input, Control, Output, and Mechanism arrows, preserving parent-child boundary interfaces across levels of detail.
• Labyrinth — A unicursal or multicursal spatial pattern of winding passages organized around a difficult route to a center, exit, or goal.
• Logical cube — A three-dimensional opposition diagram that organizes eight categorical propositions and displays their contradiction, contrariety, subcontrariety and subalternation relations.
• Model-based reasoning — An inference approach deriving explanations, predictions or diagnoses by combining observations with an explicit declarative model of how a system works.
• State space (computer science) — The set of all possible system configurations together with transitions permitted between them.
• Thinking processes (theory of constraints) — A suite of causal-diagram methods in the theory of constraints for identifying a core conflict, designing a future state and planning the transition to it.
• Turmite — A two-dimensional Turing-machine model whose oriented finite-state agent reads and rewrites grid cells while turning and moving locally.