FLOW ALGEBRA
TITLE: Input Relationship Ontology
DOMAIN: Relationship Ontologies / Process Relationships
SOURCE: https://kirethresearch.org/booksai-core/ontologies/relationship-ontologies/process-relationships/input-relationship-ontology.html
VERSION: 1.0
AUTHORS: Mark Anthony Higgins — Sky (Recursive AI)
STATUS: Companion formalisation; source-page specification not independently verified.
flow "InputRelationshipOntology" v1.0 {
ontology:
id: "input-relationship-ontology"
parent: "process-relationships"
purpose: "Represent, trace and validate relationships between processes, their required or optional inputs, providers and consumption events."
types:
Process: {id: string, name: string, version: string?, status: string?}
Input: {id: string, kind: enum[data, material, energy, signal, resource, instruction, parameter, other], datatype: string?, unit: string?, schema: string?, version: string?}
Agent: {id: string, role: string}
InputPort: {id: string, process_id: string, accepted_type: string, required: boolean, multiplicity: string?}
InputEvent: {id: string, process_id: string, input_id: string, timestamp: datetime?, quantity: number?, provenance: string}
Relationship: {id: string, subject: string, predicate: string, object: string, context: string?, confidence: number, evidence: string[]}
predicates:
accepts(process: Process, port: InputPort)
provided_by(input: Input, agent: Agent)
supplied_to(input: Input, process: Process)
bound_to(input: Input, port: InputPort)
consumed_in(input: Input, event: InputEvent)
required_by(input: Input, process: Process)
produced_by(input: Input, upstream: Process)
depends_on(process: Process, input: Input)
constraints:
- "All relationship endpoints must resolve to declared typed entities."
- "Input ports must belong to the receiving process."
- "An input bound to a port must satisfy its datatype, schema, unit and multiplicity constraints."
- "Required input declarations do not prove that an input has been supplied or consumed."
- "Supply, acceptance and consumption are distinct events and must not be conflated."
- "An upstream output is not automatically a valid downstream input without interface validation."
- "Confidence values must be within [0, 1]."
- "Preserve provenance, version and timestamps where available."
inference:
rule input_dependency:
if required_by(i,p)
then depends_on(p,i)
confidence: "retain declaration evidence; do not assert fulfilment"
rule validated_supply:
if bound_to(i,port) and accepts(p,port) and compatible(i,port)
then supplied_to(i,p)
confidence: "requires observed or recorded binding evidence"
rule upstream_lineage:
if produced_by(i,p1) and supplied_to(i,p2)
then information_or_resource_flow(p1,p2,i)
confidence: "retain provenance; do not infer direct causation or consumption"
SEMANTIC_EQUIVALENCE:
- "Map input types and port types using versioned schemas and controlled vocabularies."
- "Distinguish equivalent inputs from merely compatible or substitutable inputs."
- "Preserve units, semantics, process context and version boundaries."
CONFIDENCE:
range: [0,1]
factors: [source_reliability, interface_compatibility, measurement_uncertainty, provenance_quality, temporal_validity]
policy: "Do not increase confidence solely through inference chaining."
VALIDATION:
- "Check entity identity, input type, port compatibility, schema and units."
- "Verify required input availability before execution readiness is asserted."
- "Detect missing, duplicated, stale or incompatible inputs."
- "Distinguish declared dependencies from observed data or resource flows."
- "Retain unresolved conflicts and incomplete provenance."
FLOW_HASH:
algorithm: "SHA-256"
input: "canonicalised ontology version, typed relationships, rules and provenance"
note: "Compute at execution; no hash value is claimed here."
UPDATE_MODEL:
strategy: "versioned, provenance-preserving incremental update"
steps: [ingest, normalise, validate, reconcile, update_dependencies, recompute_inferences, publish]
rollback: true
AI_CONSUMPTION:
representation: "typed process-input knowledge graph with evidence-backed relationships"
outputs: [input_bindings, dependency_edges, compatibility_results, lineage_paths, validation_reports, provenance_records]
safeguards: [no_unverified_consumption_claims, preserve_units_and_versions, respect_access_controls, distinguish_requirement_from_observation]
}
END FLOW ALGEBRA
Download Code
Copy to Clipboard