LiU Electronic Press
Full-text not available in DiVA
Author:
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Nguyen, Linh Anh (University of Warsaw)
Title:
EXPTIME Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the 1st International Conference on Computational Collective Intelligence - Semantic Web, Social Networks & Multiagent Systems (ICCCI)
Editor:
Ngoc Thanh; Kowalczyk, Ryszard; Chen, Shyi-Ming
Conference:
1st International Conference on Computational Collective Intelligence, ICCCI 2009; Wroclaw; Poland
Publisher: Springer
Series:
Lecture Notes in Artificial Intelligence, ISSN 0302-9743; 5796
Pages:
437-448
Year of publ.:
2009
URI:
urn:nbn:se:liu:diva-21989
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-21989
ISBN:
978-3-642-04440-3 (print), 978-3-642-04441-0 (online)
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
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.

Available from:
2009-10-07
Created:
2009-10-07
Last updated:
2014-09-05
Statistics:
15 hits