LiU Electronic Press
Full-text not available in DiVA
Author:
Nguyen, Anh Linh (University of Warsaw)
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Article in journal (Refereed)
Language:
English
Publisher: Springer
Status:
Published
In:
Transactions on Computational Collective Intelligence, ISSN 0302-9743
Volume:
1
Issue:
1
Pages:
21-38
Year of publ.:
2010
URI:
urn:nbn:se:liu:diva-65964
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-65964
ISBN:
978-3-642-15033-3
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
Abstract(en) :

Description logics (DLs) are a family of knowledge representation languages which can be used to represent the terminological knowledge of an application domain in a structured and formally well-understood way. DLs can be used, for example, for conceptual modeling or as ontology languages. In fact, OWL (Web Ontology Language), recommended by W3C, is based on description logics. In the current paper we give the first direct ExpTime (optimal) tableau decision procedure, which is not based on transformation or on the pre-completion technique, for checking satisfiability of a knowledge base in the description logic SH. Our procedure uses sound global caching and can be implemented as an extension of the highly optimized tableau prover TGC to obtain an efficient program for the mentioned satisfiability problem.

Available from:
2011-02-28
Created:
2011-02-28
Last updated:
2014-06-11
Statistics:
68 hits