encoded algorithm
IRI: https://spec.industrialontologies.org/ontology/construct/EncodedAlgorithm
Defined In: https://spec.industrialontologies.org/ontology/core/Core/
SubClass Of: plan specification
Class Hierarchy
owl:Thing › bfo:entity › bfo:continuant › bfo:generically dependent continuant › information content entity › plan specification › encoded algorithm
Definition
plan specification that is the implementation of an algorithm encoded in a specific programming language or framework and that is readily executable
Explanatory Notes
Readily executable means that it can be 1) concretized by a computing process which is prescribed by the encoded algorithm or 2) in case of source code concretized by a compiling process
Examples
- source code encoded in Java that implements a sorting algorithm; Python script that implements a decision tree and that has the objective to classify melt pool images
Counter-Examples
- flowchart, pseudocode
Adapted From
- http://www.ebi.ac.uk/swo/SWO_0000001
Primitive Class
This class is declared primitive and it does not have necessary and sufficient condiftions defined.
Primitive Rationale
In addition to the general discussion provided for information content enty,there are insufficient constructs to create necessary and sufficient conditions. Namely constructs for ‘encoded in’, ‘implementation of’ and ‘programming language’ or ‘framework’ as well as ‘compiling process’ are still missing.
Formal Axioms
First-Order Logic Axioms
PlanSpecification(x) ∧ ∃y(ComputingProcess(y) ∧ prescribes(x,y)) → EncodedAlgorithm(x)
Semi-Formal Natural Language Axioms
If x is a ‘plan specification’ that ‘prescribes’ some ‘computing process’ then x is an instance of ‘encoded algorithm’