OWL DL corresponds to a Description Logic (DL) that is a fragment of classical first-order predicate logic (FOL). Therefore, the standard methods of automated reasoning for full FOL can potentially be used instead of dedicated DL reasoners to solve OWL DL reasoning tasks. In this paper we report on some experiments designed to explore the feasibility of using existing general-purpose FOL provers to reason with OWL DL. We also extend our approach to SWRL, a proposed rule language extension to OWL. © Springer-Verlag 2004.
CITATION STYLE
Tsarkov, D., Riazanov, A., Bechhofer, S., & Horrocks, I. (2004). Using vampire to reason with OWL. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3298, 471–485. https://doi.org/10.1007/978-3-540-30475-3_33
Mendeley helps you to discover research relevant for your work.