Process ontology

In philosophy, a process ontology refers to a universal model of the structure of the world as an ordered wholeness.[1][2] Such ontologies are fundamental ontologies, in contrast to the so-called applied ontologies. Fundamental ontologies do not claim to be accessible to any empirical proof in itself but to be a structural design pattern, out of which empirical phenomena can be explained and put together consistently. Throughout Western history, the dominating fundamental ontology is the so-called substance theory. However, fundamental process ontologies have become more important in recent times, because the progress in the discovery of the foundations of physics has spurred the development of a basic concept able to integrate such boundary notions as "energy," "object", and those of the physical dimensions of space and time.

In computer science, a process ontology is a description of the components and their relationships that make up a process. A formal process ontology is an ontology in the knowledge domain of operations. Often such ontologies take advantage of the benefits of an upper ontology. Planning software can be used to perform plan generation based on the formal description of the process and its constraints. Numerous efforts have been made to define a process/planning ontology.[3]

  1. ^ Rescher, Nicholas. "Process Philosophy". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy. Cf. Michel Weber (ed.), After Whitehead: Rescher on Process Metaphysics, Frankfurt / Paris / Lancaster, Ontos Verlag, 2004
  2. ^ Sohst, Wolfgang (2009). Prozessontologie. Ein systematischer Entwurf der Entstehung von Existenz. Berlin. ISBN 978-3-936532-60-9. Archived from the original on 2010-08-27.{{cite book}}: CS1 maint: location missing publisher (link)
  3. ^ Gangemi, A., Borgo, S., Catenacci, C., and Lehman, J. (2005). "Task taxonomies for knowledge content (deliverable D07)" (PDF). Laboratory for Applied Ontology (LOA). pp. 9–26.{{cite web}}: CS1 maint: multiple names: authors list (link)

Developed by StudentB