ConceptDynamics / CONCEPT
Partial-Diagram Constraint Compiler Soundness
Required edges, forbidden edges, and query-order admissibility compile to an exact finite support polytope over candidate causal completions.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS1
The compiled LP exactly characterizes admissible completion mixtures
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Attaining Canonical Structural Modelsstructural-affinity · Closed
- Causal-Order Linear Programsstructural-affinity · Closed
- Cross-World Independence Sharp Boundsstructural-affinity · Closed
- Extension-Invariant Causal Query Boundsstructural-affinity · Closed
- Finite Linear Causal Identificationstructural-affinity · Closed
- Nonconvex Sharp Identificationstructural-affinity · Closed
- Partial Graph Information Orderstructural-affinity · Closed
- Partial-Diagram Event-Row Compiler Soundnessstructural-affinity · Closed
- Partial-Graph Completion Rangesstructural-affinity · Closed
- Rational support elimination certificatesstructural-affinity · Closed
- RationalSTCutCertificatestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance