We propose a novel method for reasoning in the description logic SHIQ. After a satisfiability preserving transformation from SHIQ to the description logic ALCIb, the obtained ALCIb Tbox T is converted into an ordered binary decision diagram (OBDD) which represents a canonical model for 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
Data structures for Boolean functions build an essential component of design automation tools, espec...
Description logics (DLs) are a family of state-of-the-art knowledge representation languages, and th...
AbstractDescription logics (DLs) are a family of state-of-the-art knowledge representation languages...
Abstract. We propose a novel method for reasoning in the description logic SHIQ. After a satisfiabil...
We propose a novel, type-elimination-based method for reasoning in thedescription logic SHIQbs inclu...
We propose a novel, type-elimination-based method for standard reasoning in the description logic SH...
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent ...
As applications of description logics proliferate, efficient reasoning with knowledge bases containi...
We propose a novel, type-elimination-based method for standard reasoning in the description logic SH...
Abstract. While there has been a great deal of work on the development of reasoning algorithms for e...
The integration of Description Logics and Datalog rules presents many semantic and computational pro...
The integration of Description Logics and Datalog rules presents many semantic and computational pro...
We present an extension of Binary Decision Diagrams (BDDs) such that they can be used for predicate ...
Description logics (DLs) are knowledge representation formalisms with well-understood model-theoreti...
Abstract. Decision Diagrams (DDs) are a well populated family of data structures, used for efficient...
Data structures for Boolean functions build an essential component of design automation tools, espec...
Description logics (DLs) are a family of state-of-the-art knowledge representation languages, and th...
AbstractDescription logics (DLs) are a family of state-of-the-art knowledge representation languages...
Abstract. We propose a novel method for reasoning in the description logic SHIQ. After a satisfiabil...
We propose a novel, type-elimination-based method for reasoning in thedescription logic SHIQbs inclu...
We propose a novel, type-elimination-based method for standard reasoning in the description logic SH...
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent ...
As applications of description logics proliferate, efficient reasoning with knowledge bases containi...
We propose a novel, type-elimination-based method for standard reasoning in the description logic SH...
Abstract. While there has been a great deal of work on the development of reasoning algorithms for e...
The integration of Description Logics and Datalog rules presents many semantic and computational pro...
The integration of Description Logics and Datalog rules presents many semantic and computational pro...
We present an extension of Binary Decision Diagrams (BDDs) such that they can be used for predicate ...
Description logics (DLs) are knowledge representation formalisms with well-understood model-theoreti...
Abstract. Decision Diagrams (DDs) are a well populated family of data structures, used for efficient...
Data structures for Boolean functions build an essential component of design automation tools, espec...
Description logics (DLs) are a family of state-of-the-art knowledge representation languages, and th...
AbstractDescription logics (DLs) are a family of state-of-the-art knowledge representation languages...