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

Direct link
EXPTIME Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
University of Warsaw.
2009 (English)In: Proceedings of the 1st International Conference on Computational Collective Intelligence - Semantic Web, Social Networks & Multiagent Systems (ICCCI) / [ed] Ngoc Thanh; Kowalczyk, Ryszard; Chen, Shyi-Ming, Springer , 2009, 437-448 p.Conference paper (Refereed)
Abstract [en]

We give the first ExpTime (optimal) tableau decision procedure for checking satisfiability of a knowledge base in the description logic ALC, not based on transformation that encodes ABoxes by nominals or terminology axioms. Our procedure can be implemented as an extension of the highly optimized tableau prover TGC [12] to obtain an efficient program for the mentioned satisfiability problem.

Place, publisher, year, edition, pages
Springer , 2009. 437-448 p.
Lecture Notes in Artificial Intelligence, ISSN 0302-9743 ; 5796
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-21989DOI: 10.1007/978-3-642-04441-0_38ISBN: 978-3-642-04440-3 (print)ISBN: 978-3-642-04441-0 (print)OAI: diva2:242257
1st International Conference on Computational Collective Intelligence, ICCCI 2009; Wroclaw; Poland
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2014-09-05

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: 123 hits
ReferencesLink to record
Permanent link

Direct link