@faubulous/mentor-rdf/dist/index.js

A library for working with RDF vocabularies with support for basic RDFS and OWL inference.

var __defProp = Object.defineProperty;
var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);

// src/ontologies/xsd.ts
var _XSD = "http://www.w3.org/2001/XMLSchema#";
var XSD = {
  /** anyURI represents an Internationalized Resource Identifier Reference (IRI).  An anyURI value can be absolute or relative, and may have an optional fragment identifier (i.e., it may be an IRI Reference).  This type should be used when the value fulfills the role of an IRI, as defined in [RFC 3987] or its successor(s) in the IETF Standards Track. */
  "anyURI": "http://www.w3.org/2001/XMLSchema#anyURI",
  /** base64Binary represents arbitrary Base64-encoded binary data.  For base64Binary data the entire binary stream is encoded using the Base64 Encoding defined in [RFC 3548], which is derived from the encoding described in [RFC 2045]. */
  "base64Binary": "http://www.w3.org/2001/XMLSchema#base64Binary",
  /** boolean represents the values of two-valued logic. */
  "boolean": "http://www.w3.org/2001/XMLSchema#boolean",
  /** byte is ·derived· from short by setting the value of ·maxInclusive· to be 127 and ·minInclusive· to be -128. The ·base type· of byte is short. */
  "byte": "http://www.w3.org/2001/XMLSchema#byte",
  /** date represents top-open intervals of exactly one day in length on the timelines of dateTime, beginning on the beginning moment of each day, up to but not including the beginning moment of the next day).  For non-timezoned values, the top-open intervals disjointly cover the non-timezoned timeline, one per day.  For timezoned values, the intervals begin at every minute and therefore overlap. */
  "date": "http://www.w3.org/2001/XMLSchema#date",
  /** dateTime represents instants of time, optionally marked with a particular time zone offset.  Values representing the same instant but having different time zone offsets are equal but not identical. */
  "dateTime": "http://www.w3.org/2001/XMLSchema#dateTime",
  /** decimal represents a subset of the real numbers, which can be represented by decimal numerals. The ·value space· of decimal is the set of numbers that can be obtained by dividing an integer by a non-negative power of ten, i.e., expressible as i / 10n where i and n are integers and n ≥ 0. Precision is not reflected in this value space; the number 2.0 is not distinct from the number 2.00. The order relation on decimal is the order relation on real numbers, restricted to this subset. */
  "decimal": "http://www.w3.org/2001/XMLSchema#decimal",
  /** The double datatype is patterned after the IEEE double-precision 64-bit floating point datatype [IEEE 754-2008].  Each floating point datatype has a value space that is a subset of the rational numbers.  Floating point numbers are often used to approximate arbitrary real numbers. */
  "double": "http://www.w3.org/2001/XMLSchema#double",
  /** duration is a datatype that represents durations of time.  The concept of duration being captured is drawn from those of [ISO 8601], specifically durations without fixed endpoints. */
  "duration": "http://www.w3.org/2001/XMLSchema#duration",
  /** The float datatype is patterned after the IEEE single-precision 32-bit floating point datatype [IEEE 754-2008].  Its value space is a subset of the rational numbers.  Floating point numbers are often used to approximate arbitrary real numbers. */
  "float": "http://www.w3.org/2001/XMLSchema#float",
  /** int is ·derived· from long by setting the value of ·maxInclusive· to be 2147483647 and ·minInclusive· to be -2147483648.  The ·base type· of int is long. */
  "int": "http://www.w3.org/2001/XMLSchema#int",
  /** integer is ·derived· from decimal by fixing the value of ·fractionDigits· to be 0 and disallowing the trailing decimal point.  This results in the standard mathematical concept of the integer numbers.  The ·value space· of integer is the infinite set {...,-2,-1,0,1,2,...}.  The ·base type· of integer is decimal. */
  "integer": "http://www.w3.org/2001/XMLSchema#integer",
  /** long is ·derived· from integer by setting the value of ·maxInclusive· to be 9223372036854775807 and ·minInclusive· to be -9223372036854775808. The ·base type· of long is integer. */
  "long": "http://www.w3.org/2001/XMLSchema#long",
  /** negativeInteger is ·derived· from nonPositiveInteger by setting the value of ·maxInclusive· to be -1.  This results in the standard mathematical concept of the negative integers.  The ·value space· of negativeInteger is the infinite set {...,-2,-1}.  The ·base type· of negativeInteger is nonPositiveInteger. */
  "negativeInteger": "http://www.w3.org/2001/XMLSchema#negativeInteger",
  "nonNegativeInteger": "http://www.w3.org/2001/XMLSchema#nonNegativeInteger",
  /** nonPositiveInteger is ·derived· from integer by setting the value of ·maxInclusive· to be 0.  This results in the standard mathematical concept of the non-positive integers. The ·value space· of nonPositiveInteger is the infinite set {...,-2,-1,0}.  The ·base type· of nonPositiveInteger is integer. */
  "nonPositiveInteger": "http://www.w3.org/2001/XMLSchema#nonPositiveInteger",
  /** nonNegativeInteger is ·derived· from integer by setting the value of ·minInclusive· to be 0.  This results in the standard mathematical concept of the non-negative integers. The ·value space· of nonNegativeInteger is the infinite set {0,1,2,...}.  The ·base type· of nonNegativeInteger is integer. */
  "positiveInteger": "http://www.w3.org/2001/XMLSchema#positiveInteger",
  /** short is ·derived· from int by setting the value of ·maxInclusive· to be 32767 and ·minInclusive· to be -32768.  The ·base type· of short is int. */
  "short": "http://www.w3.org/2001/XMLSchema#short",
  /** The string datatype represents character strings in XML. */
  "string": "http://www.w3.org/2001/XMLSchema#string",
  /** time represents instants of time that recur at the same point in each calendar day, or that occur in some arbitrary calendar day. */
  "time": "http://www.w3.org/2001/XMLSchema#time",
  /** unsignedInt is ·derived· from unsignedLong by setting the value of ·maxInclusive· to be 4294967295.  The ·base type· of unsignedInt is unsignedLong. */
  "unsignedInt": "http://www.w3.org/2001/XMLSchema#unsignedInt",
  /** unsignedShort is ·derived· from unsignedInt by setting the value of ·maxInclusive· to be 65535.  The ·base type· of unsignedShort is unsignedInt. */
  "unsignedShort": "http://www.w3.org/2001/XMLSchema#unsignedShort",
  /** unsignedLong is ·derived· from nonNegativeInteger by setting the value of ·maxInclusive· to be 18446744073709551615.  The ·base type· of unsignedLong is nonNegativeInteger. */
  "unsingedLong": "http://www.w3.org/2001/XMLSchema#unsingedLong",
  /** unsignedByte is ·derived· from unsignedShort by setting the value of ·maxInclusive· to be 255.  The ·base type· of unsignedByte is unsignedShort. */
  "usignedByte": "http://www.w3.org/2001/XMLSchema#usignedByte"
};
var _xsd = { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#" };
var xsd = {
  /** anyURI represents an Internationalized Resource Identifier Reference (IRI).  An anyURI value can be absolute or relative, and may have an optional fragment identifier (i.e., it may be an IRI Reference).  This type should be used when the value fulfills the role of an IRI, as defined in [RFC 3987] or its successor(s) in the IETF Standards Track. */
  "anyURI": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#anyURI", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#anyURI" },
  /** base64Binary represents arbitrary Base64-encoded binary data.  For base64Binary data the entire binary stream is encoded using the Base64 Encoding defined in [RFC 3548], which is derived from the encoding described in [RFC 2045]. */
  "base64Binary": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#base64Binary", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#base64Binary" },
  /** boolean represents the values of two-valued logic. */
  "boolean": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#boolean", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#boolean" },
  /** byte is ·derived· from short by setting the value of ·maxInclusive· to be 127 and ·minInclusive· to be -128. The ·base type· of byte is short. */
  "byte": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#byte", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#byte" },
  /** date represents top-open intervals of exactly one day in length on the timelines of dateTime, beginning on the beginning moment of each day, up to but not including the beginning moment of the next day).  For non-timezoned values, the top-open intervals disjointly cover the non-timezoned timeline, one per day.  For timezoned values, the intervals begin at every minute and therefore overlap. */
  "date": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#date", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#date" },
  /** dateTime represents instants of time, optionally marked with a particular time zone offset.  Values representing the same instant but having different time zone offsets are equal but not identical. */
  "dateTime": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#dateTime", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#dateTime" },
  /** decimal represents a subset of the real numbers, which can be represented by decimal numerals. The ·value space· of decimal is the set of numbers that can be obtained by dividing an integer by a non-negative power of ten, i.e., expressible as i / 10n where i and n are integers and n ≥ 0. Precision is not reflected in this value space; the number 2.0 is not distinct from the number 2.00. The order relation on decimal is the order relation on real numbers, restricted to this subset. */
  "decimal": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#decimal", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#decimal" },
  /** The double datatype is patterned after the IEEE double-precision 64-bit floating point datatype [IEEE 754-2008].  Each floating point datatype has a value space that is a subset of the rational numbers.  Floating point numbers are often used to approximate arbitrary real numbers. */
  "double": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#double", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#double" },
  /** duration is a datatype that represents durations of time.  The concept of duration being captured is drawn from those of [ISO 8601], specifically durations without fixed endpoints. */
  "duration": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#duration", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#duration" },
  /** The float datatype is patterned after the IEEE single-precision 32-bit floating point datatype [IEEE 754-2008].  Its value space is a subset of the rational numbers.  Floating point numbers are often used to approximate arbitrary real numbers. */
  "float": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#float", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#float" },
  /** int is ·derived· from long by setting the value of ·maxInclusive· to be 2147483647 and ·minInclusive· to be -2147483648.  The ·base type· of int is long. */
  "int": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#int", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#int" },
  /** integer is ·derived· from decimal by fixing the value of ·fractionDigits· to be 0 and disallowing the trailing decimal point.  This results in the standard mathematical concept of the integer numbers.  The ·value space· of integer is the infinite set {...,-2,-1,0,1,2,...}.  The ·base type· of integer is decimal. */
  "integer": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#integer", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#integer" },
  /** long is ·derived· from integer by setting the value of ·maxInclusive· to be 9223372036854775807 and ·minInclusive· to be -9223372036854775808. The ·base type· of long is integer. */
  "long": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#long", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#long" },
  /** negativeInteger is ·derived· from nonPositiveInteger by setting the value of ·maxInclusive· to be -1.  This results in the standard mathematical concept of the negative integers.  The ·value space· of negativeInteger is the infinite set {...,-2,-1}.  The ·base type· of negativeInteger is nonPositiveInteger. */
  "negativeInteger": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#negativeInteger", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#negativeInteger" },
  "nonNegativeInteger": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#nonNegativeInteger", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#nonNegativeInteger" },
  /** nonPositiveInteger is ·derived· from integer by setting the value of ·maxInclusive· to be 0.  This results in the standard mathematical concept of the non-positive integers. The ·value space· of nonPositiveInteger is the infinite set {...,-2,-1,0}.  The ·base type· of nonPositiveInteger is integer. */
  "nonPositiveInteger": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#nonPositiveInteger", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#nonPositiveInteger" },
  /** nonNegativeInteger is ·derived· from integer by setting the value of ·minInclusive· to be 0.  This results in the standard mathematical concept of the non-negative integers. The ·value space· of nonNegativeInteger is the infinite set {0,1,2,...}.  The ·base type· of nonNegativeInteger is integer. */
  "positiveInteger": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#positiveInteger", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#positiveInteger" },
  /** short is ·derived· from int by setting the value of ·maxInclusive· to be 32767 and ·minInclusive· to be -32768.  The ·base type· of short is int. */
  "short": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#short", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#short" },
  /** The string datatype represents character strings in XML. */
  "string": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#string", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#string" },
  /** time represents instants of time that recur at the same point in each calendar day, or that occur in some arbitrary calendar day. */
  "time": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#time", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#time" },
  /** unsignedInt is ·derived· from unsignedLong by setting the value of ·maxInclusive· to be 4294967295.  The ·base type· of unsignedInt is unsignedLong. */
  "unsignedInt": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#unsignedInt", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#unsignedInt" },
  /** unsignedShort is ·derived· from unsignedInt by setting the value of ·maxInclusive· to be 65535.  The ·base type· of unsignedShort is unsignedInt. */
  "unsignedShort": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#unsignedShort", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#unsignedShort" },
  /** unsignedLong is ·derived· from nonNegativeInteger by setting the value of ·maxInclusive· to be 18446744073709551615.  The ·base type· of unsignedLong is nonNegativeInteger. */
  "unsingedLong": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#unsingedLong", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#unsingedLong" },
  /** unsignedByte is ·derived· from unsignedShort by setting the value of ·maxInclusive· to be 255.  The ·base type· of unsignedByte is unsignedShort. */
  "usignedByte": { termType: "NamedNode", value: "http://www.w3.org/2001/XMLSchema#usignedByte", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2001/XMLSchema#usignedByte" }
};

// src/ontologies/skos.ts
var _SKOS = "http://www.w3.org/2004/02/skos/core#";
var SKOS = {
  "core": "http://www.w3.org/2004/02/skos/core",
  /** A meaningful collection of concepts. */
  "Collection": "http://www.w3.org/2004/02/skos/core#Collection",
  /** An idea or notion; a unit of thought. */
  "Concept": "http://www.w3.org/2004/02/skos/core#Concept",
  /** A set of concepts, optionally including statements about semantic relationships between those concepts. */
  "ConceptScheme": "http://www.w3.org/2004/02/skos/core#ConceptScheme",
  /** An ordered collection of concepts, where both the grouping and the ordering are meaningful. */
  "OrderedCollection": "http://www.w3.org/2004/02/skos/core#OrderedCollection",
  /** An alternative lexical label for a resource. */
  "altLabel": "http://www.w3.org/2004/02/skos/core#altLabel",
  /** skos:broadMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes. */
  "broadMatch": "http://www.w3.org/2004/02/skos/core#broadMatch",
  /** Relates a concept to a concept that is more general in meaning. */
  "broader": "http://www.w3.org/2004/02/skos/core#broader",
  /** By convention, skos:broaderTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
  "broaderTransitive": "http://www.w3.org/2004/02/skos/core#broaderTransitive",
  /** A note about a modification to a concept. */
  "changeNote": "http://www.w3.org/2004/02/skos/core#changeNote",
  /** skos:closeMatch is used to link two concepts that are sufficiently similar that they can be used interchangeably in some information retrieval applications. In order to avoid the possibility of "compound errors" when combining mappings across more than two concept schemes, skos:closeMatch is not declared to be a transitive property. */
  "closeMatch": "http://www.w3.org/2004/02/skos/core#closeMatch",
  /** A statement or formal explanation of the meaning of a concept. */
  "definition": "http://www.w3.org/2004/02/skos/core#definition",
  /** A note for an editor, translator or maintainer of the vocabulary. */
  "editorialNote": "http://www.w3.org/2004/02/skos/core#editorialNote",
  /** skos:exactMatch is used to link two concepts, indicating a high degree of confidence that the concepts can be used interchangeably across a wide range of information retrieval applications. skos:exactMatch is a transitive property, and is a sub-property of skos:closeMatch. */
  "exactMatch": "http://www.w3.org/2004/02/skos/core#exactMatch",
  /** An example of the use of a concept. */
  "example": "http://www.w3.org/2004/02/skos/core#example",
  /** Relates, by convention, a concept scheme to a concept which is topmost in the broader/narrower concept hierarchies for that scheme, providing an entry point to these hierarchies. */
  "hasTopConcept": "http://www.w3.org/2004/02/skos/core#hasTopConcept",
  /** A lexical label for a resource that should be hidden when generating visual displays of the resource, but should still be accessible to free text search operations. */
  "hiddenLabel": "http://www.w3.org/2004/02/skos/core#hiddenLabel",
  /** A note about the past state/use/meaning of a concept. */
  "historyNote": "http://www.w3.org/2004/02/skos/core#historyNote",
  /** Relates a resource (for example a concept) to a concept scheme in which it is included. */
  "inScheme": "http://www.w3.org/2004/02/skos/core#inScheme",
  /** Relates two concepts coming, by convention, from different schemes, and that have comparable meanings */
  "mappingRelation": "http://www.w3.org/2004/02/skos/core#mappingRelation",
  /** Relates a collection to one of its members. */
  "member": "http://www.w3.org/2004/02/skos/core#member",
  /** Relates an ordered collection to the RDF list containing its members. */
  "memberList": "http://www.w3.org/2004/02/skos/core#memberList",
  /** skos:narrowMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes. */
  "narrowMatch": "http://www.w3.org/2004/02/skos/core#narrowMatch",
  /** Relates a concept to a concept that is more specific in meaning. */
  "narrower": "http://www.w3.org/2004/02/skos/core#narrower",
  /** By convention, skos:narrowerTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
  "narrowerTransitive": "http://www.w3.org/2004/02/skos/core#narrowerTransitive",
  /** A notation, also known as classification code, is a string of characters such as "T58.5" or "303.4833" used to uniquely identify a concept within the scope of a given concept scheme. */
  "notation": "http://www.w3.org/2004/02/skos/core#notation",
  /** A general note, for any purpose. */
  "note": "http://www.w3.org/2004/02/skos/core#note",
  /** The preferred lexical label for a resource, in a given language. */
  "prefLabel": "http://www.w3.org/2004/02/skos/core#prefLabel",
  /** Relates a concept to a concept with which there is an associative semantic relationship. */
  "related": "http://www.w3.org/2004/02/skos/core#related",
  /** skos:relatedMatch is used to state an associative mapping link between two conceptual resources in different concept schemes. */
  "relatedMatch": "http://www.w3.org/2004/02/skos/core#relatedMatch",
  /** A note that helps to clarify the meaning and/or the use of a concept. */
  "scopeNote": "http://www.w3.org/2004/02/skos/core#scopeNote",
  /** Links a concept to a concept related by meaning. */
  "semanticRelation": "http://www.w3.org/2004/02/skos/core#semanticRelation",
  /** Relates a concept to the concept scheme that it is a top level concept of. */
  "topConceptOf": "http://www.w3.org/2004/02/skos/core#topConceptOf"
};
var _skos = { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#" };
var skos = {
  "core": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core" },
  /** A meaningful collection of concepts. */
  "Collection": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#Collection", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#Collection" },
  /** An idea or notion; a unit of thought. */
  "Concept": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#Concept", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#Concept" },
  /** A set of concepts, optionally including statements about semantic relationships between those concepts. */
  "ConceptScheme": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#ConceptScheme", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#ConceptScheme" },
  /** An ordered collection of concepts, where both the grouping and the ordering are meaningful. */
  "OrderedCollection": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#OrderedCollection", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#OrderedCollection" },
  /** An alternative lexical label for a resource. */
  "altLabel": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#altLabel", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#altLabel" },
  /** skos:broadMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes. */
  "broadMatch": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#broadMatch", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#broadMatch" },
  /** Relates a concept to a concept that is more general in meaning. */
  "broader": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#broader", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#broader" },
  /** By convention, skos:broaderTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
  "broaderTransitive": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#broaderTransitive", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#broaderTransitive" },
  /** A note about a modification to a concept. */
  "changeNote": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#changeNote", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#changeNote" },
  /** skos:closeMatch is used to link two concepts that are sufficiently similar that they can be used interchangeably in some information retrieval applications. In order to avoid the possibility of "compound errors" when combining mappings across more than two concept schemes, skos:closeMatch is not declared to be a transitive property. */
  "closeMatch": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#closeMatch", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#closeMatch" },
  /** A statement or formal explanation of the meaning of a concept. */
  "definition": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#definition", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#definition" },
  /** A note for an editor, translator or maintainer of the vocabulary. */
  "editorialNote": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#editorialNote", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#editorialNote" },
  /** skos:exactMatch is used to link two concepts, indicating a high degree of confidence that the concepts can be used interchangeably across a wide range of information retrieval applications. skos:exactMatch is a transitive property, and is a sub-property of skos:closeMatch. */
  "exactMatch": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#exactMatch", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#exactMatch" },
  /** An example of the use of a concept. */
  "example": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#example", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#example" },
  /** Relates, by convention, a concept scheme to a concept which is topmost in the broader/narrower concept hierarchies for that scheme, providing an entry point to these hierarchies. */
  "hasTopConcept": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#hasTopConcept", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#hasTopConcept" },
  /** A lexical label for a resource that should be hidden when generating visual displays of the resource, but should still be accessible to free text search operations. */
  "hiddenLabel": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#hiddenLabel", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#hiddenLabel" },
  /** A note about the past state/use/meaning of a concept. */
  "historyNote": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#historyNote", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#historyNote" },
  /** Relates a resource (for example a concept) to a concept scheme in which it is included. */
  "inScheme": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#inScheme", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#inScheme" },
  /** Relates two concepts coming, by convention, from different schemes, and that have comparable meanings */
  "mappingRelation": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#mappingRelation", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#mappingRelation" },
  /** Relates a collection to one of its members. */
  "member": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#member", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#member" },
  /** Relates an ordered collection to the RDF list containing its members. */
  "memberList": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#memberList", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#memberList" },
  /** skos:narrowMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes. */
  "narrowMatch": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#narrowMatch", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#narrowMatch" },
  /** Relates a concept to a concept that is more specific in meaning. */
  "narrower": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#narrower", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#narrower" },
  /** By convention, skos:narrowerTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
  "narrowerTransitive": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#narrowerTransitive", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#narrowerTransitive" },
  /** A notation, also known as classification code, is a string of characters such as "T58.5" or "303.4833" used to uniquely identify a concept within the scope of a given concept scheme. */
  "notation": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#notation", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#notation" },
  /** A general note, for any purpose. */
  "note": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#note", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#note" },
  /** The preferred lexical label for a resource, in a given language. */
  "prefLabel": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#prefLabel", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#prefLabel" },
  /** Relates a concept to a concept with which there is an associative semantic relationship. */
  "related": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#related", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#related" },
  /** skos:relatedMatch is used to state an associative mapping link between two conceptual resources in different concept schemes. */
  "relatedMatch": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#relatedMatch", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#relatedMatch" },
  /** A note that helps to clarify the meaning and/or the use of a concept. */
  "scopeNote": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#scopeNote", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#scopeNote" },
  /** Links a concept to a concept related by meaning. */
  "semanticRelation": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#semanticRelation", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#semanticRelation" },
  /** Relates a concept to the concept scheme that it is a top level concept of. */
  "topConceptOf": { termType: "NamedNode", value: "http://www.w3.org/2004/02/skos/core#topConceptOf", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2004/02/skos/core#topConceptOf" }
};

// src/ontologies/skos-xl.ts
var _SKOS_XL = "http://www.w3.org/2008/05/skos-xl#";
var SKOS_XL = {
  "skos_xl": "http://www.w3.org/2008/05/skos-xl",
  /** A special class of lexical entities. */
  "Label": "http://www.w3.org/2008/05/skos-xl#Label",
  /** The property skosxl:altLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:altLabel. */
  "altLabel": "http://www.w3.org/2008/05/skos-xl#altLabel",
  /** The property skosxl:hiddenLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:hiddenLabel. */
  "hiddenLabel": "http://www.w3.org/2008/05/skos-xl#hiddenLabel",
  /** The property skosxl:labelRelation is used for representing binary ('direct') relations between instances of the class skosxl:Label. */
  "labelRelation": "http://www.w3.org/2008/05/skos-xl#labelRelation",
  /** The property skosxl:literalForm is used to give the literal form of an skosxl:Label. */
  "literalForm": "http://www.w3.org/2008/05/skos-xl#literalForm",
  /** The property skosxl:prefLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:prefLabel. */
  "prefLabel": "http://www.w3.org/2008/05/skos-xl#prefLabel"
};
var _skos_xl = { termType: "NamedNode", value: "http://www.w3.org/2008/05/skos-xl#", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2008/05/skos-xl#" };
var skos_xl = {
  "skos_xl": { termType: "NamedNode", value: "http://www.w3.org/2008/05/skos-xl", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2008/05/skos-xl" },
  /** A special class of lexical entities. */
  "Label": { termType: "NamedNode", value: "http://www.w3.org/2008/05/skos-xl#Label", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2008/05/skos-xl#Label" },
  /** The property skosxl:altLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:altLabel. */
  "altLabel": { termType: "NamedNode", value: "http://www.w3.org/2008/05/skos-xl#altLabel", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2008/05/skos-xl#altLabel" },
  /** The property skosxl:hiddenLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:hiddenLabel. */
  "hiddenLabel": { termType: "NamedNode", value: "http://www.w3.org/2008/05/skos-xl#hiddenLabel", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2008/05/skos-xl#hiddenLabel" },
  /** The property skosxl:labelRelation is used for representing binary ('direct') relations between instances of the class skosxl:Label. */
  "labelRelation": { termType: "NamedNode", value: "http://www.w3.org/2008/05/skos-xl#labelRelation", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2008/05/skos-xl#labelRelation" },
  /** The property skosxl:literalForm is used to give the literal form of an skosxl:Label. */
  "literalForm": { termType: "NamedNode", value: "http://www.w3.org/2008/05/skos-xl#literalForm", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2008/05/skos-xl#literalForm" },
  /** The property skosxl:prefLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:prefLabel. */
  "prefLabel": { termType: "NamedNode", value: "http://www.w3.org/2008/05/skos-xl#prefLabel", equals: (other) => other && (other.termType === "NamedNode" || other.type === "NamedNode") && other.value === "http://www.w3.org/2008/05/skos-xl#prefLabel" }
};

// src/ontologies/sh.ts
var _SH = "http://www.w3.org/ns/shacl#";
var SH = {
  /** The base class of validation results, typically not instantiated directly. */
  "AbstractResult": "http://www.w3.org/ns/shacl#AbstractResult",
  /** A constraint component that can be used to test whether a value node conforms to all members of a provided list of shapes. */
  "AndConstraintComponent": "http://www.w3.org/ns/shacl#AndConstraintComponent",
  "AndConstraintComponent_and": "http://www.w3.org/ns/shacl#AndConstraintComponent-and",
  /** The node kind of all blank nodes. */
  "BlankNode": "http://www.w3.org/ns/shacl#BlankNode",
  /** The node kind of all blank nodes or IRIs. */
  "BlankNodeOrIRI": "http://www.w3.org/ns/shacl#BlankNodeOrIRI",
  /** The node kind of all blank nodes or literals. */
  "BlankNodeOrLiteral": "http://www.w3.org/ns/shacl#BlankNodeOrLiteral",
  /** A constraint component that can be used to verify that each value node is an instance of a given type. */
  "ClassConstraintComponent": "http://www.w3.org/ns/shacl#ClassConstraintComponent",
  "ClassConstraintComponent_class": "http://www.w3.org/ns/shacl#ClassConstraintComponent-class",
  /** A constraint component that can be used to indicate that focus nodes must only have values for those properties that have been explicitly enumerated via sh:property/sh:path. */
  "ClosedConstraintComponent": "http://www.w3.org/ns/shacl#ClosedConstraintComponent",
  "ClosedConstraintComponent_closed": "http://www.w3.org/ns/shacl#ClosedConstraintComponent-closed",
  "ClosedConstraintComponent_ignoredProperties": "http://www.w3.org/ns/shacl#ClosedConstraintComponent-ignoredProperties",
  /** The class of constraint components. */
  "ConstraintComponent": "http://www.w3.org/ns/shacl#ConstraintComponent",
  /** A constraint component that can be used to restrict the datatype of all value nodes. */
  "DatatypeConstraintComponent": "http://www.w3.org/ns/shacl#DatatypeConstraintComponent",
  "DatatypeConstraintComponent_datatype": "http://www.w3.org/ns/shacl#DatatypeConstraintComponent-datatype",
  /** A constraint component that can be used to verify that the set of value nodes is disjoint with the the set of nodes that have the focus node as subject and the value of a given property as predicate. */
  "DisjointConstraintComponent": "http://www.w3.org/ns/shacl#DisjointConstraintComponent",
  "DisjointConstraintComponent_disjoint": "http://www.w3.org/ns/shacl#DisjointConstraintComponent-disjoint",
  /** A constraint component that can be used to verify that the set of value nodes is equal to the set of nodes that have the focus node as subject and the value of a given property as predicate. */
  "EqualsConstraintComponent": "http://www.w3.org/ns/shacl#EqualsConstraintComponent",
  "EqualsConstraintComponent_equals": "http://www.w3.org/ns/shacl#EqualsConstraintComponent-equals",
  /** A constraint component that can be used to verify that a given node expression produces true for all value nodes. */
  "ExpressionConstraintComponent": "http://www.w3.org/ns/shacl#ExpressionConstraintComponent",
  "ExpressionConstraintComponent_expression": "http://www.w3.org/ns/shacl#ExpressionConstraintComponent-expression",
  /** The class of SHACL functions. */
  "Function": "http://www.w3.org/ns/shacl#Function",
  /** A constraint component that can be used to verify that one of the value nodes is a given RDF node. */
  "HasValueConstraintComponent": "http://www.w3.org/ns/shacl#HasValueConstraintComponent",
  "HasValueConstraintComponent_hasValue": "http://www.w3.org/ns/shacl#HasValueConstraintComponent-hasValue",
  /** The node kind of all IRIs. */
  "IRI": "http://www.w3.org/ns/shacl#IRI",
  /** The node kind of all IRIs or literals. */
  "IRIOrLiteral": "http://www.w3.org/ns/shacl#IRIOrLiteral",
  /** A constraint component that can be used to exclusively enumerate the permitted value nodes. */
  "InConstraintComponent": "http://www.w3.org/ns/shacl#InConstraintComponent",
  "InConstraintComponent_in": "http://www.w3.org/ns/shacl#InConstraintComponent-in",
  /** The severity for an informational validation result. */
  "Info": "http://www.w3.org/ns/shacl#Info",
  /** The class of constraints backed by a JavaScript function. */
  "JSConstraint": "http://www.w3.org/ns/shacl#JSConstraint",
  "JSConstraint_js": "http://www.w3.org/ns/shacl#JSConstraint-js",
  /** A constraint component with the parameter sh:js linking to a sh:JSConstraint containing a sh:script. */
  "JSConstraintComponent": "http://www.w3.org/ns/shacl#JSConstraintComponent",
  /** Abstract base class of resources that declare an executable JavaScript. */
  "JSExecutable": "http://www.w3.org/ns/shacl#JSExecutable",
  /** The class of SHACL functions that execute a JavaScript function when called. */
  "JSFunction": "http://www.w3.org/ns/shacl#JSFunction",
  /** Represents a JavaScript library, typically identified by one or more URLs of files to include. */
  "JSLibrary": "http://www.w3.org/ns/shacl#JSLibrary",
  /** The class of SHACL rules expressed using JavaScript. */
  "JSRule": "http://www.w3.org/ns/shacl#JSRule",
  /** The class of targets that are based on JavaScript functions. */
  "JSTarget": "http://www.w3.org/ns/shacl#JSTarget",
  /** The (meta) class for parameterizable targets that are based on JavaScript functions. */
  "JSTargetType": "http://www.w3.org/ns/shacl#JSTargetType",
  /** A SHACL validator based on JavaScript. This can be used to declare SHACL constraint components that perform JavaScript-based validation when used. */
  "JSValidator": "http://www.w3.org/ns/shacl#JSValidator",
  /** A constraint component that can be used to enumerate language tags that all value nodes must have. */
  "LanguageInConstraintComponent": "http://www.w3.org/ns/shacl#LanguageInConstraintComponent",
  "LanguageInConstraintComponent_languageIn": "http://www.w3.org/ns/shacl#LanguageInConstraintComponent-languageIn",
  /** A constraint component that can be used to verify that each value node is smaller than all the nodes that have the focus node as subject and the value of a given property as predicate. */
  "LessThanConstraintComponent": "http://www.w3.org/ns/shacl#LessThanConstraintComponent",
  "LessThanConstraintComponent_lessThan": "http://www.w3.org/ns/shacl#LessThanConstraintComponent-lessThan",
  /** A constraint component that can be used to verify that every value node is smaller than all the nodes that have the focus node as subject and the value of a given property as predicate. */
  "LessThanOrEqualsConstraintComponent": "http://www.w3.org/ns/shacl#LessThanOrEqualsConstraintComponent",
  "LessThanOrEqualsConstraintComponent_lessThanOrEquals": "http://www.w3.org/ns/shacl#LessThanOrEqualsConstraintComponent-lessThanOrEquals",
  /** The node kind of all literals. */
  "Literal": "http://www.w3.org/ns/shacl#Literal",
  /** A constraint component that can be used to restrict the maximum number of value nodes. */
  "MaxCountConstraintComponent": "http://www.w3.org/ns/shacl#MaxCountConstraintComponent",
  "MaxCountConstraintComponent_maxCount": "http://www.w3.org/ns/shacl#MaxCountConstraintComponent-maxCount",
  /** A constraint component that can be used to restrict the range of value nodes with a maximum exclusive value. */
  "MaxExclusiveConstraintComponent": "http://www.w3.org/ns/shacl#MaxExclusiveConstraintComponent",
  "MaxExclusiveConstraintComponent_maxExclusive": "http://www.w3.org/ns/shacl#MaxExclusiveConstraintComponent-maxExclusive",
  /** A constraint component that can be used to restrict the range of value nodes with a maximum inclusive value. */
  "MaxInclusiveConstraintComponent": "http://www.w3.org/ns/shacl#MaxInclusiveConstraintComponent",
  "MaxInclusiveConstraintComponent_maxInclusive": "http://www.w3.org/ns/shacl#MaxInclusiveConstraintComponent-maxInclusive",
  /** A constraint component that can be used to restrict the maximum string length of value nodes. */
  "MaxLengthConstraintComponent": "http://www.w3.org/ns/shacl#MaxLengthConstraintComponent",
  "MaxLengthConstraintComponent_maxLength": "http://www.w3.org/ns/shacl#MaxLengthConstraintComponent-maxLength",
  /** A constraint component that can be used to restrict the minimum number of value nodes. */
  "MinCountConstraintComponent": "http://www.w3.org/ns/shacl#MinCountConstraintComponent",
  "MinCountConstraintComponent_minCount": "http://www.w3.org/ns/shacl#MinCountConstraintComponent-minCount",
  /** A constraint component that can be used to restrict the range of value nodes with a minimum exclusive value. */
  "MinExclusiveConstraintComponent": "http://www.w3.org/ns/shacl#MinExclusiveConstraintComponent",
  "MinExclusiveConstraintComponent_minExclusive": "http://www.w3.org/ns/shacl#MinExclusiveConstraintComponent-minExclusiv