论文信息 - Handling Boolean ABoxes

Handling Boolean ABoxes

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.

[1] M. de Rijke,et al. Automated Reasoning with Boolean ABoxes , 2002 .

[2] Fausto Giunchiglia,et al. A SAT-based Decision Procedure for ALC , 1996, KR.

[3] F. Wolter,et al. Temporalizing Description Logics , 1998, FroCoS.

[4] Ian Horrocks,et al. How to Decide Query Containment Under Constraints Using a Description Logic , 2000, LPAR.

[5] Francesco M. Donini,et al. Decidable Reasoning in Terminological Knowledge Representation Systems , 1993, IJCAI.

[6] Volker Haarslev,et al. Description of the RACER System and its Applications , 2001, Description Logics.

[7] Frank Wolter,et al. On the Decidability of Description Logics with Modal Operators , 1998, International Conference on Principles of Knowledge Representation and Reasoning.