A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Telos: representing knowledge about information systems
ACM Transactions on Information Systems (TOIS)
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
On the relative expressiveness of description logics and predicate logics
Artificial Intelligence
Combining Horn rules and description logics in CARIN
Artificial Intelligence
{\cal A}{\cal L}-log: Integrating Datalog and Description Logics
Journal of Intelligent Information Systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A proposal for an owl rules language
Proceedings of the 13th international conference on World Wide Web
OWL DL vs. OWL flight: conceptual modeling and reasoning for the semantic Web
WWW '05 Proceedings of the 14th international conference on World Wide Web
A Tableau Decision Procedure for $\mathcal{SHOIQ}$
Journal of Automated Reasoning
Structured objects in owl: representation and reasoning
Proceedings of the 17th international conference on World Wide Web
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Web Semantics: Science, Services and Agents on the World Wide Web
Representing ontologies using description logics, description graphs, and rules
Artificial Intelligence
A faithful integration of description logics with logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Query Answering for OWL-DL with rules
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
Recent practical experience with description logics (DLs) has revealed that their expressivity is often insufficient to accurately describe structured objects--objects whose parts are interconnected in arbitrary, rather than tree-like ways. To address this problem, we propose an extension of DL languages with description graphs--a modeling construct that can accurately describe objects whose parts are connected in arbitrary ways. Furthermore, to enable modeling the conditional aspects of structured objects, we also incorporate rules into our formalism. We present an in-depth study of the computational properties of such a formalism. In particular, we first identify the sources of undecidability of the general, unrestricted formalism, and then present a restriction that makes reasoning decidable. Finally, we present tight complexity bounds.