Skip to main content

Towards Service Description Logics

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2424))

Included in the following conference series:

  • 803 Accesses

Abstract

Semantic service description and matchmaking are needed in embedded and disappearing computing, cooperative multiagent systems, and the semantic web. Standard program semantics formalizations are not suited to modeling service semantics, because they are generic w.r.t. the data manipulated by programs, and because computation details are often irrelevant to the aforementioned applications of service descriptions. An ontology-based approach seems more appropriate. However, current ontology specification languages do not have primitives for service description. In this paper, we identify some useful service description constructs and study their impact on the decidability of reasoning with description logics.

See the W3C pages at www.w3.org/2001/sw/

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Calvanese, G. De Giacomo, M. Lenzerini. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In Proc. of IJCAI’99, 1999.

    Google Scholar 

  2. G. De Giacomo. Decidability of class-based knowledge representation formalisms. PhD Thesis, Universit`a di Roma “La Sapienza”, 1995.

    Google Scholar 

  3. E. Grädel, M. Otto, E. Rosen. Undecidability results on two-variable logics. Archive for Mathematical Logic, 38:213–354, 1999.

    Google Scholar 

  4. C. Lutz. NExpTime-complete description logics with concrete domains. LTCSReport 00-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2000.

    Google Scholar 

  5. C. Lutz, U. Sattler, F. Wolter. Description logics and the two-variable fragment. In Proc. of DL’01, 2001.

    Google Scholar 

  6. A. Omicini, F. Zambonelli, M. Klusch, R. Tolksdorf (eds). Coordination of Internet Agents, Springer, 2001.

    Google Scholar 

  7. U. Sattler, M.Y. Vardi. The hybrid μ-calculus. In Proc. of IJCAR’01, 2001.

    Google Scholar 

  8. K. Sycara, J. Lu, M. Klusch, S. Wido.. Matchmaking among heterogeneous agents on the internet. In Proc. of the AAAI Spring Symposium on Intelligent Agents in Cyberspace, Stanford, USA, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonatti, P.A. (2002). Towards Service Description Logics. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-45757-7_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44190-8

  • Online ISBN: 978-3-540-45757-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics