Skip Navigation

Journal of Logic and Computation 1994 4(4):423-452; doi:10.1093/logcom/4.4.423
© 1994 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by DONINI, F. M.
Right arrow Articles by SCHAERF, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Deduction in Concept Languages: from Subsumption to Instance Checking

FRANCESCO M. DONINI, MAURIZIO LENZERINI, DANIELE NARDI and ANDREA SCHAERF

Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza" Via Salaria 113, 00198 Roma, Italia E-mail: doninilenzerininardiaschaerf{at}assi.dis.uniromal.it

It is a common opinion that subsumption is the central reasoning task in frame-based knowledge representation languages (or concept languages). Intuitively, a concept C subsumes another concept D if the set of objects represented by C is a superset of the one represented by D. When individual objects are taken into account, the basic deductive task for retrieving information from a knowledge base is instance checking, that amounts to checking whether the knowledge base implies that an individual is an instance of a given concept. In this paper, we address the question of whether instance checking can be solved by means of subsumption algorithms. We do so by considering several languages where subsumption belongs to different complexity classes. For such languages we present methods for the instance checking problem, provide a complexity analysis of this problem, and compare it with the subsumption problem. The main result of the paper is that instance checking is not always easily reducible to subsumption. In particular, there are cases where it is strictly harder than subsumption. This impacts on the design of reasoning algorithms for knowledge representation systems based on concept languages.

Keywords: Concept languages,; description logics,; deduction,; computational complexity.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.