rationals.properties.package.html Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of org.semanticweb.hermit Show documentation

HermiT is reasoner for ontologies written using the Web Ontology Language (OWL). Given an OWL file, HermiT can determine whether or not the ontology is consistent, identify subsumption relationships between classes, and much more. This is the maven build of HermiT and is designed for people who wish to use HermiT from within the OWL API. It is now versioned in the main HermiT version repository, although not officially supported by the HermiT developers. The version number of this package is a composite of the HermiT version and an value representing releases of this packaged version. So, 1.3.7.1 is the first release of the mavenized version of HermiT based on the 1.3.7 release of HermiT. This package includes the Jautomata library (http://jautomata.sourceforge.net/), and builds with it directly. This library appears to be no longer under active development, and so a "fork" seems appropriate. No development is intended or anticipated on this code base.

There is a newer version: 1.3.8.4

Show newest version








A package containing various properties checkers on automaton objects, 
mainly simple unary tests and equivalence relations.
Documentation
This package offers the following unary tests on automaton:

	emptiness:  
	checks if given automaton is empty
	normalized: 
	checks if automaton as one start state with no incoming transitions 
and one end state,  
	contains epsilon: 
	checks if the automaton recognizes the empty word epsilon, 

It also offers an extensible framework for computing equivalence 
relations over automata. The {@see rationals.properties.AreEquivalent} class
checks that starting states of both automata are equivalent according to
some {@see rationals.properties.Relation}. Predefined relation objects are;

	Completed Trace equivalence: 
	compute the equivalence of two states according to the language they 
	recognize, 
	Weak Bisimulation: 
	checks that two states produces the same labels and lead to equivalent states, 
	without taking into account epsilon transitions, 
		(Strong) Bisimulation: 
		checks that two states produces the same labels and lead to equivalent states, 
epsilon transitions are accounted for. 
	Isomorphism: 
	checks that two automaton are isomorph up to a renaming of states.

Obviously, these equivalence relations are meaningful only when one does not want 
to compute the minimal DFA for a given automaton as in this case they all collapse
into (completed) trace equivalence.