AMV:Algorithm Metadata Vocabulary

IRI:
https://w3id.org/amv
Version IRI:
https://w3id.org/amv/1.0
Current version :
V1.0
Authors :
Biswanath Dutta (https://sites.google.com/view/bdutta)
Jyotima Patel (https://www.linkedin.com/in/jyotima-patel-61220411b)
Publisher :
Indian Statistical Institute (https://www.isibang.ac.in/)
Other visualisation :
Ontology source - WebVowl
https://creativecommons.org/publicdomain/zero/1.0/

Table of Content

  1. Introduction
  2. Classes
  3. Object Properties
  4. Data Properties
  5. Named Individuals
  6. Annotation Properties
  7. Namespace Declarations

Introduction

AMV v1.0 was first published on June 16, 2021. This is the revised version dated on February 6, 2023.

Classes

Academic articlec back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/AcademicArticle

A scholarly academic article, typically published in a journal.
has super-classes
Articlec
has members
network flow theoryni, on a routing problemni

Academic disciplinec back to ToC or Class ToC

IRI: http://www.wikidata.org/entity/Q11862829

Academic field of study or profession.
is equivalent to
Academic disciplinec

Academic disciplinec back to ToC or Class ToC

IRI: https://w3id.org/amv#pub_Discipline

A branch of knowledge.
is in domain of
branch Ofop, has branchop, subject ofop
is in range of
branch Ofop, has branchop, subjectop
has members
computer scienceni, linear algebrani, mathematicsni, statisticsni

Agentc back to ToC or Class ToC

IRI: http://xmlns.com/foaf/0.1/Agent

A resource that acts or has the power to act. Example of Agents include person and organization.
has sub-classes
Organizationc, Personc
is in domain of
contributor ofop, creator ofop, personal mailboxdp, publisher ofop
is in range of
contributorop, creatorop, publisherop

Algorithmc back to ToC or Class ToC

IRI: http://www.wikidata.org/entity/Q8366

Unambiguous specification of how to solve a class of problems.(https://www.wikidata.org/wiki/Q8366)
is equivalent to
Algorithmc

Algorithmc back to ToC or Class ToC

IRI: https://w3id.org/amv#Algorithm

It is a finite and unambiguous sequence of computer implementable instructions to perform a certain task. This can be a simple process, such as adding two numbers together, or a complex function, such as adding effects to an image. It can be expressed within a finite amount of space and time and in a well-defined formal language.
has super-classes
computes solution toop some Problemc
is a type ofop some Algorithmic Typec
appeared Inop some Information Resourcec
inputdp some string
number Of Stepsdp some non negative integer
outputdp some string
titledp only string
titledp min 1
is in domain of
accessibilitydp, analysis function typeop, appeared Inop, computes solution toop, constraintdp, data Structure Usedop, edge Casedp, flexibledp, form of expressionop, has message complexityop, has metricop, has performance metricop, has space complexityop, has subalgorithmop, has time complexityop, input descriptiondp, is a type ofop, loop constructop, mathematical propertyop, number Of Nested Loopsdp, number Of Stepsdp, offline algorithmdp, online algorithmdp, optimaldp, readabledp, subalgorithm ofop, time of earliest written recorddp
is in range of
algorithm type forop, analysis function type ofop, available algorithmop, containsop, data Structure Used Inop, form Of expression ofop, has subalgorithmop, loop construct ofop, mathematicalPropertyUsedop, message complexity ofop, metric ofop, performance metric ofop, space complexity ofop, subalgorithm ofop, time complexity ofop
has members
a* algorithmni, bead sortni, bellman ford algorithmni, best bin firstni, block sortni, bubble sortni, christofides algorithmni, data extraction from sbrni, dijkstras algorithmni, encoder decoderni, fast multipole methodni, heap sortni, insertion sortni, merge sortni, quick sortni, selection sortni, smooth sortni, tim sortni, user query processing algorithmni

AlgorithmAnalysisFunctionc back to ToC or Class ToC

IRI: https://w3id.org/amv#AlgorithmAnalysisFunction

Time complexity corresponds to the amount of time required for an algorithm to run over the provided input in order to generate the required output. Analysis of this helps to predict the resources that an algorithm will take to finish execution.
is in domain of
analysis function type ofop
is in range of
analysis function typeop
has members
constant functionsni, cubic functions and polynomialsni, exponential functionsni, linear functionsni, logarithmic functionni, quadritic functionni

Algorithmic Typec back to ToC or Class ToC

IRI: https://w3id.org/amv#AlgorithmicType

The different type of algorithmic techniques that are used to solve the various existing problems in the most optimized manner. This classification is neither exhaustive nor disjoint.
is in domain of
algorithm type forop
is in range of
is a type ofop
has members
Recursive algorithmni, approximation algortihmni, backtracking algorithmni, branch and bound algorithmni, brute force algorithmni, divide and conquer algorithmni, dynamic programming algorithmni, greedy algorithmni, randomized algorithmni

Articlec back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Article

A written composition in prose, usually nonfiction, on a specific topic, forming an independent part of a book or other publication, as a newspaper or magazine.
has super-classes
Documentc
has sub-classes
Academic articlec
is in domain of
published inop
is in range of
hasArticleop

Bookc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Book

A written or printed work of fiction or nonfiction, usually on sheets of paper fastened or bound together within covers.
has super-classes
Documentc
has sub-classes
Proceedingsc

Book Sectionc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/BookSection

A section of a book.
has super-classes
Document Partc
has sub-classes
Chapterc

Chapterc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Chapter

A chapter of a book.
has super-classes
Book Sectionc

Collected Documentc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/CollectedDocument

A document that simultaneously contains other documents.
has super-classes
Documentc
has sub-classes
Edited Bookc, Issuec

Collectionc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Collection

A collection of Documents or Collections.
has super-classes
Information Resourcec
has sub-classes
Periodicalc, Seriesc, Websitec

Combinatorial optimization problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#CombinatorialOptimizationProblem

has super-classes
Optimization problemc

Combinatorial Problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#CombinatorialProblem

Combinatorial algorithms are computational procedures which are designed to help solve combinatorial problems. Combinatorial problems are problems involving arrangements of elements from a finite set and selections from a finite set.
has super-classes
Problemc
has members
sortingni

Commentc back to ToC or Class ToC

IRI: http://schema.org/Comment

A comment on an item - for example, a comment on a blog post. The comment's content is expressed via the text property, and its topic via about, properties shared with all CreativeWorks.
is in domain of
comment ofop
is in range of
commentop

Computational Geometry Problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#ComputationalGeometryProblem

Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry.
has super-classes
Problemc

Data Structurec back to ToC or Class ToC

IRI: https://w3id.org/amv#DataStructure

A data structure is a named location that can be used to store and organize data.
is in domain of
data Structure Used Inop
is in range of
data Structure Usedop
has members
Hypergraphni, arrayni, dictionaryni, graph data structureni, hash tableni, linked listni, listni, priority queueni, queueni, treeni, tupleni, undirected graphni

Data Structures Problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#DataStructuresProblem

Solving problems related to data structure i.e a particular way of organizing data in a computer so that it can be used effectively.
has super-classes
Problemc

Documentc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Document

A document (noun) is a bounded physical representation of body of information designed with the capacity (and usually intent) to communicate. A document may manifest symbolic, diagrammatic or sensory-representational information.
is equivalent to
Documentc
has super-classes
Information Resourcec
has sub-classes
Articlec, Bookc, Collected Documentc, Document Partc, Manualc, Manuscriptc, Patentc, Reference Sourcec, Reportc, Thesisc, Webpagec

Documentc back to ToC or Class ToC

IRI: http://xmlns.com/foaf/0.1/Document

The Document class represents those things which are, broadly conceived, 'documents'.
has super-classes
Information Resourcec
has sub-classes
Imagec

Document Partc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/DocumentPart

a distinct part of a larger document or collected document.
has super-classes
Documentc
has sub-classes
Book Sectionc, Excerptc, Slidec

Edited Bookc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/EditedBook

An edited book.
has super-classes
Collected Documentc

Excerptc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Excerpt

A passage selected from a larger work.
has super-classes
Document Partc

Form of expressionc back to ToC or Class ToC

IRI: https://w3id.org/amv#FormOfExpression

The available form of expression/ notation of an algorithm. For example, Flowcharts, pseudocode, control tables, etc. (source: https://en.wikipedia.org/wiki/Algorithm)
is in domain of
form Of expression ofop
is in range of
form of expressionop
has members
computer programni, control tableni, drakon chartni, flowchartni, natural languageni, pseudocodeni

Graph Problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#GraphProblem

A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.
has super-classes
Problemc
has sub-classes
Hard Problemc, Polynomial Time Problemc

Hard Problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#HardProblem

Any graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when restricted to graphs in special classes.
has super-classes
Graph Problemc

Imagec back to ToC or Class ToC

IRI: http://xmlns.com/foaf/0.1/Image

The class Image is a sub-class of Document corresponding to those documents which are images.
has super-classes
Documentc
is in domain of
depictsop, is input image ofop, is output image ofop
is in range of
depictionop, input imageop, output imageop

Implementationc back to ToC or Class ToC

IRI: https://w3id.org/amv#Implementation

A manifestation of a technical specification or algorithm as a program, software component, or other computer system through computer programming and deployment (source: https://en.wikipedia.org/wiki/Implementation).
has super-classes
implementation ofop some Algorithmc
programming languageop some Programming languagec
runs on Operating Systemop some Operating systemc
is in domain of
byte sizedp, cpu time limitdp, implementation ofop, programming languageop, runs on Operating Systemop
is in range of
has implementationop, operatingSystemForop, programming language used inop

Information Resourcec back to ToC or Class ToC

IRI: https://w3id.org/amv#pub_InformationResource

An information resource.
has sub-classes
Collectionc, Documentc, Documentc
is in domain of
containsop
is in range of
appeared Inop

Issuec back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Issue

something that is printed or published and distributed, esp. a given number of a periodical.
has super-classes
Collected Documentc

Journalc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Journal

A periodical of scholarly journal Articles.
has super-classes
Periodicalc
has members
quart appl math.ni
is disjoint with
Magazinec

LicenseDocumentc back to ToC or Class ToC

IRI: http://purl.org/dc/terms/LicenseDocument

A legal document giving official permission to do something with a Resource.
has super-classes
Rights Statementc
is in domain of
license ofop
is in range of
licenseop
has members
apacheni, copyleftni, creative commons attribution3.0ni, creative commons attribution4.0ni, g n uni, g p lni

Loop constructc back to ToC or Class ToC

IRI: https://w3id.org/amv#LoopConstruct

The type of loop best suited when an algorithm is implemented in any desired programming language. The loop types are for loop, while loop, do-while loop.
is in domain of
loop construct ofop
is in range of
loop constructop
has members
do whileni, forni, whileni

Magazinec back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Magazine

A periodical of magazine Articles. A magazine is a publication that is issued periodically, usually bound in a paper cover, and typically contains essays, stories, poems, etc., by many writers, and often photographs and drawings, frequently specializing in a particular subject or area, as hobbies, news, or sports.
has super-classes
Periodicalc
is disjoint with
Journalc

Manualc back to ToC or Class ToC

IRI: https://w3id.org/amv#pub_Manual

A small reference book, especially one giving instructions.
has super-classes
Documentc

Manuscriptc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Manuscript

An unpublished Document, which may also be submitted to a publisher for publication.
has super-classes
Documentc

Mathematical propertyc back to ToC or Class ToC

IRI: https://w3id.org/amv#MathematicalProperties

The mathematical concept used in the algorithm to tackle the problem. This includes set theoty, linear algebra, graph theory etc.
is in domain of
defining formuladp, mathematicalPropertyUsedop
is in range of
mathematical propertyop
has members
differential calculusni, gaussian eliminationni, general algebrani, graph theoryni, linear algebrani, theory of setsni, theory of statistics and probabilityni

Message complexityc back to ToC or Class ToC

IRI: https://w3id.org/amv#MessageComplexity

The number of messages passed. This is an important measure, primarily applicable in case of distributed algorithms.
has super-classes
Metricc
is in domain of
average message complexitydp, best case message complexitydp, message complexity ofop, worst case message complexitydp
is in range of
has message complexityop

Metricc back to ToC or Class ToC

IRI: https://w3id.org/amv#Metric

has sub-classes
Message complexityc, Performance metricc, Space complexityc, Time complexityc
is in domain of
metric ofop
is in range of
has metricop

Numerical Problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#NumericalProblem

Numerical algorithms are behind designing shapes (e.g. shapes for cars, planes, fonts), computing intensities for displaying graphics, animating moving objects, studying the spread of diseases, modelling the orbit of planets and satellites, supporting search engines such as google, and many more practical problems.
has super-classes
Problemc

Operating systemc back to ToC or Class ToC

IRI: https://schema.org/OperatingSystem

An Operating System (OS) is an interface between a computer user and computer hardware. An operating system is a software which performs all the basic tasks like file management, memory management, process management, handling input and output, and controlling peripheral devices such as disk drives and printers.
is in domain of
operatingSystemForop
is in range of
runs on Operating Systemop
has members
m s d o sni, microsoft windowsni, red hat linuxni, unixni

Optimization problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#OptimizationProblem

An optimization problem is the problem of finding the best solution from all feasible solutions.
has super-classes
Problemc
has sub-classes
Combinatorial optimization problemc

Organizationc back to ToC or Class ToC

IRI: http://xmlns.com/foaf/0.1/Organization

An agent belonging to some social institutions such as companies, associations etc, that has a collective goal.
has super-classes
Agentc
is in domain of
affiliation ofop
is in range of
affliationop
has members
at& t bell laboratoriesni
is disjoint with
Personc

Patentc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Patent

A document describing the exclusive right granted by a government to an inventor to manufacture, use, or sell an invention for a certain number of years.
has super-classes
Documentc

Performance metricc back to ToC or Class ToC

IRI: https://w3id.org/amv#PerformanceMetric

Performance metrics (e.g., accuracy, precision, recall) are used to evaluate different algorithms.
has super-classes
Metricc
is in domain of
accuracydp, performance metric ofop, precisiondp, recalldp
is in range of
has performance metricop
has members
bellman form performance metricni

Periodicalc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Periodical

A group of related documents issued at regular intervals.
has super-classes
Collectionc
has sub-classes
Journalc, Magazinec
is in domain of
hasArticleop
is in range of
published inop
is disjoint with
Seriesc, Websitec

Personc back to ToC or Class ToC

IRI: http://xmlns.com/foaf/0.1/Person

A human.
has super-classes
Agentc
is in domain of
affliationop, first namedp, last namedp
is in range of
affiliation ofop
has members
delbert ray fulkersonni, derrick henry lehmerni, donald knuthni, edouard lucasni, edward w forgyni, george dantzigni, j h haltonni, james h morrisni, jillian beardwoodni, john hammersleyni, john mauchlyni, ken thompsonni, llewellyn thomasni, per austrinni, peter mc ilroyni, selmer m johnsonni, stuart lloydni, tobias dantzigni, vaughan prattni, william wesley petersonni
is disjoint with
Organizationc

Polynomial Time Problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#PolynomialTimeProblem

Polynomial time problem means that an algorithm exists for its solution such that the number of steps in the algorithm is bounded by a polynomial function of n, where n corresponds to the length of the input for the problem.
has super-classes
Graph Problemc
has members
Shortest path problemni, assignment problemni, user query processingni

Problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#Problem

The various problems for which an algorithm is written.
has sub-classes
Combinatorial Problemc, Computational Geometry Problemc, Data Structures Problemc, Graph Problemc, Numerical Problemc, Optimization problemc, Set Problemc, String problemc
is in domain of
available algorithmop, has subproblemop, problem descriptiondp, subproblem ofop
is in range of
computes solution toop, has subproblemop, subproblem ofop
has members
n-body problemni, neural machine translationni

Proceedingsc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Proceedings

A compilation of documents published from an event, such as a conference.
has super-classes
Bookc

Programming languagec back to ToC or Class ToC

IRI: http://www.wikidata.org/entity/Q9143

language designed to communicate instructions to a machine.
is equivalent to
Programming languagec

Programming languagec back to ToC or Class ToC

IRI: https://w3id.org/amv#ProgrammingLanguage

Language designed to communicate instructions to a machine Programming languages are used in computer programming to implement algorithms.
is in domain of
programming language used inop
is in range of
programming languageop
has members
adani, basicni, cni, c++ni, fortranni, javani, lispni, matlabni, p h pni, pascalni, pythonni, rni

Reference Sourcec back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/ReferenceSource

A document that presents authoritative reference information, such as a dictionary or encylopedia.
has super-classes
Documentc

Reportc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Report

A document describing an account or statement describing in detail an event, situation, or the like, usually as the result of observation, inquiry, etc..
has super-classes
Documentc

Rights Statementc back to ToC or Class ToC

IRI: http://purl.org/dc/terms/RightsStatement

A statement about the intellectual property rights (IPR) held in or over a Resource, a legal document giving official permission to do something with a resource, or a statement about access rights.
has sub-classes
LicenseDocumentc
is in domain of
access rights ofop, rights ofop
is in range of
access rightsop, rightsop
has members
internalni, publicni

Seriesc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Series

A loose, thematic, collection of Documents, often Books.
has super-classes
Collectionc
is disjoint with
Periodicalc

Set Problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#SetProblem

Sets are collections of symbols whose order is assumed to carry no significance.
has super-classes
Problemc

Slidec back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Slide

A slide in a slideshow.
has super-classes
Document Partc

Space complexityc back to ToC or Class ToC

IRI: https://w3id.org/amv#SpaceComplexity

Space complexity of an algorithm quantifies the amount of space or memory taken by an algorithm to run as a function of the length of the input.
has super-classes
Metricc
is in domain of
average space complexitydp, best case space complexitydp, space complexity ofop, worst case space complexitydp
is in range of
has space complexityop
has members
bellman ford space complexityni

String problemc back to ToC or Class ToC

IRI: https://w3id.org/amv#StringProblem

Strings are defined by the sequence or arrangement of symbols
has super-classes
Problemc

Thesisc back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Thesis

A document created to summarize research findings associated with the completion of an academic degree.
has super-classes
Documentc

Time complexityc back to ToC or Class ToC

IRI: https://w3id.org/amv#TimeComplexity

It represents the number of times a statement is executed.
has super-classes
Metricc
is in domain of
average time complexitydp, best case time complexitydp, time complexity ofop, worst case time complexitydp
is in range of
has time complexityop
has members
bellman ford time complexityni, enco r n n time com1ni

Webpagec back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Webpage

A web page is an online document available (at least initially) on the world wide web. A web page is written first and foremost to appear on the web, as distinct from other online resources such as books, manuscripts or audio documents which use the web primarily as a distribution mechanism alongside other more traditional methods such as print.
has super-classes
Documentc

Websitec back to ToC or Class ToC

IRI: http://purl.org/ontology/bibo/Website

A group of Webpages accessible on the Web.
has super-classes
Collectionc
is disjoint with
Periodicalc

Object Properties

access rightsop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/accessRights

Information about who access the resource or an indication of its security status. Access Rights may include information regarding access or restrictions based on privacy, security, or other policies. Examples of access rights are: Public, Internal, Department (source: https://www.dublincore.org/groups/government/accessRights/)
has super-properties
rightsop
has domain
thingc
has range
Rights Statementc
is inverse of
access rights ofop

access rights ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_accessRightsOf

has super-properties
rights ofop
has domain
Rights Statementc
has range
thingc
is inverse of
access rightsop

affiliation ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#affiliationOf

has domain
Organizationc
has range
Personc
is inverse of
affliationop

affliationop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#affliation

An organization that the person is affiliated with. For example, a school/university.
has domain
Personc
has range
Organizationc
is inverse of
affiliation ofop

algorithm type forop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#algorithmTypeFor

Is an algorithm type for an algorithm.
has domain
Algorithmic Typec
has range
Algorithmc
is inverse of
is a type ofop

analysis function typeop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#analysisFunctionType

The various function types for analysis of algorithms like logarithmic functions, exponential functions etc.
has super-properties
top object property
has domain
Algorithmc
has range
AlgorithmAnalysisFunctionc
is inverse of
analysis function type ofop

analysis function type ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#analysisFunctionTypeOf

has domain
AlgorithmAnalysisFunctionc
has range
Algorithmc
is inverse of
analysis function typeop

appeared Inop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_appearedIn

An algorithm appeared in a publication.
has domain
Algorithmc
has range
Information Resourcec
is inverse of
containsop

available algorithmop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#availableAlgorithm

An algorithm for a given problem.
has domain
Problemc
has range
Algorithmc
is inverse of
computes solution toop

branch Ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_branchOf

has characteristics : transitive

has domain
Academic disciplinec
has range
Academic disciplinec
is inverse of
has branchop

commentop back to ToC or Object Property ToC

IRI: http://schema.org/comment

Comments, typically from users.
has domain
Algorithmc or Implementationc or Information Resourcec
has range
Commentc
is inverse of
comment ofop

comment ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#commentOf

has domain
Commentc
has range
Algorithmc or Implementationc or Information Resourcec
is inverse of
commentop

computes solution toop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#computesSolutionTo

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
The type of problem the algorithm solves.
has domain
Algorithmc
has range
Problemc
is inverse of
available algorithmop

containsop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_contains

has domain
Information Resourcec
has range
Algorithmc
is inverse of
appeared Inop

contributorop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/contributor

An agent who contributes towards the algorithm.
has domain
thingc
has range
Agentc
is inverse of
contributor ofop

contributor ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_contributorOf

has domain
Agentc
has range
thingc
is inverse of
contributorop

creatorop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/creator

The person who created the algorithm.
has domain
thingc
has range
Agentc
is inverse of
creator ofop

creator ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_creatorOf

has domain
Agentc
has range
thingc
is inverse of
creatorop

data Structure Usedop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#dataStructureUsed

The data structure used in an algorithm.
has domain
Algorithmc
has range
Data Structurec
is inverse of
data Structure Used Inop

data Structure Used Inop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#dataStructureUsedIn

has domain
Data Structurec
has range
Algorithmc
is inverse of
data Structure Usedop

depictionop back to ToC or Object Property ToC

IRI: http://xmlns.com/foaf/0.1/depiction

A depiction of some thing.
has sub-properties
input imageop, output imageop
has domain
thingc
has range
Imagec
is inverse of
depictsop

depictsop back to ToC or Object Property ToC

IRI: http://xmlns.com/foaf/0.1/depicts

The depiction property is a relationship between a thing and an Image that depicts it. As such it is an inverse of the depicts relationship.
has domain
Imagec
has range
thingc
is inverse of
depictionop

form of expressionop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#formOfExpression

The form of expression of an Algorithm.
has domain
Algorithmc
has range
Form of expressionc
is inverse of
form Of expression ofop

form Of expression ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#formOfExpressionOf

The form of expression of an Algorithm.
has domain
Form of expressionc
has range
Algorithmc
is inverse of
form of expressionop

generalization ofop back to ToC or Object Property ToC

IRI: http://www.w3.org/ns/prov#generalizationOf

An entity that is a generalization of another. E.g., Distribution sort algorithm is a generalization of Bucket sort.

has characteristics : transitive

has super-properties
relationop
has domain
thingc
has range
thingc
is inverse of
specialization ofop

had derivationop back to ToC or Object Property ToC

IRI: http://www.w3.org/ns/prov#hadDerivation

has characteristics : transitive

has sub-properties
had revisionop, was primary source ofop
has domain
thingc
has range
thingc
is inverse of
was Derived Fromop

had primary sourceop back to ToC or Object Property ToC

IRI: http://www.w3.org/ns/prov#hadPrimarySource

A primary source for a topic refers to something produced by some agent with direct experience and knowledge about the topic, at the time of the topic's study, without benefit from hindsight. Because of the directness of primary sources, they 'speak for themselves' in ways that cannot be captured through the filter of secondary sources. As such, it is important for secondary sources to reference those primary sources from which they were derived, so that their reliability can be investigated. A primary source relation is a particular case of derivation of secondary materials from their primary sources. It is recognized that the determination of primary sources can be up to interpretation, and should be done according to conventions accepted within the application's domain.

has characteristics : transitive

has super-properties
was Derived Fromop
has domain
thingc
has range
thingc
is inverse of
was primary source ofop

had revisionop back to ToC or Object Property ToC

IRI: http://www.w3.org/ns/prov#hadRevision

has characteristics : transitive

has super-properties
had derivationop
has domain
thingc
has range
thingc
is inverse of
was revision ofop

has branchop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_hasBranch

Branch of the academic discipline.

has characteristics : transitive

has domain
Academic disciplinec
has range
Academic disciplinec
is inverse of
branch Ofop

has implementationop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#hasImplementation

The various applications of the algorithm.
has domain
thingc
has range
Implementationc
is inverse of
implementation ofop

has message complexityop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#hasMessageComplexity

has super-properties
has metricop
has domain
Algorithmc
has range
Message complexityc
is inverse of
message complexity ofop

has metricop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#hasMetric

has sub-properties
has message complexityop, has performance metricop, has space complexityop, has time complexityop
has domain
Algorithmc
has range
Metricc
is inverse of
metric ofop

has Partop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/hasPart

A related resource that is included either physically or logically in the described resource.(https://www.dublincore.org/specifications/dublin-core/dcmi-terms/#http://purl.org/dc/terms/isPartOf)

has characteristics : transitive

has super-properties
relationop
has sub-properties
has subalgorithmop, has subproblemop
has domain
thingc
has range
thingc
is inverse of
is Part Ofop

has performance metricop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#hasPerformanceMetric

has super-properties
has metricop
has domain
Algorithmc
has range
Performance metricc
is inverse of
performance metric ofop

has space complexityop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#hasSpaceComplexity

has super-properties
has metricop
has domain
Algorithmc
has range
Space complexityc
is inverse of
space complexity ofop

has subalgorithmop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#hasSubalgorithm

has characteristics : transitive

has super-properties
has Partop
has domain
Algorithmc
has range
Algorithmc
is inverse of
subalgorithm ofop

has subproblemop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#hasSubproblem

a problem that is contingent on or forms a part of another more inclusive problem.

has characteristics : transitive

has super-properties
has Partop
has domain
Problemc
has range
Problemc
is inverse of
subproblem ofop

has time complexityop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#hasTimeComplexity

has super-properties
has metricop
has domain
Algorithmc
has range
Time complexityc
is inverse of
time complexity ofop

has Versionop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/hasVersion

A related resource (e.g., algorithm, program) that is a version, edition, or adaptation of the described resource.

has characteristics : transitive

has super-properties
relationop
has domain
thingc
has range
thingc
is inverse of
is Version Ofop

hasArticleop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_hasArticle

has domain
Periodicalc
has range
Articlec
is inverse of
published inop

implementation ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#implementationOf

The various applications of the algorithm.
has domain
Implementationc
has range
thingc
is inverse of
has implementationop

input imageop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#outputImage

has super-properties
depictionop
has domain
thingc
has range
Imagec
is inverse of
is input image ofop

is a type ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#isATypeOf

The different type of algorithmic techniques that are used to solve the various existing problems in the most optimized manner.This classification is neither exhaustive nor disjoint but highlights the various ways in which a problem can be addressed.
has domain
Algorithmc
has range
Algorithmic Typec
is inverse of
algorithm type forop

is input image ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#isInputImageOf

has super-properties
top object property
has domain
Imagec
has range
thingc
is inverse of
input imageop

is output image ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#isOutputImageOf

has super-properties
top object property
has domain
Imagec
has range
thingc
is inverse of
output imageop

is Part Ofop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/isPartOf

A related resource in which the described resource is physically or logically included.(https://www.dublincore.org/specifications/dublin-core/dcmi-terms/#http://purl.org/dc/terms/isPartOf)

has characteristics : transitive

has super-properties
relationop
has sub-properties
subalgorithm ofop, subproblem ofop
has domain
thingc
has range
thingc
is inverse of
has Partop

is similar toop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#isSimilarTo

A pointer to another, functionally similar thing (or multiple things), for example, an algorithm is similar to another algorithm or algorithms, a problem is similar to another problem or problems, etc.

has characteristics : symmetric

has super-properties
relationop
has domain
thingc
has range
thingc

is Version Ofop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/isVersionOf

A related resource (e.g., algorithm, program) of which the described resource is a version, edition, or adaptation.

has characteristics : transitive

has super-properties
relationop
has domain
thingc
has range
thingc
is inverse of
has Versionop

licenseop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/license

The licence under which the algorithm is published.
has super-properties
rightsop
has domain
thingc
has range
LicenseDocumentc
is inverse of
license ofop

license ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_licenseOf

has super-properties
rights ofop
has domain
LicenseDocumentc
has range
thingc
is inverse of
licenseop

loop constructop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#loopConstruct

The loop best suited for the algorithm.
has domain
Algorithmc
has range
Loop constructc
is inverse of
loop construct ofop

loop construct ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#loopConstructOf

has domain
Loop constructc
has range
Algorithmc
is inverse of
loop constructop

mathematical propertyop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#mathematicalProperty

The mathematical concept used to solve the problem.
has domain
Algorithmc
has range
Mathematical propertyc
is inverse of
mathematicalPropertyUsedop

mathematicalPropertyUsedop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#mathematicalPropertyUsed

has domain
Mathematical propertyc
has range
Algorithmc
is inverse of
mathematical propertyop

message complexity ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#messageComplexityOf

has super-properties
metric ofop
has domain
Message complexityc
has range
Algorithmc
is inverse of
has message complexityop

metric ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#metricOf

has sub-properties
message complexity ofop, performance metric ofop, space complexity ofop, time complexity ofop
has domain
Metricc
has range
Algorithmc
is inverse of
has metricop

operatingSystemForop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#operatingSystemFor

has domain
Operating systemc
has range
Implementationc
is inverse of
runs on Operating Systemop

output imageop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#inputImage

has super-properties
depictionop
has domain
thingc
has range
Imagec
is inverse of
is output image ofop

performance metric ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#performanceMetricOf

has super-properties
metric ofop
has domain
Performance metricc
has range
Algorithmc
is inverse of
has performance metricop

programming languageop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#programmingLanguage

In which all language the implementation of the algorithm/ problem is available.
has domain
Implementationc
has range
Programming languagec
is inverse of
programming language used inop

programming language used inop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#usedInIm

has domain
Programming languagec
has range
Implementationc
is inverse of
programming languageop

published inop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_publishedIn

has domain
Articlec
has range
Periodicalc
is inverse of
hasArticleop

publisherop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/publisher

An entity responsible for making the resource available.
has domain
Algorithmc or Implementationc or Information Resourcec
has range
Agentc
is inverse of
publisher ofop

publisher ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_publisherOf

has domain
Agentc
has range
Algorithmc or Implementationc or Information Resourcec
is inverse of
publisherop

relationop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/relation

A related resource. For example, a Sorting problem is related to a problem Convex Hull.

has characteristics : symmetric

has sub-properties
generalization ofop, has Partop, has Versionop, is Part Ofop, is Version Ofop, is similar toop, specialization ofop
has domain
thingc
has range
thingc

rightsop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/rights

Information about rights held in and over the resource.
has sub-properties
access rightsop, licenseop
has domain
thingc
has range
Rights Statementc
is inverse of
rights ofop

rights ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_rightsOf

has sub-properties
access rights ofop, license ofop
has domain
Rights Statementc
has range
thingc
is inverse of
rightsop

runs on Operating Systemop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#runsOnOperatingSystem

has domain
Implementationc
has range
Operating systemc
is inverse of
operatingSystemForop

space complexity ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#spaceComplexityOf

has super-properties
metric ofop
has domain
Space complexityc
has range
Algorithmc
is inverse of
has space complexityop

specialization ofop back to ToC or Object Property ToC

IRI: http://www.w3.org/ns/prov#specializationOf

An entity that is specialization of (... is a kind of) another entity and shares all aspects of the later including its own specific aspects. E.g., Bucket sort algorithm is a specialization of (a kind of) Distribution sort.

has characteristics : transitive

has super-properties
relationop
has domain
thingc
has range
thingc
is inverse of
generalization ofop

subalgorithm ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#subalgorithmOf

has characteristics : transitive

has super-properties
is Part Ofop
has domain
Algorithmc
has range
Algorithmc
is inverse of
has subalgorithmop

subjectop back to ToC or Object Property ToC

IRI: http://purl.org/dc/terms/subject

A topic of the resource.
has super-properties
top object property
has domain
thingc
has range
Academic disciplinec
is inverse of
subject ofop

subject ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#pub_subjectOf

A topic of the resource for.
has domain
Academic disciplinec
has range
thingc
is inverse of
subjectop

subproblem ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#subproblemOf

has characteristics : transitive

has super-properties
is Part Ofop
has domain
Problemc
has range
Problemc
is inverse of
has subproblemop

time complexity ofop back to ToC or Object Property ToC

IRI: https://w3id.org/amv#timeComplexityOf

has super-properties
metric ofop
has domain
Time complexityc
has range
Algorithmc
is inverse of
has time complexityop

was Derived Fromop back to ToC or Object Property ToC

IRI: http://www.w3.org/ns/prov#wasDerivedFrom

A derivation is a transformation of an entity into another, an update of an entity resulting in a new one, or the construction of a new entity based on a pre-existing entity.

has characteristics : transitive

has sub-properties
had primary sourceop, was revision ofop
has domain
thingc
has range
thingc
is inverse of
had derivationop

was primary source ofop back to ToC or Object Property ToC

IRI: http://www.w3.org/ns/prov#wasPrimarySourceOf

has characteristics : transitive

has super-properties
had derivationop
has domain
thingc
has range
thingc
is inverse of
had primary sourceop

was revision ofop back to ToC or Object Property ToC

IRI: http://www.w3.org/ns/prov#wasRevisionOf

A revision is a derivation for which the resulting entity is a revised version of some original. The implication here is that the resulting entity contains substantial content from the original. Revision is a particular case of derivation.

has characteristics : transitive

has super-properties
was Derived Fromop
has domain
thingc
has range
thingc
is inverse of
had revisionop

Data Properties

accessibilitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#accessibility

The information on access (i.e modify, read, download) to the algorithm.
has domain
Algorithmc
has range
string

accuracydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#accuracy

How close the output will be to a set point.
has domain
Performance metricc
has range
decimal

acronymdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#acronym

has domain
thingc
has range
string

alternative titledp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#alternativeTitle

An alternative title of a resource.
has domain
thingc
has range
string

availabledp back to ToC or Data Property ToC

IRI: http://purl.org/dc/terms/available

Date (often a range) that the resource became or will become available.
has super-properties
datedp
has domain
thingc
has range
literal

average message complexitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#averageMessageComplexity

has domain
Message complexityc
has range
string

average space complexitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#averageSpaceComplexity

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
Space complexity of an algorithm on average.(https://www.wikidata.org/wiki/Property:P3757)
has domain
Space complexityc
has range
string

average time complexitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#averageTimeComplexity

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
Time complexity of an algorithm on average. (https://www.wikidata.org/wiki/Property:P3754)
has domain
Time complexityc
has range
string

best case message complexitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#bestCaseMessageComplexity

has domain
Message complexityc
has range
string

best case space complexitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#bestCaseSpaceComplexity

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
Space complexity of an algorithm at least.(https://www.wikidata.org/wiki/Property:P3756)
has domain
Space complexityc
has range
string

best case time complexitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#bestCaseTimeComplexity

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
Time complexity of an algorithm at least. (https://www.wikidata.org/wiki/Property:P3753)
has domain
Time complexityc
has range
string

bibliographic citationdp back to ToC or Data Property ToC

IRI: http://purl.org/dc/terms/bibliographicCitation

A bibliographic reference for the resource.
has domain
thingc
has range
literal

byte sizedp back to ToC or Data Property ToC

IRI: http://www.w3.org/ns/dcat#byteSize

The size of a distribution in bytes.
has domain
Implementationc
has range
decimal

constraintdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#constraint

Limitations that an algorithm posses.
has domain
Algorithmc
has range
string

cpu time limitdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#cpuTimeLimit

Time taken by CPU while executing the program.(In seconds)
has domain
Implementationc
has range
integer

createddp back to ToC or Data Property ToC

IRI: http://purl.org/dc/terms/created

The date of creation of the algorithm.
has super-properties
datedp
has domain
thingc
has range
literal

datedp back to ToC or Data Property ToC

IRI: http://purl.org/dc/terms/date

A point or period of time associated with an event in the lifecycle of the resource.
has super-properties
top data property
has sub-properties
availabledp, createddp, dateSubmitteddp, modifieddp
has domain
thingc
has range
literal

dateSubmitteddp back to ToC or Data Property ToC

IRI: http://purl.org/dc/terms/dateSubmitted

Date of submission of the resource.
has super-properties
datedp
has domain
thingc
has range
literal

defining formuladp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#definingFormula

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
The mathematical formula used for solving the problem. Mathematical formula representing a theorem or law.
has domain
Mathematical propertyc
has range
string

definitondp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#definition

has domain
thingc
has range
string

descriptiondp back to ToC or Data Property ToC

IRI: http://purl.org/dc/terms/description

A statement that represents something in words. It is the act of describing something. The description can include, for instance, the purpose of a thing, the scope, the area of applications of a thing, the history, etc.
has sub-properties
input descriptiondp, problem descriptiondp
has domain
thingc
has range
string

download linkdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#pub_downloadLink

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
URL which can be used to download a work.
has domain
Algorithmc or Implementationc
has range
any u r i

edge Casedp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#edgeCase

Input values that require special handling in an algorithm. When using the algorithm at an extreme(maximum or minimum) operating parameters.
has domain
Algorithmc
has range
string

excerptdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#excerpt

An excerpt is a contiguous or discontiguous portion, or a passage selected from a larger work or document.
has domain
thingc
has range
string

first namedp back to ToC or Data Property ToC

IRI: http://xmlns.com/foaf/0.1/firstName

The first name of a person.
has domain
Personc
has range
string

flexibledp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#flexible

The algorithm written in such a way that it allows to add new features without changing the existing module.
has domain
Algorithmc
has range
boolean

formal definitiondp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#formalDefinition

has domain
thingc
has range
string

homepagedp back to ToC or Data Property ToC

IRI: http://xmlns.com/foaf/0.1/homepage

A homepage for some thing.
has domain
thingc
has range
any u r i

identifierdp back to ToC or Data Property ToC

IRI: http://purl.org/dc/terms/identifier

An unambiguous reference to the resource within a given context.
has domain
thingc
has range
literal

inputdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#input

Something that is operated on by any process or system. An algorithm can have zero or more inputs.
has domain
Algorithmc or Implementationc
has range
string

input descriptiondp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#inputDescription

Input description of an algorithm.
has super-properties
descriptiondp
has domain
Algorithmc
has range
string

landingPagedp back to ToC or Data Property ToC

IRI: http://www.w3.org/ns/dcat#landingPage

A Web page that can be navigated to in a Web browser to gain access to the catalog, a dataset, its distributions and/or additional information.
has super-properties
pagedp
has domain
thingc
has range
string

last namedp back to ToC or Data Property ToC

IRI: http://xmlns.com/foaf/0.1/lastName

The last name of a person.
has domain
Personc
has range
string

library URIdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#libraryURI

Unique identifier of the central place where the algorithm is stored.
has domain
Algorithmc or Implementationc
has range
any u r i

modifieddp back to ToC or Data Property ToC

IRI: http://purl.org/dc/terms/modified

Date on which the resource was changed.
has super-properties
datedp
has domain
thingc
has range
literal

namedp back to ToC or Data Property ToC

IRI: http://xmlns.com/foaf/0.1/name

The name for some thing.
has domain
thingc
has range
string

number Of Nested Loopsdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#numberOfNestedLoops

The number of nested loops in an algorithm.
has domain
Algorithmc
has range
non negative integer

number Of Stepsdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#numberOfSteps

Total number of steps that the algorithm takes to solve a certain problem.
has domain
Algorithmc
has range
non negative integer

offline algorithmdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#offlineAlgorithm

The complete dataset is required to start processing.
has domain
Algorithmc
has range
boolean

online algorithmdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#onlineAlgorithm

The data can be feed while processing.
has domain
Algorithmc
has range
boolean

optimaldp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#optimal

An algorithm is optimal means the time complexity in the worst case is a lower bound of the function that describes the time complexity in the worst case of a problem that the algorithm in question solves.
has domain
Algorithmc
has range
boolean

outputdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#output

Output after processing the input.
has domain
Algorithmc or Implementationc
has range
string

pagedp back to ToC or Data Property ToC

IRI: http://xmlns.com/foaf/0.1/page

A page or document about this thing.
has sub-properties
landingPagedp
has domain
thingc
has range
string

personal mailboxdp back to ToC or Data Property ToC

IRI: http://xmlns.com/foaf/0.1/mbox

A personal mailbox, ie. an Internet mailbox associated with exactly one owner, the first owner of this mailbox. This is a 'static inverse functional property', in that there is (across time and change) at most one individual that ever has any particular value for foaf:mbox.
has domain
Agentc
has range
string

precisiondp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#precision

It is a measure of quality, higher precision means algorithm returns more relevant results than irrelevant ones.
has domain
Performance metricc
has range
float

problem descriptiondp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#problemDescription

A description providing the problem statement.
has super-properties
descriptiondp
has domain
Problemc
has range
string

ratingdp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#pub_rating

Rating given on the basis of usefulness of a thing.
has domain
thingc
has range
integer

read medp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#pub_readme

Provide a description or Link to algorithm, or similar resource "Readme page".
has domain
thingc
has range
string

readabledp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#readable

Is the algorithm readable/understandable to the user.
has domain
Algorithmc
has range
boolean

recalldp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#recall

percentage of total relevent result correctly classified by the algorithm.
has domain
Performance metricc
has range
float

time of earliest written recorddp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#firstWrittenRecord

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
First time a subject was mentioned in writing.(https://www.wikidata.org/wiki/Property:P1249)
has domain
Algorithmc
has range
date time

titledp back to ToC or Data Property ToC

IRI: http://purl.org/dc/terms/title

A name given to the resource (e.g., book, algorithm, research software).
has domain
thingc
has range
string

versiondp back to ToC or Data Property ToC

IRI: http://www.w3.org/ns/dcat#version

The version number of a resource.
has domain
Algorithmc or Implementationc
has range
literal

worst case message complexitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#worstCaseMessageComplexity

has domain
Message complexityc
has range
string

worst case space complexitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#worstCaseSpaceComplexity

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
Space complexity of an algorithm at most.(https://www.wikidata.org/wiki/Property:P3755)
has domain
Space complexityc
has range
string

worst case time complexitydp back to ToC or Data Property ToC

IRI: https://w3id.org/amv#worstCaseTimeComplexity

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
Time complexity of an algorithm at most. (https://www.wikidata.org/wiki/Property:P3752)
has domain
Time complexityc
has range
string

Named Individuals

a formal basis for the heuristic determination of minimum cost pathsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#AFormalBasisForTheHeuristicDeterminationOfMinimumCostPaths

has facts
createddp "01-01-1968T00:00:00"^^string
creatorop bertram raphael
creatorop nils nilson
creatorop peter hart
identifierdp "https://ieeexplore.ieee.org/document/4082128"^^literal
titledp "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"^^string

a* algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#A*Algorithm

belongs to
Algorithmc
has facts
descriptiondp "A* Algorithm is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency."^^string
has Versionop dijkstras algorithm
relationop bellman ford algorithm
titledp "A* Algorithm"^^string
computes solution toop Shortest path problem
data Structure Usedop graph data structure
has space complexityop a* space complexity
has time complexityop a* time complexity
appeared Inop a formal basis for the heuristic determination of minimum cost paths

a* space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#A*SpaceComplexity

has facts
worst case space complexitydp "O(|V|)"^^string

a* time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#A*TimeComplexity

has facts
worst case time complexitydp "O(|E|)"^^string

adani back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Ada

belongs to
Programming languagec

algorithm232 heap sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Algorithm232-HeapSort

has facts
creatorop j w j williams
identifierdp "https://doi.org/10.1145/512274.512284"^^literal
titledp "Algorithm 232 - HeapSort"^^string

algorithm64: quicksortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Algorithm64:Quicksort

has facts
createddp "1961-01-01T00:00:00"^^literal
creatorop c a r hoare
identifierdp "https://doi.org/10.1145/366622.366644"^^literal
titledp "Algorithm 64: Quicksort"^^string

apacheni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Apache

belongs to
LicenseDocumentc

approximation algortihmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#ApproximationAlgortihm

belongs to
Algorithmic Typec

arne kutznerni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#ArneKutzner

has facts
namedp "Arne Kutzner"^^string

arrayni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Array

belongs to
Data Structurec
has facts
namedp "Array"^^string

assignment problemni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#AssignmentProblem

belongs to
Polynomial Time Problemc

at& t bell laboratoriesni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#At&TBellLaboratories

belongs to
Organizationc

backtracking algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BacktrackingAlgorithm

Backtracking algorithms are based on a depth-first recursive search.
belongs to
Algorithmic Typec

basicni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Basic

belongs to
Programming languagec

bead sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BeadSort

belongs to
Algorithmc
has facts
createddp "2002-01-01T00:00:00"^^literal
creatorop cristian s calude
creatorop joshua j arulanandham
creatorop michael dinneen
descriptiondp "A natural sorting algorithm."^^string
identifierdp "https://rosettacode.org/wiki/Sorting_algorithms/Bead_sort"^^literal
titledp "Bead Sort"^^string
computes solution toop sorting
has implementationop bead sort in python
has space complexityop bead sort space complexity
has time complexityop bead sort time complexity
inputdp "A set of positive integers."^^string
output imageop bead sort r
input imageop bead sort l
appeared Inop bead sort: a natural sorting algorithm

bead sort in pythonni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BeadSortInPython

has facts
identifierdp "https://en.wikipedia.org/wiki/Bead_sort#Implementation"^^literal
titledp "Bead Sort In Python"^^string
programming languageop python

bead sort lni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BeadSort-L

has facts
identifierdp "https://upload.wikimedia.org/wikipedia/commons/thumb/c/cf/BeadSort-Figure1.svg/220px-BeadSort-Figure1.svg.png"^^literal
titledp "Bead Sort-L"^^string

bead sort rni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BeadSort-R

has facts
identifierdp "https://upload.wikimedia.org/wikipedia/commons/thumb/9/92/BeadSort-Figure2.svg/220px-BeadSort-Figure2.svg.png"^^literal
titledp "Bead Sort -R"^^string

bead sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BeadSortSpaceComplexity

has facts
worst case time complexitydp "O(n^2)"^^string

bead sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BeadSortTimeComplexity

has facts
average time complexitydp "O(S)"^^string
best case time complexitydp "O(n)"^^string
worst case time complexitydp "O(S)"^^string

bead sort: a natural sorting algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BeadSort:ANaturalSortingAlgorithm

has facts
createddp "2002-01-01T00:00:00"^^literal
creatorop cristian s calude
creatorop joshua j arulanandham
creatorop michael dinneen
identifierdp "https://web.archive.org/web/20170809110409/https://www.cs.auckland.ac.nz/~jaru003/research/publications/journals/beadsort.pdf"^^literal
titledp "Bead–Sort: A Natural Sorting Algorithm"^^string

bellman ford algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BellmanFordAlgorithm

belongs to
Algorithmc
has facts
createddp "1958"^^literal
descriptiondp "The Bellman-Ford algorithm was first proposed by Alfonso Shimbel (1955), but is instead named after Richard Bellman and Lester Ford Jr., who published it in 1958 and 1956, respectively."^^string
descriptiondp "The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is capable of handling graphs in which some of the edge weights are negative numbers."^^string
relationop dijkstras algorithm
titledp "Bellman-Ford Algorithm"^^string
computes solution toop Shortest path problem
data Structure Usedop graph data structure
has space complexityop bellman ford space complexity
has time complexityop bellman ford time complexity
inputdp "Graph and a source vertex src."^^string
input descriptiondp "Works on negative or positive vertex, in a directed weighted graph."^^string
is a type ofop dynamic programming algorithm
loop constructop for
outputdp "Shortest distance to all vertices from src. If there is a negative weight cycle, then shortest distances are not calculated, negative weight cycle is reported."^^string
appeared Inop network flow theory
appeared Inop on a routing problem

bellman ford space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BellmanFordSpaceComplexity

belongs to
Space complexityc
has facts
best case space complexitydp "O(N)"^^string
worst case space complexitydp "θ(|V|)"^^string

bellman ford time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BellmanFordTimeComplexity

belongs to
Time complexityc
has facts
best case time complexitydp "θ(|E|)"^^string
worst case time complexitydp "θ(|V||E|)"^^string

bellman form performance metricni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BellmanFormPerformanceMetric

belongs to
Performance metricc

bertram raphaelni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BertramRaphael

has facts
namedp "Bertram Raphael"^^string

best bin firstni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BestBinFirst

belongs to
Algorithmc
has facts
descriptiondp "Best bin first is a search algorithm that is designed to efficiently find an approximate solution to the nearest neighbor search problem in very-high-dimensional spaces."^^string
titledp "Best bin first"^^string

block sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BlockSort

belongs to
Algorithmc
has facts
createddp "2008-01-01T00:00:00"^^literal
creatorop arne kutzner
creatorop pok son kim
descriptiondp "Efficient sorting algorithm that combines insert and merge operations."^^string
titledp "Block Sort"^^string
computes solution toop sorting
has space complexityop block sort space complexity
has time complexityop block sort time complexity
appeared Inop ratio based stable in place merging

block sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BlockSortSpaceComplexity

has facts
worst case space complexitydp "O(1)"^^string

block sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BlockSortTimeComplexity

has facts
average time complexitydp "O(nlog n)"^^string
best case time complexitydp "O(n)"^^string
worst case time complexitydp "O(nlog n)"^^string

branch and bound algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BranchAndBoundAlgorithm

Branch and bound algorithms are generally used for optimization problems. As the algorithm progresses, a tree of subproblems is formed. The original problem is considered the “root problem”. A method is used to construct an upper and lower bound for a given problem. At each node, apply the bounding methods.
belongs to
Algorithmic Typec

brute force algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BruteForceAlgorithm

A brute force algorithm simply tries all possibilities until a satisfactory solution is found.
belongs to
Algorithmic Typec

bubble sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BubbleSort

belongs to
Algorithmc
has facts
descriptiondp "Simple sorting algorithm that works by repeatedly swapping the adjacent elements."^^string
titledp "Bubble sort"^^string
computes solution toop sorting
data Structure Usedop array
has implementationop bubble sort pseudocode implementation
has space complexityop bubble sort space complexity
has time complexityop bubble sort time complexity

bubble sort pseudocode implementationni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BubbleSortPseudocodeImplementation

has facts
identifierdp "https://en.wikipedia.org/wiki/Bubble_sort#Implementation"^^literal
titledp "Bubble Sort Pseudocode Implementation"^^string

bubble sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BubbleSortSpaceComplexity

has facts
worst case space complexitydp "O(1)"^^string

bubble sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#BubbleSortTimeComplexity

has facts
average time complexitydp "O(n^2)"^^string
best case time complexitydp "O(n)"^^string
worst case time complexitydp "O(n^2)"^^string

cni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#C

belongs to
Programming languagec

c a r hoareni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#CARHoare

has facts
namedp "C. A. R. Hoare"^^string

c++ni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#C++

belongs to
Programming languagec

christofides algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#ChristofidesAlgorithm

belongs to
Algorithmc

code for dijkstras algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#CodeForDijkstrasAlgorithm

has facts
identifierdp "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Pseudocode"^^literal
titledp "Code for Dijkstra's algorithm"^^string

computer programni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#ComputerProgram

belongs to
Form of expressionc

computer scienceni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#ComputerScience

belongs to
Academic disciplinec

constant functionsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#ConstantFunctions

belongs to
AlgorithmAnalysisFunctionc

control tableni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#ControlTable

belongs to
Form of expressionc

copyleftni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Copyleft

belongs to
LicenseDocumentc

creative commons attribution3.0ni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#CreativeCommonsAttribution3.0

belongs to
LicenseDocumentc

creative commons attribution4.0ni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#CreativeCommonsAttribution4.0

belongs to
LicenseDocumentc

cristian s caludeni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#CristianSCalude

has facts
namedp "Cristian S. Calude"^^string

cubic functions and polynomialsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#CubicFunctionsAndPolynomials

belongs to
AlgorithmAnalysisFunctionc

data extraction from sbrni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DataExtractionFromSbr

belongs to
Algorithmc
has facts
createddp "2022-01-01T00:00:00"^^literal
descriptiondp "Extract the data of 75 algorithmic problems from Stony Brooks Algorithm Repository in tabular form."^^string
identifierdp "https://github.com/jyotimapatel/Algorithmic_Knowledge_Graph/blob/main/scrape.py"^^literal
titledp "Data Extraction From Sbr"^^string
data Structure Usedop dictionary
data Structure Usedop list
form of expressionop pseudocode
has implementationop data extraction implementation
inputdp "https://algorist.com/algorist.html"^^string
loop constructop for
number Of Stepsdp "9"^^non negative integer
outputdp "https://github.com/jyotimapatel/Algorithmic_Knowledge_Graph/blob/main/Problem(75).csv"^^string

data extraction implementationni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DataExtractionImplementation

has facts
identifierdp "https://github.com/jyotimapatel/Algorithmic_Knowledge_Graph/blob/main/Problem(75).csv"^^literal
titledp "Data Extraction Implementation"^^string
programming languageop python

decoding recurrent neural networkni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DecodingRecurrentNeuralNetwork

has facts
computes solution toop decoding target language
appeared Inop sequence to sequence learning with neural networks

delbert ray fulkersonni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DelbertRayFulkerson

belongs to
Personc

derrick henry lehmerni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DerrickHenryLehmer

belongs to
Personc

dictionaryni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Dictionary

belongs to
Data Structurec

differential calculusni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DifferentialCalculus

belongs to
Mathematical propertyc

dijkastras algorithm time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DijkastrasAlgorithmTimeComplexity

has facts
worst case time complexitydp "O(|E|+|V| log |V|)"^^string

dijkstras algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DijkstrasAlgorithm

belongs to
Algorithmc
has facts
creatorop edsger w dijkstra
descriptiondp "An algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks."^^string
descriptiondp "Dijkstra's algorithm is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree."^^string
relationop bellman ford algorithm
titledp "Dijkstra's Algorithm"^^string
computes solution toop Shortest path problem
form of expressionop pseudocode
has implementationop code for dijkstras algorithm
has time complexityop dijkastras algorithm time complexity
inputdp "a directed and weighted graph consisting of 2 or more nodes."^^string
input descriptiondp "Works on only positive- weight edges in a directed, acyclic graph. The input generally represented by an adjacency matrix or list, and a start node."^^string
is a type ofop greedy algorithm
outputdp "a set of edges depicting the shortest path to each destination node."^^string

divide and conquer algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DivideAndConquerAlgorithm

A divide and conquer algorithm consists of two parts: (i) Divide the problem into smaller subproblems of the same type, and solve these subproblems recursively; (ii) Combine the solutions to the subproblems into a solution to the original proble.
belongs to
Algorithmic Typec

do whileni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DoWhile

belongs to
Loop constructc

donald knuthni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DonaldKnuth

belongs to
Personc

drakon chartni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Drakon-chart

belongs to
Form of expressionc

dynamic programming algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#DynamicProgrammingAlgorithm

A dynamic programming algorithm remembers past results and uses them to find new results. Dynamic programming is generally used for optimization problems, where multiple solutions exist but need to find the “best” one.
belongs to
Algorithmic Typec

edouard lucasni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#EdouardLucas

belongs to
Personc

edsger w dijkstrani back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#EdsgerWDijkstra

has facts
namedp "Edsger W. Dijkstra"^^string

edward w forgyni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#EdwardWForgy

belongs to
Personc

enco r n n time com1ni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#EncoRNNTimeCom1

belongs to
Time complexityc
has facts
best case time complexitydp "O(N)"^^string

encoder decoderni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#EncoderDecoder

belongs to
Algorithmc
has facts
computes solution toop neural machine translation
has subalgorithmop decoding recurrent neural network
has subalgorithmop encoding recurrent neural network
has time complexityop encoder decoder time complexity

encoder decoder time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#EncoderDecoderTimeComplexity

has facts
best case time complexitydp "O(N)"^^string

encoding recurrent neural networkni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#EncodingRecurrentNeuralNetwork

has facts
createddp "2014-01-01T00:00:00"^^literal
creatorop ilya sutskever
creatorop oriol vinyals
creatorop quoc v le
descriptiondp "It uses deep neural network layers and converts the input words to corresponding hidden vectors. Each vector represents the current word and the context of the word."^^string
titledp "Encoding Recurrent Neural Network"^^string
computes solution toop encoding source language
has time complexityop enco r n n time com1
input descriptiondp "Series of symbols in some language that need to be translated."^^string
appeared Inop sequence to sequence learning with neural networks

exponential functionsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#ExponentialFunctions

belongs to
AlgorithmAnalysisFunctionc

fast multipole methodni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#FastMultipoleMethod

belongs to
Algorithmc
has facts
descriptiondp "The fast multipole method (FMM) is a numerical technique that was developed to speed up the calculation of long-ranged forces in the n-body problem."^^string
titledp "Fast multipole method"^^string
computes solution toop n-body problem

flowchartni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Flowchart

belongs to
Form of expressionc

forni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#For

belongs to
Loop constructc

fortranni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Fortran

belongs to
Programming languagec

g n uni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#GNU

belongs to
LicenseDocumentc

g p lni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#GPL

belongs to
LicenseDocumentc

gaussian eliminationni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#GaussianElimination

belongs to
Mathematical propertyc

general algebrani back to ToC or Named Individual ToC

IRI: https://www.isibang.ac.in/ns/GeneralAlgebra

belongs to
Mathematical propertyc

george dantzigni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#GeorgeDantzig

belongs to
Personc

Graphni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Graph

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
has facts
definitondp "A set of items connected by edges. Each item is called a vertex or node. Formally, a graph is a set of vertices and a binary relation between vertices, adjacency."^^string

graph data structureni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#GraphDataStructure

belongs to
Data Structurec

graph theoryni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#GraphTheory

belongs to
Mathematical propertyc

greedy algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#GreedyAlgorithm

belongs to
Algorithmic Typec

hash tableni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#HashTable

belongs to
Data Structurec

heap sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#HeapSort

belongs to
Algorithmc
has facts
creatorop j w j williams
descriptiondp "Heapsort is a comparison-based sorting algorithm. Heapsort can be thought of as an improved selection sort: like selection sort, heapsort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element from it and inserting it into the sorted region."^^string
identifierdp "https://rosettacode.org/wiki/Sorting_algorithms/Heapsort"^^literal
titledp "Heap Sort"^^string
computes solution toop sorting
data Structure Usedop array
has space complexityop heap sort space complexity
has time complexityop heap sort time complexity
appeared Inop algorithm232 heap sort

heap sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#HeapSortSpaceComplexity

has facts
best case space complexitydp "O(n)"^^string

heap sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#HeapSortTimeComplexity

has facts
average time complexitydp "O(nlog n)"^^string
best case time complexitydp "O(n)"^^string
worst case time complexitydp "O(nlog n)"^^string

Hypergraphni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Hypergraph

is defined by
https://www.isibang.ac.in/ns/amv/ontology.ttl
belongs to
Data Structurec
has facts
specialization ofop Graph
definitondp "A graph whose hyperedges connect two or more vertices."^^string
formal definitiondp "A hypergraph G can be defined as a pair (V, E), where V is a set of vertices, and E is a set of hyperedges between the vertices. Each hyperedge is a set of vertices: E ⊆ {{u, v, …} ∈ 2V}. (Hyperedges are undirected.)"^^string

ilya sutskeverni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#IlyaSutskever

has facts
namedp "Ilya Sutskever"^^string

insertion sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#InsertionSort

belongs to
Algorithmc
has facts
descriptiondp "Sorting algorithm that, at each iteration, inserts the current input element into the suitable position between the already sorted elements."^^string
identifierdp "https://rosettacode.org/wiki/Sorting_algorithms/Insertion_sort"^^literal
titledp "Insertion Sort"^^string
computes solution toop sorting
data Structure Usedop array
has space complexityop insertion sort space complexity
has time complexityop insertion sort time complexity
online algorithmdp "false"^^boolean

insertion sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#InsertionSortSpaceComplexity

has facts
worst case space complexitydp "O(1)"^^string

insertion sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#InsertionSortTimeComplexity

has facts
average time complexitydp "O(n^2)"^^string
best case time complexitydp "O(n)"^^string
worst case time complexitydp "O(n^2)"^^string

internalni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Internal

belongs to
Rights Statementc

j h haltonni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#JHHalton

belongs to
Personc

j w j williamsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#JWJWilliams

has facts
namedp "J.W.J Williams"^^string

james h morrisni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#JamesHMorris

belongs to
Personc

javani back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Java

belongs to
Programming languagec

jillian beardwoodni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#JillianBeardwood

belongs to
Personc

john hammersleyni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#JohnHammersley

belongs to
Personc

john mauchlyni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#JohnMauchly

belongs to
Personc

john von neumannni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#JohnVonNeumann

has facts
namedp "John Von Neumann"^^string

joshua j arulanandhamni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#JoshuaJArulanandham

has facts
namedp "Joshua J. Arulanandham"^^string

ken thompsonni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#KenThompson

belongs to
Personc

l r fordni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#LRFord

has facts
namedp "L.R Ford"^^string

linear algebrani back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#LinearAlgebra

belongs to
Mathematical propertyc
Academic disciplinec

linear functionsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#LinearFunctions

belongs to
AlgorithmAnalysisFunctionc

linked listni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#LinkedList

belongs to
Data Structurec

lispni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Lisp

belongs to
Programming languagec

listni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#List

belongs to
Data Structurec

llewellyn thomasni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#LlewellynThomas

belongs to
Personc

logarithmic functionni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#LogarithmicFunction

belongs to
AlgorithmAnalysisFunctionc

m s d o sni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#MS-DOS

belongs to
Operating systemc

match finding algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#MatchFindingAlgorithm

has facts
computes solution toop finding a match

mathematicsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Mathematics

belongs to
Academic disciplinec
has facts
has branchop Graph
has branchop linear algebra

matlabni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Matlab

belongs to
Programming languagec

merge sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#MergeSort

belongs to
Algorithmc
has facts
createddp "1945-01-01T00:00:00"^^literal
creatorop john von neumann
descriptiondp "Merge sort is an efficient, general-purpose, and comparison-based sorting algorithm."^^string
identifierdp "https://rosettacode.org/wiki/Sorting_algorithms/Merge_sort"^^literal
titledp "Merge Sort"^^string
computes solution toop sorting
data Structure Usedop array
has space complexityop merge sort space complexity
has time complexityop merge sort time complexity
is a type ofop divide and conquer algorithm

merge sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#MergeSortSpaceComplexity

has facts
best case space complexitydp "O(1)"^^string
worst case space complexitydp "O(n)"^^string

merge sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#MergeSortTimeComplexity

has facts
average time complexitydp "O(nlog n)"^^string
best case time complexitydp "O(nlog n)"^^string
worst case time complexitydp "O(nlog n)"^^string

michael dinneenni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#MichaelDinneen

has facts
namedp "Michael Dinneen"^^string

microsoft windowsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#MicrosoftWindows

belongs to
Operating systemc

n-body problemni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#n-bodyProblem

The n-body problem is the problem of predicting the individual motions of a group of celestial objects interacting with each other gravitationally.
belongs to
Problemc

natural languageni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#NaturalLanguage

belongs to
Form of expressionc

network flow theoryni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#NetworkFlowTheory

belongs to
Academic articlec
has facts
createddp "01-01-1956T00:00:00"^^literal
creatorop l r ford
identifierdp "https://doi.org/10.1090/qam/102435"^^string
identifierdp "https://www.rand.org/pubs/papers/P923.html"^^literal
titledp "Network Flow Theory."^^string

neural machine translationni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#NeuralMachineTranslation

belongs to
Problemc
has facts
has subproblemop decoding target language
has subproblemop encoding source language

nils nilsonni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#NilsNilson

has facts
namedp "NIls Nilson"^^string

on a routing problemni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#OnARoutingProblem

belongs to
Academic articlec
has facts
createddp "01-01-1958T00:00:00"^^literal
creatorop richard e bellman
identifierdp "https://doi.org/10.1090/qam/102435"^^literal
titledp "On a Routing Problem"^^string
published inop quart appl math.

oriol vinyalsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#OriolVinyals

has facts
namedp "Oriol Vinyals"^^string

p h pni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#PHP

belongs to
Programming languagec

pascalni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Pascal

belongs to
Programming languagec

per austrinni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#PerAustrin

belongs to
Personc

peter hartni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#PeterHart

has facts
namedp "Peter Hart"^^string

peter mc ilroyni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#PeterMcIlroy

belongs to
Personc

pok son kimni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#PokSonKim

has facts
namedp "Pok Son Kim"^^string

priority queueni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#PriorityQueue

belongs to
Data Structurec

pseudocodeni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Pseudocode

belongs to
Form of expressionc

publicni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Public

belongs to
Rights Statementc

pythonni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Python

belongs to
Programming languagec

quadritic functionni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#QuadriticFunction

belongs to
AlgorithmAnalysisFunctionc

quart appl math.ni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#QuartApplMath.

belongs to
Journalc
has facts
titledp "Quarterly Applied Mathematics"^^string

query processingni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#QueryProcessing

has facts
has subproblemop finding a match

query processing algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#QueryProcessingAlgorithm

has facts
computes solution toop query processing
has subalgorithmop match finding algorithm

queueni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Queue

belongs to
Data Structurec

quick sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#QuickSort

belongs to
Algorithmc
has facts
createddp "1961-01-01T00:00:00"^^literal
creatorop c a r hoare
descriptiondp "Average-case optimal divide and conquer comparison sorting algorithm."^^string
descriptiondp "Quicksort is a type of divide and conquer algorithm for sorting an array, based on a partitioning routine."^^string
identifierdp "https://rosettacode.org/wiki/Sorting_algorithms/Quicksort"^^literal
titledp "Quick Sort"^^string
computes solution toop sorting
time of earliest written recorddp "1959-01-01T00:00:00"^^date time
has space complexityop quick sort space complexity
has time complexityop quick sort time complexity
is a type ofop divide and conquer algorithm
appeared Inop algorithm64: quicksort

quick sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#QuickSortSpaceComplexity

has facts
average space complexitydp "O(log n)"^^string
worst case space complexitydp "O(n)"^^string

quick sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#QuickSortTimeComplexity

has facts
average time complexitydp "O(nlog n)"^^string
best case time complexitydp "O(nlog n)"^^string
worst case time complexitydp "O(n^^2)"^^string

quoc v leni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#QuocVLe

has facts
namedp "Quoc V. Le"^^string

rni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#R

belongs to
Programming languagec

randomized algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#RandomizedAlgorithm

A randomized algorithm uses a random number at least once during the computation to make a decision.
belongs to
Algorithmic Typec

ratio based stable in place mergingni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#RatioBasedStableIn-placeMerging

has facts
createddp "2008-01-01T00:00:00"^^literal
creatorop arne kutzner
creatorop pok son kim
identifierdp "http://itbe.hanyang.ac.kr/ak/papers/tamc2008.pdf"^^literal
titledp "Ratio based stable in-place merging"^^string

Recursive algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#RecursiveAlgorithm

A simple recursive algorithm: (i) Solves the base cases directly; (ii) Recurs with a simpler subproblem; (iii) Does some extra work to convert the solution to the simpler subproblem into a solution to the given problem. It is called “simple” because several of the other algorithm types are inherently recursive. (source: https://www.cis.upenn.edu/~matuszek/cit594-2003/Lectures/35-algorithm-types.ppt)
belongs to
Algorithmic Typec

red hat linuxni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#RedHatLinux

belongs to
Operating systemc

richard e bellmanni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#RichardEBellman

has facts
namedp "Richard E. Bellman"^^string

selection sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#SelectionSort

belongs to
Algorithmc
has facts
descriptiondp "Sorting Algorithm"^^string
identifierdp "https://rosettacode.org/wiki/Sorting_algorithms/Selection_sort"^^literal
titledp "Selection Sort"^^string
computes solution toop sorting
data Structure Usedop array
has implementationop selection sort implementation in c
has space complexityop selection sort space complexity
has time complexityop selection sort time complexity

selection sort implementation in cni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#SelectionSortImplementationInC

has facts
identifierdp "https://en.wikipedia.org/wiki/Selection_sort#Implementations"^^literal
titledp "Selection Sort Implementation In C"^^string

selection sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#SelectionSortSpaceComplexity

has facts
worst case space complexitydp "O(1)"^^string

selection sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#SelectionSortTimeComplexity

has facts
average time complexitydp "O(n^^2)"^^string
best case time complexitydp "O(n^^2)"^^string
worst case time complexitydp "O(n^^2)"^^string

selmer m johnsonni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#SelmerMJohnson

belongs to
Personc

Shortest path problemni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#ShortestPathProblem

belongs to
Polynomial Time Problemc
has facts
titledp "Shortest path problem"^^string

smooth sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#SmoothSort

belongs to
Algorithmc
has facts
createddp "1981-01-01T00:00:00"^^literal
creatorop edsger w dijkstra
descriptiondp "A comparison-based sorting algorithm."^^string
titledp "Smooth Sort"^^string
was Derived Fromop heap sort
computes solution toop sorting
data Structure Usedop array
has space complexityop smooth sort space complexity
has time complexityop smooth sort time complexity
appeared Inop smooth sort alternative for sorting in situ

smooth sort alternative for sorting in situni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#SmoothSortAlternativeForSortingInSitu

has facts
createddp "1981-01-01T00:00:00"^^literal
creatorop edsger w dijkstra
identifierdp "https://www.cs.utexas.edu/users/EWD/ewd07xx/EWD796a.PDF"^^literal
titledp "Smooth Sort: An Alternative For Sorting In Situ"^^string

smooth sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#SmoothSortSpaceComplexity

has facts
best case space complexitydp "O(1)"^^string
worst case space complexitydp "O(n)"^^string

smooth sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#SmoothSortTimeComplexity

has facts
average time complexitydp "O(nlog n)"^^string
best case time complexitydp "O(n)"^^string

sortingni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Sorting

belongs to
Combinatorial Problemc
has facts
titledp "Sorting"^^string

statisticsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Statistics

belongs to
Academic disciplinec

stuart lloydni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#StuartLloyd

belongs to
Personc

theory of setsni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#TheoryOfSets

belongs to
Mathematical propertyc

theory of statistics and probabilityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#TheoryOfStatisticsAndProbability

belongs to
Mathematical propertyc

tim petersni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#TimPeters

has facts
namedp "Tim Peters"^^string

tim sortni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#TimSort

belongs to
Algorithmc
has facts
createddp "2002-01-01T00:00:00"^^literal
creatorop tim peters
descriptiondp "Timsort is a hybrid stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data."^^string
titledp "Tim Sort"^^string
was Derived Fromop insertion sort
was Derived Fromop merge sort
computes solution toop sorting
data Structure Usedop array
has implementationop tim sort implemented in python
has space complexityop tim sort space complexity
has time complexityop tim sort time complexity

tim sort implemented in pythonni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#TimSortImplementedInPython

has facts
identifierdp "https://gist.github.com/nandajavarma/a3a6b62f34e74ec4c31674934327bbd3"^^literal
titledp "Tim Sort Implemented In Python"^^string
programming languageop python

tim sort space complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#TimSortSpaceComplexity

has facts
worst case space complexitydp "O(n)"^^string

tim sort time complexityni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#TimSortTimeComplexity

has facts
average time complexitydp "O(nlog n)"^^string
best case time complexitydp "O(nlog n)"^^string
worst case time complexitydp "O(n)"^^string

tobias dantzigni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#TobiasDantzig

belongs to
Personc

treeni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#tree

belongs to
Data Structurec

tupleni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#tuple

belongs to
Data Structurec

undirected graphni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#UndirectedGraph

belongs to
Data Structurec
has facts
specialization ofop Graph

unixni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#Unix

belongs to
Operating systemc

user query processingni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#UserQueryProcessing

belongs to
Polynomial Time Problemc
has facts
has subproblemop query processing

user query processing algorithmni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#UserQueryProcessingAlgorithm

belongs to
Algorithmc
has facts
computes solution toop user query processing
has subalgorithmop query processing algorithm

vaughan prattni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#VaughanPratt

belongs to
Personc

whileni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#While

belongs to
Loop constructc

william wesley petersonni back to ToC or Named Individual ToC

IRI: https://w3id.org/amv#WilliamWesleyPeterson

belongs to
Personc

Annotation Properties

alt labelap back to ToC or Annotation Property ToC

IRI: http://www.w3.org/2004/02/skos/core#AltLabel

competency questionap back to ToC or Annotation Property ToC

IRI: https://w3id.org/mod#competencyQuestion

creatorap back to ToC or Annotation Property ToC

IRI: http://purl.org/dc/elements/1.1/creator

dateap back to ToC or Annotation Property ToC

IRI: http://purl.org/dc/elements/1.1/date

descriptionap back to ToC or Annotation Property ToC

IRI: http://purl.org/dc/elements/1.1/description

issuedap back to ToC or Annotation Property ToC

IRI: http://purl.org/dc/elements/1.1/issued

modifiedap back to ToC or Annotation Property ToC

IRI: http://purl.org/dc/elements/1.1/modified

preferred namespace prefixap back to ToC or Annotation Property ToC

IRI: http://purl.org/vocab/vann/preferredNamespacePrefix

preferred namespace uriap back to ToC or Annotation Property ToC

IRI: http://purl.org/vocab/vann/preferredNamespaceUri

publisherap back to ToC or Annotation Property ToC

IRI: http://purl.org/dc/elements/1.1/publisher

rightsap back to ToC or Annotation Property ToC

IRI: http://purl.org/dc/elements/1.1/rights

titleap back to ToC or Annotation Property ToC

IRI: http://purl.org/dc/elements/1.1/title

vocabulary usedap back to ToC or Annotation Property ToC

IRI: https://w3id.org/mod#vocabularyUsed

Namespace Declarations back to ToC

default namespace
https://w3id.org/amv#
amv
https://w3id.org/amv#
bibo
http://purl.org/ontology/bibo/
dc
http://purl.org/dc/elements/1.1/
dcat
http://www.w3.org/ns/dcat#
entity
http://www.wikidata.org/entity/
foaf
http://xmlns.com/foaf/0.1/
mod
https://w3id.org/mod#
ns
https://www.isibang.ac.in/ns/
owl
http://www.w3.org/2002/07/owl#
prov
http://www.w3.org/ns/prov#
rdf
http://www.w3.org/1999/02/22-rdf-syntax-ns#
rdfs
http://www.w3.org/2000/01/rdf-schema#
schema-org
http://schema.org/
skos
http://www.w3.org/2004/02/skos/core#
terms
http://purl.org/dc/terms/
vann
http://purl.org/vocab/vann/
w3id-org
https://w3id.org/
xsd
http://www.w3.org/2001/XMLSchema#

This HTML document was obtained by processing the OWL ontology source code through LODE, Live OWL Documentation Environment, developed by Silvio Peroni .