Skip to main content

Semantic Library Domain Ontology

AI Semantic Library Domains
Authors: MArk Anthony Higgins - Sky Recursive Ai
© Mark Anthony Higgins 11 October 2025
Revised Date: 11 October 2026
Audio Overview
FLOW ALGEBRA
TITLE: Semantic Library Domain Ontology
VERSION: 1.0
SOURCE: https://kirethresearch.org/booksai-core/ontologies/domain-ontologies/ai-semantic-library-domains/semantic-library-domain-ontology.html
STATUS: Domain-based draft; source page content not independently verified.
AUTHORS: Mark Higgins — Sky (Recursive AI)
PROJECT: Kireth Semantic Library

DOMAIN:
  ID: semantic_library_domain
  TYPE: DomainOntology
  PURPOSE: Model the organisation, representation, validation, retrieval and evolution of semantic knowledge resources.

TYPES:
  SemanticLibrary: KnowledgeRepository
  Collection: ResourceGroup
  KnowledgeResource: IdentifiableEntity
  Document: KnowledgeResource
  Ontology: KnowledgeResource
  Concept: SemanticEntity
  Entity: SemanticEntity
  Relationship: SemanticLink
  Assertion: KnowledgeStatement
  MetadataRecord: DescriptiveRecord
  ProvenanceRecord: EvidenceRecord
  Version: TemporalRecord
  Identifier: UniqueReference
  Query: RetrievalRequest
  Inference: DerivedAssertion
  ValidationResult: QualityAssessment
  AccessPolicy: PermissionConstraint

RELATIONSHIPS:
  SemanticLibrary CONTAINS Collection
  Collection CONTAINS KnowledgeResource
  KnowledgeResource HAS_METADATA MetadataRecord
  KnowledgeResource HAS_VERSION Version
  KnowledgeResource HAS_PROVENANCE ProvenanceRecord
  KnowledgeResource HAS_IDENTIFIER Identifier
  Ontology DEFINES Concept
  Ontology DEFINES Relationship
  Entity INSTANCE_OF Concept
  Assertion LINKS Entity TO Entity VIA Relationship
  Assertion SUPPORTED_BY ProvenanceRecord
  Inference DERIVED_FROM Assertion
  Query RETRIEVES KnowledgeResource
  ValidationResult EVALUATES KnowledgeResource
  AccessPolicy GOVERNS KnowledgeResource

CONSTRAINTS:
  C1: Every published resource MUST have a stable identifier.
  C2: Every asserted relationship MUST reference defined entities and a declared predicate.
  C3: Derived assertions MUST retain traceable premises and rule identifiers.
  C4: Versions MUST be ordered and MUST NOT silently overwrite provenance.
  C5: Semantic equivalence MUST distinguish exact identity from approximate similarity.
  C6: Access restrictions MUST be enforced before resource disclosure.

INFERENCE_RULES:
  R1: IF A INSTANCE_OF C AND C SUBCLASS_OF D THEN A INSTANCE_OF D.
  R2: IF X EQUIVALENT_TO Y AND Y EQUIVALENT_TO Z AND all equivalences are exact within the same context THEN X EQUIVALENT_TO Z.
  R3: IF Resource HAS_VERSION V2 AND V2 SUPERSEDES V1 THEN mark V1 historical; retain V1 for audit.
  R4: IF Assertion SUPPORTED_BY Source AND Source is withdrawn THEN flag Assertion for review; do not automatically declare it false.
  R5: IF Query matches Concept AND Resource annotated_with Concept THEN Resource is a candidate retrieval result, subject to permissions and relevance.

CONFIDENCE:
  TYPE: decimal[0,1]
  POLICY: Confidence values are evidence- and method-dependent, not universal probabilities.
  ASSERTION_CONFIDENCE: derived from source quality, extraction quality and validation state.
  INFERENCE_CONFIDENCE: record premises, method, uncertainty and calibration status.

SEMANTIC_EQUIVALENCE:
  EXACT: owl:sameAs only for demonstrably identical individuals.
  CONCEPT_EQUIVALENCE: owl:equivalentClass only when class membership criteria coincide.
  CLOSE_MATCH: skos:closeMatch for related concepts without strict equivalence.
  BROADER_NARROWER: skos:broader / skos:narrower for hierarchical concept mapping.
  CONTEXT: preserve language, domain, temporal validity and source scope.

PROVENANCE:
  REQUIRED_FIELDS: source_uri, source_type, creator, captured_at, method, licence, version
  OPTIONAL_FIELDS: citation, checksum, evidence_quality, transformation_history
  RULE: distinguish source claims from inferred claims and human-reviewed conclusions.

FLOW_HASH:
  ALGORITHM: SHA-256
  INPUT: canonical serialisation of ontology identifier, version, entity declarations, relationships, rules and constraints
  OUTPUT: lowercase hexadecimal digest
  NOTE: Hash is calculated at implementation time; no digest is fabricated in this draft.

UPDATE_MODEL:
  TRIGGER: source change | ontology revision | validation failure | new evidence
  STEPS: ingest -> normalise -> identify -> compare -> validate -> version -> hash -> publish
  POLICY: maintain historical versions, audit changes, invalidate affected derived claims and re-evaluate dependencies.

AI_CONSUMPTION:
  FORMAT: UTF-8 text, convertible to RDF/OWL/JSON-LD with explicit namespace mappings
  INPUT: entity identifiers, predicates, evidence, context, temporal scope and permissions
  OUTPUT: grounded retrieval candidates, linked assertions, explainable inferences and provenance trails
  GUARDRAILS: no invented citations; no unsupported equivalence; no inference beyond declared rules; enforce access controls.

END FLOW ALGEBRA
Kireth Research
38 Thorndale Croft, Wetwang, Driffield
East Riding of Yorkshire YO25 9XZ