2013 | OriginalPaper | Chapter
A Tableau Method with Optimal Complexity for Deciding the Description Logic SHIQ
Author : Linh Anh Nguyen
Published in: Advanced Computational Methods for Knowledge Engineering
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We present the first tableau method with an
ExpTime
(optimal) complexity for checking satisfiability of a knowledge base in the description logic
$\mathcal{SHIQ}$
. The complexity is measured using binary representation for numbers. Our method is based on global state caching and integer linear feasibility checking.