Automated Deduction Techniques for Classification in Description Logic Systems

  • Authors:

  • M. Paramasivam;David A. Plaisted

  • Affiliations:

  • Department of Computer Science, CB # 3175 Sitterson Hall, University of North Carolina, Chapel Hill, NC 27599-3175.;Department of Computer Science, CB # 3175 Sitterson Hall, University of North Carolina, Chapel Hill, NC 27599-3175.

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mechanical theorem provers are becoming increasingly more powerful, andwe believe that it is time to examine whether certain tasks that haveformerly been accomplished by other means can now be performed efficientlyby a theorem prover. One such task is classification in descriptionlogic-based knowledge representation systems. Description logic systemsprovide a formalism for expressing knowledge based on concepts and roles.Subsumption checking is one important reasoning faculty offered by suchsystems. In this article we use a theorem prover coupled with a finite-modelfinder to perform subsumption checking. This approach is complete and soundfor description logic systems whose underlying logic has the finite modelproperty. The performance is compared with several other well-knowndescription logic systems. Some efficient strategies to compute thesubsumption hierarchy, known as classification, are also described.