Ontologies.pdf (application/pdf Object) The Protégé Ontology Editor and Knowledge Acquisition System. WebProtege. WebProtégé The new WebProtégé with simplified editing and improved collaboration support WebProtégé is a free, open source collaborative ontology development environment for the Web.
We encourage end users to use our hosted solution at: Alternatively, WebProtégé can be downloaded and installed on your own server. WebProtégé provides the following features: Support for editing OWL 2 ontologies A default simple editing interface, which provides access to commonly used OWL constructs Full change tracking and revision history Collaboration tools such as, sharing and permissions, threaded notes and discussions, watches and email notifications Customizable user interface Customizable Web forms for application/domain specific editing Support for editing OBO ontologies Multiple formats for upload and download of ontologies (supported formats: RDF/XML, Turtle, OWL/XML, OBO, and others) Source code Latest release and release notes Documentation User's Guide.
Mind Mapping & Diagrams. Graph theory. Refer to the glossary of graph theory for basic definitions in graph theory. Definitions[edit] Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph[edit] Other senses of graph stem from different conceptions of the edge set. All of these variants and others are described more fully below. The vertices belonging to an edge are called the ends, endpoints, or end vertices of the edge. V and E are usually taken to be finite, and many of the well-known results are not true (or are rather different) for infinite graphs because many of the arguments fail in the infinite case.
(the number of vertices). For an edge {u, v}, graph theorists usually use the somewhat shorter notation uv. Applications[edit] The network graph formed by Wikipedia editors (edges) contributing to different Wikipedia language versions (nodes) during one month in summer 2013.[3] History[edit] The Königsberg Bridge problem "[...] Pellet Features. Pellet supports a wide range of standard and novel features: Standard Reasoning Services Pellet supports reasoning with the full expressivity of OWL-DL (SHOIN(D) in Description Logic jargon) and has been extended to support the forthcoming OWL 2 specification (SROIQ(D)), which adds the following language constructs: qualified cardinality restrictions complex subproperty axioms (between a property chain and a property) local reflexivity restrictions reflexive, irreflexive, symmetric, and anti-symmetric properties disjoint properties negative property assertions vocabulary sharing (punning) between individuals, classes, and properties user-defined dataranges Pellet also provides reasoning with the following features from OWL Full: inverse functional datatype properties Pellet provides all the standard inference services that are traditionally provided by DL reasoners: Consistency checking Ensures that an ontology does not contain any contradictory facts.
Concept satisfiability Classification. [Omnigator] Welcome Page. The Omnigator is a technology showcase and teaching aid designed to demonstrate the power of Topic Maps. It is also used extensively as a topic map debugger and prototyping tool. Now, with the introduction of RDF support, the Omnigator is evolving into a multi-purpose Semantic Web Agent. Features The Omnigator is omnivorous: It eats anything, provided it is a topic map – or can be viewed as one! Its most unique feature is that it lets you load and navigate any conforming topic map, whether its format be XTM 1.0, XTM 2.0, LTM – or even RDF. What's more, although it isn't optimized for any particular application, the Omnigator is able to make reasonable sense out of any reasonably sensible topic map! But the Omnigator lets you do far more than simply browse your topic maps. The most eye-catching new Omnigator feature is the Vizigator, which produces a graphic visualization of your topic map.
VisANT: An integrative platform for network/pathway analysis.