Arbeitsberichte, FB Informatik
Filtern
Erscheinungsjahr
- 2007 (25) (entfernen)
Sprache
- Englisch (17)
- Deutsch (7)
- Mehrsprachig (1)
Schlagworte
- Augmented Reality (2)
- Bluetooth (2)
- Campus Information System (2)
- Enhanced Reality (2)
- Equality (2)
- Knowledge Compilation (2)
- Theorem Proving (2)
- University (2)
- 2D/3D-Segmentierung (1)
- 3D-Color-Structure-Code (1)
- 3D-RETISEG (1)
- Adaptive Services Grid (ASG) (1)
- Automated Theorem Proving (1)
- Automated Theorem Proving Systems (1)
- Bayes Procedures (1)
- Datenbrille (1)
- Datensicherheit (1)
- Delphi-Studie (1)
- E-KRHyper (1)
- Gesundheitswesen (1)
- Horn Clauses (1)
- Hyper Tableau Calculus (1)
- IASON (1)
- IT Security (1)
- IT-Risk-Management (1)
- Innovationsmanagement (1)
- Interaktionselemente (1)
- Internet Voting (1)
- Kalibrierung (1)
- Krankenhausinformationssystem (1)
- Kryptographie (1)
- MIA (1)
- MPEG-7 (1)
- Multi-robot System (1)
- Multiagent System (1)
- Ontology (1)
- Personalised Information Systems (1)
- Petri Nets (1)
- Petri-Netze (1)
- Probability (1)
- Propagation (1)
- RDF Graphs (1)
- Resource Description Framework (RDF) (1)
- Security (1)
- Semantics (1)
- Service-oriented Architectures (SOA) (1)
- Stochastic Logic (1)
- Tableau Calculus (1)
- Technologiemanagement (1)
- UML (1)
- Unified Modeling Language (UML ) (1)
- Web Ontology Language (OWL) (1)
- directed acyclic graphs (1)
- elektronische Anwendung (1)
- finite state automata (1)
- regular dag languages (1)
2007,17
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.