Handling Boolean A Boxes

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.

• Type: Conference
• Year: 2003
• Where: DLOG
• Authors: Carlos Areces, Patrick Blackburn, Bernadette Martínez Hernández, Maarten Marx
• Keywords: Automated Reasoning, Boolean Combinations, DLOG 2003, Knowledge Base, Logic Knowledge Bases