Filtern
Erscheinungsjahr
- 2007 (18) (entfernen)
Dokumenttyp
- Ausgabe (Heft) zu einer Zeitschrift (14)
- Diplomarbeit (2)
- Studienarbeit (2)
Schlagworte
- Bluetooth (2)
- Campus Information System (2)
- Equality (2)
- Knowledge Compilation (2)
- Theorem Proving (2)
- University (2)
- Augmented Reality (1)
- Automated Theorem Proving (1)
- Automated Theorem Proving Systems (1)
- Bayes Procedures (1)
- CTI -Problem (1)
- E-KRHyper (1)
- Enhanced Reality (1)
- Horn Clauses (1)
- Hyper Tableau Calculus (1)
- IASON (1)
- Konvergenz (1)
- MIA (1)
- MPEG-7 (1)
- Multi-robot System (1)
- Multiagent System (1)
- Netzwerkmanagment (1)
- Ontology (1)
- Personalised Information Systems (1)
- Petri Nets (1)
- Probability (1)
- Propagation (1)
- RDF Graphs (1)
- RIP-MTI (1)
- RIP-MTI Algorithmus (1)
- Resource Description Framework (RDF) (1)
- Routing (1)
- Routing information protocol (1)
- SNMP (1)
- Semantics (1)
- Stochastic Logic (1)
- Tableau Calculus (1)
- UML (1)
- Unified Modeling Language (UML ) (1)
- Web Ontology Language (OWL) (1)
- XTPeer (1)
- virtual network user mode linux (1)
Institut
- Institut für Informatik (18) (entfernen)
Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[DH05]), for which queries can be answered efficiently. This precompilation step is very expensive but it only has to be performed once. We propose to apply this technique to knowledge bases defined in Description Logics. For this, we introduce a normal form, called linkless concept descriptions, for ALC concepts. Further we present an algorithm, based on path dissolution, which can be used to transform a given concept description into an equivalent linkless concept description. Finally we discuss a linear satisfiability test as well as a subsumption test for linkless concept descriptions.