Proceedings Article10.1145/775152.775160
Description logic programs: combining logic programs with description logic
Benjamin N. Grosof,Ian Horrocks,Raphael Volz,Stefan Decker +3 more
- 20 May 2003
- pp 48-57
TL;DR: It is shown how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules and ontologies and define a new intermediate knowledge representation contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL).
read more
Abstract: We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL) which is an expressive fragment of first-order logic (FOL). DLP provides a significant degree of expressiveness, substantially greater than the RDF-Schema fragment of Description Logic. We show how to perform DLP-fusion: the bidirectional translation of premises and inferences (including typical kinds of queries) from the DLP fragment of DL to LP, and vice versa from the DLP fragment of LP to DL. In particular, this translation enables one to "build rules on top of ontologies": it enables the rule KR to have access to DL ontological definitions for vocabulary primitives (e.g., predicates and individual constants) used by the rules. Conversely, the DLP-fusion technique likewise enables one to "build ontologies on top of rules": it enables ontological definitions to be supplemented by rules, or imported into DL from rules. It also enables available efficient LP inferencing algorithms/implementations to be exploited for reasoning over large-scale DL ontologies.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
TL;DR: It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases.
Web Ontology Language: OWL
Grigoris Antoniou,Frank van Harmelen,Steffen Staab,Rudi Struder +3 more
- 01 Jan 2003
TL;DR: This chapter analyses the limitations of RDF Schema and derive requirements for a richer Web Ontology Language, and describes the three-layered architecture of the OWL language.
1.3K
A survey of automated web service composition methods
Jinghai Rao,Xiaomeng Su +1 more
- 06 Jul 2004
TL;DR: An overview of recent research efforts of automatic Web service composition both from the workflow and AI planning research community is given.
Linking data to ontologies
Antonella Poggi,Domenico Lembo,Diego Calvanese,Giuseppe De Giacomo,Maurizio Lenzerini,Riccardo Rosati +5 more
TL;DR: This paper presents a new ontology language, based on Description Logics, that is particularly suited to reason with large amounts of instances and a novel mapping language that is able to deal with the so-called impedance mismatch problem.
References
•Book
Principles of database and knowledge-base systems
Jeffrey D. Ullman
- 01 Jan 1979
TL;DR: This book goes into the details of database conception and use, it tells you everything on relational databases from theory to the actual used algorithms.
2.9K
•Book
The Description Logic Handbook
Franz Baader,Diego Calvanese,Deborah L. McGuinness,Daniele Nardi,Peter F. Patel-Schneider +4 more
- 18 Nov 2009
TL;DR: This introduction presents the main motivations for the development of Description Logics as a formalism for representing knowledge, as well as some important basic notions underlying all systems that have been created in the DL tradition.
2.2K
Attributive concept descriptions with complements
TL;DR: It is shown that deciding coherence and subsumption of such descriptions are PSPACE-complete problems that can be decided with linear space.
1.1K
Linear-time algorithms for testing the satisfiability of propositional horn formulae
William F. Dowling,Jean Gallier +1 more
TL;DR: The formulation of the satisfiability problem as a data flow problem appears to be new and suggests the possibility of improving efficiency using parallel processors.
1.1K