论文信息 - Description Logic Reasoning with Decision Diagrams: Compiling SHIQ to Disjunctive Datalog

Description Logic Reasoning with Decision Diagrams: Compiling SHIQ to Disjunctive Datalog

We propose a novel method for reasoning in the description logic $\mathcal{SHIQ}$. After a satisfiability preserving transformation from $\mathcal{SHIQ}$ to the description logic $\mathcal{ALCI}b$, the obtained $\mathcal{ALCI}b$ Tbox $\mathcal{T}$ is converted into an ordered binary decision diagram (OBDD) which represents a canonical model for $\mathcal{T}$. This OBDD is turned into a disjunctive datalog program that can be used for Abox reasoning. The algorithm is worst-case optimal w.r.t. data complexity, and admits easy extensions with DL-safe rules and ground conjunctive queries.

[1] Diego Calvanese,et al. The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[2] Sebastian Rudolph,et al. Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams , 2008, AAAI.

[3] Ulrike Sattler,et al. BDD-based decision procedures for the modal logic K ★ , 2006, J. Appl. Non Class. Logics.

[4] Boris Motik,et al. Query Answering for OWL-DL with Rules , 2004, SEMWEB.

[5] Boris Motik,et al. Reasoning in description logics using resolution and deductive databases , 2006 .

[6] Diego Calvanese,et al. The Description Logic Handbook , 2007 .

[7] Stephan Tobies,et al. Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.

[8] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[9] Valentin Goranko,et al. Logic in Computer Science: Modelling and Reasoning About Systems , 2007, J. Log. Lang. Inf..