Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/775152.775160acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
Article

Description logic programs: combining logic programs with description logic

Published: 20 May 2003 Publication History

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.

References

[1]
F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. Patel-Schneider, editors. The Description Logic Handbook. Cambridge University Press, 2002.]]
[2]
C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19/20:73--148, 1994.]]
[3]
H. Boley, B. Grosof, M. Sintek, S. Tabet, and G. Wagner. RuleML Design, September 2002. http://www.dfki.uni-kl.de/ruleml/indesign.html.]]
[4]
A. Borgida. On the relative expressiveness of description logics and predicate logics. Artificial Intelligence, 82(1--2):353--367, 1996.]]
[5]
D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of PODS'98, pages 149--158, 1998.]]
[6]
D. Connolly, F. van Harmelen, I. Horrocks, D. L. McGuinness, P. F. Patel-Schneider, and L. A. Stein. DAML+ OIL (March 2001) Reference Description, December 2001. http://www.w3.org/TR/daml+oil-reference/.]]
[7]
F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. In Proc. of KR'91, pages 151--162, 1991.]]
[8]
W. Dowling and J. Gallier. Linear time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 3:267--284, 1984.]]
[9]
E. Grädel. On the restraining power of guards. J. of Symbolic Logic, 64:1719--1742, 1999.]]
[10]
V. Haarslev and R. Moller. Description of the RACER system and its applications. In DL2001 Workshop on Description Logics, Stanford, CA, 2001.]]
[11]
I. Horrocks and U. Sattler. Ontology reasoning in the SHOQ(D) description logic. In Proc. of IJCAI 2001, pages 199--204, 2001.]]
[12]
I. Horrocks, U. Sattler, S. Tessaris, and S. Tobies. How to decide query containment under constraints using a description logic. In Proc. of LPAR'2000, 2000.]]
[13]
I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for expressive description logics. In Proc. of LPAR'99, pages 161--180, 1999.]]
[14]
J. W. Lloyd. Foundations of logic programming (second, extended edition). Springer series in symbolic computation. Springer-Verlag, New York, 1987.]]
[15]
R. Ramakrishnan. Magic templates: A spellbinding approach to logic programs. J. Logic Programming, 11:189--216, 1991.]]
[16]
K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In R. T. Snodgrass and M. Winslett, editors, Proc. of the 1994 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'94), pages 442--453, 1994.]]
[17]
K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of IJCAI'91, pages 466--471, 1991.]]
[18]
J. D. Ullman. Principles of Database and Knowledge-base Systems, volume 1. Computer Science Press, 1988.]]
[19]
M. Y. Vardi. Why is modal logic so robustly decidable? In N. Immerman and P. Kolaitis, editors, Descriptive Complexity and Finite Models. American Mathematical Society, 1997.]]

Cited By

View all
  • (2024)A Resource Aware Memory Requirement Calculation Model for Memory Constrained Context-Aware SystemsIEEE Access10.1109/ACCESS.2024.336131712(19320-19329)Online publication date: 2024
  • (2024)Advanced Query Functionalities in Natural Logic Knowledge BasesInternational Journal of Computational Intelligence Systems10.1007/s44196-024-00484-x17:1Online publication date: 18-Apr-2024
  • (2023)Conjunctive query answering over unrestricted OWL 2 ontologiesSemantic Web10.3233/SW-23338214:6(997-1050)Online publication date: 13-Dec-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
WWW '03: Proceedings of the 12th international conference on World Wide Web
May 2003
772 pages
ISBN:1581136803
DOI:10.1145/775152
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 May 2003

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. RDF
  2. XML
  3. description logic
  4. inferencing
  5. information integration
  6. interoperability
  7. knowledge representation
  8. logic programs
  9. model-theoretic semantics
  10. ontologies
  11. rules
  12. semantic web
  13. translation

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)47
  • Downloads (Last 6 weeks)7
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)A Resource Aware Memory Requirement Calculation Model for Memory Constrained Context-Aware SystemsIEEE Access10.1109/ACCESS.2024.336131712(19320-19329)Online publication date: 2024
  • (2024)Advanced Query Functionalities in Natural Logic Knowledge BasesInternational Journal of Computational Intelligence Systems10.1007/s44196-024-00484-x17:1Online publication date: 18-Apr-2024
  • (2023)Conjunctive query answering over unrestricted OWL 2 ontologiesSemantic Web10.3233/SW-23338214:6(997-1050)Online publication date: 13-Dec-2023
  • (2021)Context Modeling in Predictive Analytics2021 International Conference on Information Technology and Nanotechnology (ITNT)10.1109/ITNT52450.2021.9649287(1-5)Online publication date: 20-Sep-2021
  • (2021)Reasoning on with Defeasibility in ASPTheory and Practice of Logic Programming10.1017/S147106842100013222:2(254-304)Online publication date: 3-Aug-2021
  • (2021)The Fusemate Logic Programming SystemAutomated Deduction – CADE 2810.1007/978-3-030-79876-5_34(589-601)Online publication date: 5-Jul-2021
  • (2020)A Tool for Transforming Semantic Web Rule Language to SPARQL Infererecing NotationInternational Journal on Semantic Web and Information Systems10.4018/IJSWIS.202001010516:1(87-115)Online publication date: Jan-2020
  • (2020)Ontologies and Data Management: A Brief SurveyKI - Künstliche Intelligenz10.1007/s13218-020-00686-334:3(329-353)Online publication date: 13-Aug-2020
  • (2020)Inductive Learning-Based SPARQL Query OptimizationData Science and Intelligent Applications10.1007/978-981-15-4474-3_14(121-135)Online publication date: 18-Jun-2020
  • (2020)Reasoning over Ontologies with DLVKnowledge Discovery, Knowledge Engineering and Knowledge Management10.1007/978-3-030-49559-6_6(114-136)Online publication date: 26-Jun-2020
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media