Computing Least Common Subsumers in Description Logics with Existential Restrictions.
Franz BaaderRalf KüstersRalf MolitorPublished in: IJCAI (1999)
Keyphrases
- computing least common subsumers
- description logics
- tight complexity bounds
- knowledge base
- reasoning tasks
- knowledge representation
- dl lite
- computational properties
- knowledge representation and reasoning
- ontology languages
- knowledge representation formalisms
- semantic web
- reasoning systems
- reasoning problems
- model theoretic
- artificial intelligence
- xml documents
- knowledge representation languages
- highly expressive
- concept descriptions
- logic programming