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.
Original language | English |
---|---|
Journal | CEUR Workshop Proceedings |
Volume | 81 |
ISSN | 1613-0073 |
Publication status | Published - 2003 |
Externally published | Yes |
Event | 2003 International Workshop on Description Logics, DL 2003 - Rome, Italy Duration: 5 Sept 2003 → 7 Sept 2003 |
Conference
Conference | 2003 International Workshop on Description Logics, DL 2003 |
---|---|
Country/Territory | Italy |
City | Rome |
Period | 05/09/2003 → 07/09/2003 |