Dmitry Tsarkov

FaCT++ description logic reasoner: system description

This is a system description of the Description Logic reasoner FaCT++. The reasoner implements a tableaux decision procedure for the well known

OWL rules: A proposal and prototype implementation

\mathcal{SHOIQ}

Optimizing Terminological Reasoning for Expressive Description Logics

description logic, with additional support for datatypes, including strings and integers. The system employs a wide range of performance enhancing optimisations, including both standard techniques (such as absorption and model merging) and newly developed ones (such as ordering heuristics and taxonomic classification). FaCT++ can, via the standard DIG interface, be used to provide reasoning services for ontology engineering tools supporting the OWL DL ontology language.

Using vampire to reason with OWL

Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations, particularly with respect to what can be said about properties. We present the Semantic Web Rule Language (SWRL), a Horn clause rules extension to OWL that overcomes many of these limitations. SWRL extends OWL in a syntactically and semantically coherent manner: the basic syntax for SWRL rules is an extension of the abstract syntax for OWL DL and OWL Lite; SWRL rules are given formal meaning via an extension of the OWL DL model-theoretic semantics; SWRL rules are given an XML syntax based on the OWL XML presentation syntax; and a mapping from SWRL rules to RDF graphs is given based on the OWL RDF/XML exchange syntax. We discuss the expressive power of SWRL, showing that the ontology consistency problem is undecidable, provide several examples of SWRL usage, and discuss a prototype implementation of reasoning support for SWRL.

Framework for an automated comparison of description logic reasoners

Tableau algorithms are currently the most widely used and empirically the fastest algorithms for reasoning in expressive description logics, including the important description logics

Ontology-Based Content Trust Support of Expert Information Resources in Quantitative Spectroscopy

\mathcal{SHIQ}

An ontological description of states and transitions in quantitative spectroscopy

and

A Quality Assurance Workflow for Ontologies Based on Semantic Regularities

\mathcal{SHOIQ}

Efficient reasoning with range and domain constraints

. Achieving a high level of performance on terminological reasoning in expressive description logics when using tableau-based algorithms requires the incorporation of a wide variety of optimizations. The description logic system FaCT++ implements a wide variety of such optimizations, some present in other reasoners and some novel or refined in FaCT++.

Automated Benchmarking of Description Logic Reasoners.

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.