TRILL answers queries to SHOIQ knowledge bases using a tableau algorithm. Prolog non-determinism is used for easily handling non-deterministic expansion rules that produce more than one tableau.downloadable version is a preliminary version of the reasoner, much work still lies ahead!
You can try it online at http://trill.lamping.unife.it/
For running TRILL is necessary to use the YAP compiler.
TRILL is completely written in Prolog. For downloading it, click here, select "trill.pl" and then click on Save or Download.
The file "trillProb.pl" is the probabilistic version of TRILL with which is possible to compute the probability of a query.
TRILLP.zip contains TRILLP, the version of TRILL which computes a general Boolean pinpointing formula using the techniques proposed by Baader and Penaloza .
In the same folder, a short manual is downloadable.
TRILL is compatible with SWI Prolog. The version for SWI-Prolog can be installed by the goal
After this call, TRILL can be loaded with the command
TRILL is able to translate OWL/RDF files into Prolog and manage knowledge bases defined using OWL-Functional Syntax like syntax.
An example of use is:
If you are using YAP, you need to propare a prolog file containing the OWL knowledge base translated into prolog predicates. In order to do this translation we suggest to exploit Thea2 library (compilable only with SWI Prolog) by running convert.pl file.
NOTE: TRILL needs the latest version of SWI-Prolog!
To run probabilistic queries, after the translation, all the probabilistic axioms must be asserted following the syntax presented in the manual.here, select "test.zip" and then click on Save or Download.
Report an issue
 Franz Baader and Rafael Penaloza. "Axiom Pinpointing in General Tableaux". Journal of Logic and Computation, 20(1):5–34, 2010.