Abstract
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear reduction of such knowledge bases into a standard format (allowing only conjunctive assertions) is described which preserves knowledge base satisfiability. Similar results are presented for Boolean TBoxes and Boolean combinations of both ABox and TBox statements.
| Originalsprog | Engelsk |
|---|---|
| Tidsskrift | CEUR Workshop Proceedings |
| Vol/bind | 81 |
| ISSN | 1613-0073 |
| Status | Udgivet - 2003 |
| Udgivet eksternt | Ja |
| Begivenhed | 2003 International Workshop on Description Logics, DL 2003 - Rome, Italien Varighed: 5 sep. 2003 → 7 sep. 2003 |
Konference
| Konference | 2003 International Workshop on Description Logics, DL 2003 |
|---|---|
| Land/Område | Italien |
| By | Rome |
| Periode | 05/09/2003 → 07/09/2003 |
Citationsformater
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver