liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH
University of Warsaw.
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
2010 (English)In: Transactions on Computational Collective Intelligence, ISSN 0302-9743, Vol. 1, no 1, 21-38 p.Article in journal (Refereed) Published
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.

Place, publisher, year, edition, pages
Springer , 2010. Vol. 1, no 1, 21-38 p.
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-65964DOI: 10.1007/978-3-642-15034-0_2ISBN: 978-3-642-15033-3 (print)OAI: diva2:400673
Available from: 2011-02-28 Created: 2011-02-28 Last updated: 2014-06-11

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Szalas, Andrzej
By organisation
KPLAB - Knowledge Processing LabThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 193 hits
ReferencesLink to record
Permanent link

Direct link