Login / Signup

Replacing SEP-Triplets in SNOMED CT Using Tractable Description Logic Operators.

Boontawee SuntisrivarapornFranz BaaderStefan SchulzKent A. Spackman
Published in: AIME (2007)
Keyphrases
  • snomed ct
  • description logics
  • computational complexity
  • np complete
  • semantic web
  • knowledge base
  • np hard
  • belief revision
  • reasoning tasks
  • ontology languages
  • reasoning problems
  • transitive closure of roles