Relationship to other formalisms.
Various approaches to DL reasoning.
DLs and Ontologies
The most promiment ontology definition formalism is
which is, in fact, three increasingly-expressive languages:
Univ. of Manchester and and Univ. of Karlsruhe offer a variaty of
- OWL Lite, which is equivalent to SHIF(D),
- OWL-DL, which is equivalent to SHOIN(D), and
- OWL Full, which is equivalent to a second-order logic.
an OWL Validator
that classifies OWL files as Lite, DL, Full, or invalid.
It also lists all logical constructs found in the file.
between OWL and abstract DL syntax, lisp-like FaCT++ syntax,
DIG 2.0, or Prolog-like Theorem-Prover syntax.
a Presentation servlet
that prepares an HTML, javadoc-like presentation of the Ontology.
A newer specification
is under preparation, which will extend the admissible
relation descriptions to almost full RBox reasoning. OWL-DL 1.1 is
equivalent to the DL called SROIQ(D).
DLs and Rules
The DL Community
Carsten Lutz maintains a
with complexity results and references for most DLs.
Last Update: 23-12-2008