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.
|Journal||CEUR Workshop Proceedings|
|Publication status||Published - 2003|
|Event||2003 International Workshop on Description Logics, DL 2003 - Rome, Italy|
Duration: 5 Sep 2003 → 7 Sep 2003
|Conference||2003 International Workshop on Description Logics, DL 2003|
|Period||05/09/2003 → 07/09/2003|