Linkless normal form for ALC concepts
- 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.
| Author: | Claudia Schon |
|---|---|
| URN: | urn:nbn:de:kola-4633 |
| Series (Serial Number): | Arbeitsberichte, FB Informatik (2010,12) |
| Document Type: | Part of Periodical |
| Language: | English |
| Date of Publication (online): | 2010/11/18 |
| Date of first Publication: | 2010/11/18 |
| Publishing Institution: | Universität Koblenz-Landau, Campus Koblenz, Universitätsbibliothek |
| Release Date: | 2010/11/18 |
| Tag: | Description Logics; Knowledge Compilation |
| Page Number: | 25 |
| Institutes: | Fachbereich 4 / Fachbereich 4 |
| Fachbereich 4 / Institut für Informatik | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
| Licence (German): | Es gilt das deutsche Urheberrecht: § 53 UrhG |

