Hi Masa,
may be I should say Formal Axiomatic Theory of Graphs :-)
Where we have axiom like this (âe:E 1â€(#v:V inc(e v))â€2) see here
<https://sites.google.com/site/alex0shkotin/grafy-praktika#TOC--3> and we
have formal definitions and formal proofs. In this case any particular
graph is a finite model of this axiom.
1) They say to "Share the concept of graph theory with machines" we need
more powerful language than OWL2 - may be Coq.
2) "Prepare vocabulary to describe graph problems" does it mean to give
formal definitions for such concept as " Shortest Path, Minimum Spanning
Tree, Betweenness Centrality" etc?
To keep graph in ontology we need 2 classes: Edge, Vertex and one object
property - incident (e1 inc v1), see in axiom above where "#" means "number
of", i.e. number of vertex being incident to any edge is more than 0 and
less than 3. It seems this axiom may be written on OWL2/DL.
Then we need axiom that Edge and Vertex are disjoint.
Is this your direction?
Alex
Post by MasaDear Alex,
Post by Alex Shkotinwould you like to make the task on OWL2, CASL, CL...
Wich language do you prefer in this case?
If I cannot find any ontology about graph theory, then I would create it,
maybe in OWL2.
Post by Alex ShkotinI have in my working area the beginning of axiomatic graph theory
I heard the term "Axiomatic Graph Theory" for the first time.
And I don't know the difference between "Axiomatic Graph Theory" and "Graph
Theory".
Anyway, what I want to do with an ontology is like below.
1) Share the concept of graph theory with machines.
2) Prepare vocabulary to describe graph problems.
After identifying user's intention, the system will solve
the graph problem by using graph algorithm APIs.
Masa
--
http://protege-project.136.n4.nabble.com/Protege-User-f4659818.html
_______________________________________________
protege-user mailing list
https://mailman.stanford.edu/mailman/listinfo/protege-user