Screech
From ONTOLORE
Screech is an approximate reasoning system for OWL DL which is based on KAON2. Essentially, it relies on the transformations of OWL DL ontologies provided by KAON2 into negation-free disjunctive datalog, and on the idea of performing standard resolution over disjunctive rules by approximating them by non-disjunctive ones.
The implementation itself is part of the KAON2 OWL tools.
Download
- The implementation is available as part of the KAON2 OWL Tools.
Literature
- Tuvshintur Tserendorj, Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler, Approximate OWL-Reasoning with Screech. In: D. Calvanese, G. Lausen (eds.), Web Reasoning and Rule Systems, Second International Conference, RR 2008, Karlsruhe, Germany, October/November 2008. Springer Lecture Notes in Computer Science Vol. 5341, 2008, pp. 165-180.
- Sebastian Rudolph, Tuvshintur Tserendorj, Pascal Hitzler, What Is Approximate Reasoning? In: D. Calvanese, G. Lausen (eds.), Web Reasoning and Rule Systems, Second International Conference, RR 2008, Karlsruhe, Germany, October/November 2008. Springer Lecture Notes in Computer Science Vol. 5341, 2008, pp. 150-164.
- Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler, Michael Sintek, Denny Vrandecic, Efficient OWL Reasoning with Logic Programs - Evaluations. In: Massimo Marchiori, Jeff Z. Pan, Christian de Sainte Marie (Eds.), Proceedings of the First International Conference on Web Reasoning and Rule Systems, RR2007, Innsbruck, Austria, June 2007. Springer Lecture Notes in Computer Science 4524, pp. 370-373. For the presentation of this paper we received the best poster award.
- Pascal Hitzler, Denny Vrandecic, Resolution-Based Approximate Reasoning for OWL DL. In: Y. Gil et al. (Eds.), Proceedings of ISWC2005, Galway, Ireland, November 2005. Lecture Notes in Computer Science 3729, pp. 383-397, Springer, Berlin, 2005. See also the slides from the presentation of this paper.
- up: <ask>Screech</ask>
- see also: dlpconvert, KAON2
