Filtern
Erscheinungsjahr
- 2010 (18) (entfernen)
Dokumenttyp
- Diplomarbeit (6)
- Ausgabe (Heft) zu einer Zeitschrift (6)
- Studienarbeit (4)
- Bachelorarbeit (1)
- Dissertation (1)
Schlagworte
- Netzwerk (2)
- Routing (2)
- hybrid automata (2)
- API (1)
- Algorithm Engineering (1)
- Authentisierung (1)
- Automatisches Beweisverfahren (1)
- Computational logic (1)
- Context-aware processes (1)
- Controlling (1)
- Description Logics (1)
- Dijkstras Algorithmus (1)
- Distributed process execution (1)
- E-KRHyper (1)
- GPS (1)
- Heuristiken (1)
- JML (1)
- Java Modeling Language (1)
- Java. Programmiersprache (1)
- Klausellogik (1)
- Knowledge Compilation (1)
- Konvergenz (1)
- Mikrocontroller (1)
- Monitoring (1)
- Multiagentensysteme (1)
- Network (1)
- Netzwerk Protokollen (1)
- Neuronales Netz (1)
- Oracle Generation (1)
- Oraklegenerierung (1)
- Personal Key Infrastruktur (1)
- Petri net (1)
- Probability propagation nets (1)
- Process tracing (1)
- Projekt iCity (1)
- Protocol (1)
- Prädikatenlogik (1)
- RIP (1)
- RMTI (1)
- Rechnernetz (1)
- Software Engineering (1)
- Softwaretest (1)
- Softwaretesting (1)
- Spannender Baum (1)
- Spanning Tree (1)
- Specification (1)
- Spezifikation (1)
- Statistische Analyse (1)
- Tableau <Logik> (1)
- Test Generation (1)
- Testgenerierung (1)
- VNUML (1)
- Wireshark (1)
- XTPeer (1)
- Zertifikat (1)
- andLinux (1)
- andLinux. (1)
- backpropagation (1)
- bias (1)
- constraint logic programming (1)
- convergence analysis (1)
- ediv (1)
- hybride Automaten (1)
- iCity project (1)
- multi-agent systems (1)
- multiagent systems (1)
- networks (1)
- neural (1)
- privacy protection (1)
- public key infrastructure (1)
- recurrent (1)
- rip (1)
- rmti (1)
- vnuml (1)
- xtpeer (1)
Institut
- Institut für Informatik (18) (entfernen)
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered efficiently. This precompilation step is expensive, but it only has to be performed once. We apply this technique to concepts defined in the Description Logic ALC. We introduce a normal form called linkless normal form for ALC concepts and discuss an efficient satisability test for concepts given in this normal form. Furthermore, we will show how to efficiently calculate uniform interpolants of precompiled concepts w.r.t. a given signature.