Combining Horn rules and description logics in CARIN
Artificial Intelligence
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
The Description Logic Handbook
The Description Logic Handbook
Web Semantics: Science, Services and Agents on the World Wide Web
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Generalized schema-mappings: from termination to tractability
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Representing ontologies using description logics, description graphs, and rules
Artificial Intelligence
Keys, nominals, and concrete domains
Journal of Artificial Intelligence Research
Query Answering for OWL-DL with rules
Web Semantics: Science, Services and Agents on the World Wide Web
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
A better uncle for OWL: nominal schemas for integrating rules and ontologies
Proceedings of the 20th international conference on World wide web
On rules with existential variables: Walking the decidability line
Artificial Intelligence
Computing stable models for nonmonotonic existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Acyclicity notions for existential rules and their application to query answering in ontologies
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Although OWL 2 is widely used to describe complex objects such as chemical molecules, it cannot represent ‘structural' features of chemical entities (e.g., having a ring). A combination of rules and description graphs (DGs) has been proposed as a possible solution, but it still exhibits several drawbacks. In this paper we present a radically different approach that we call Description Graph Logic Programs. Syntactically, our approach combines DGs, rules, and OWL 2 RL axioms, but its semantics is defined via a translation into logic programs under stable model semantics. The result is an expressive OWL 2 RL-compatible formalism that is well suited for modelling objects with complex structure.