[BibTeX] [RIS]
Approximation of {O}ntologies in {CASL}
Type of publication: Inproceedings
Citation: luettich05
Booktitle: CALCO-jnr 2005 CALCO Young Researchers Workshop Selected Papers
Series: Report Series
Number: CSR 18-2005
Year: 2005
Pages: 41-53
Publisher: University of Wales Swansea
Abstract: In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theory. This is obtained by rewriting the given FOL formulas. If this method is applied to an ontology specification in FOL the resulting DL specification is still grounded on the same semantics but clearly weaker than the FOL specification. The benefit of specification in DL is that it is decidable, and that efficient reasoning procedures are also available as implemented in tools such as Racer, Fact++ or Pellet. Such ontologies in DL could be used for knowledge representation systems and the semantic web where efficient and decidable reasoning plays a ma jor role. These weakening strategies are described with CASL (Common Algebraic Specification Language), and one of its sublogics CASL-DL, and will be integrated into Hets (Heterogeneous Tool Set)
Userfields: pdfurl={http://www.informatik.uni-bremen.de/agbkb/publikationen/luettich/Approximation-CALCOjnr05.pdf}, project={I4-SPIN}, status={Reviewed},
Keywords: CASL CASL-DL Knowledge Compilation
Authors L├╝ttich, Klaus
Editors Mosses, P.
Power, J.
Seisenberger, M.
Attachments
  • http://www.informatik.uni-brem...
Notes
    Topics