skip to main content
10.1145/988672.988706acmconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
Article

Semantic email

Published:17 May 2004Publication History

ABSTRACT

This paper investigates how the vision of the Semantic Web can be carried overto the realm of email. We introduce a general notion of semantice mail, in which an email message consists of an RDF query or update coupled with corresponding explanatory text. Semantic email opens the door to a wide range of automated, email-mediated applications with formally guaranteed properties. In particular, this paper introduces a broad class of semantic email processes. For example consider the process of sending an email to a program committee asking who will attend the PC dinner automatically collecting the responses and tallying them up. We define bothlogical and decision-theoretic models where an email process ismodeled as a set of updates to a data set on which we specify goals via certain constraints or utilities. We then describe a set ofinference problems that arise while trying to satisfy these goals and analyze their computational tractability. In particular weshow that for the logical model it is possible to automatically infer which email responses are acceptable w.r.t. a set ofconstraints in polynomial time and for the decision-theoreticmodel it is possible to compute the optimal message-handling policy in polynomial time. Finally we discuss our publicly available implementation of semantic email and outline research challenges inthis realm.

References

  1. S. Abiteboul, V. Vianu, B. S. Fordham, and Y. Yesha. Relational transducers for electronic commerce. In Proc. of PODS, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Ankolenkar, M. Burstein, J. Hobbs, O. Lassila, D. Martin, S. McIlraith, S. Narayanan, M. Paolucci, T. Payne, K. Sycara, and H.Zeng. DAML-S: A semantic markup language for web services. In Proc. of the Semantic Web Working Symposium, pages 411--430, 2001.Google ScholarGoogle Scholar
  3. F. Baader and U. Sattler. Description logics with concrete domains and aggregation. In Proc. of the European Conference on Artificial Intelligence, pages 336--340, 1998.Google ScholarGoogle Scholar
  4. D. Bertsekas. Dynamic programming and optimal control. Athena Scientific, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B. Bonet and H. Geffner. Planning with incomplete information as heuristic search in belief space. In Proc. of Artificial Intelligence Planning Systems, pages 52--61, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C. Boutilier. A POMDP formulation of preference elicitation problems. In Proc. of AAAI, pages 239--246, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Boutilier, R. Dearden, and M. Goldszmidt. Exploiting structure in policy construction. In Proc. of IJCAI, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. A. Boyan and M. L. Littman. Exact solutions to time-dependent MDPs. In Proc. of Advances in Neural Information Processing Systems (NIPS), pages 1026--1032, 2000.Google ScholarGoogle Scholar
  9. S. Cohen, W. Nutt, and A. Serebrenik. Rewriting aggregate queries using views. In Proc. of PODS, pages 155--166, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Doan, P. Domingos, and A. Halevy. Reconciling schemas of disparate data sources: a machine learning approach. In Proc. of SIGMOD, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Doan, J. Madhavan, P. Domingos, and A. Halevy. Learning to map between ontologies on the semantic web. In Proc. of WWW, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. B. Doorenbos, O. Etzioni, and D. S. Weld. A scalable comparison-shopping agent for the world-wide web. In Proc. of the First International Conference on Autonomous Agents, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. O. Etzioni, A. Halevy, H. Levy, and L. McDowell. Semantic email: Adding lightweight data manipulation capabilities to the email habitat. In Proc. of Sixth Int. Workshop on the Web and Databases, 2003.Google ScholarGoogle Scholar
  14. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. M.I.T Press, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. F. Ferreira, D. Schwabe, and C. Lucena. Using semantic web services now. In Proc. of IX Brazilian Symp. on Hypermedia and Multimedia, 2003.Google ScholarGoogle Scholar
  16. S. Grumbach and L. Tininini. On the content of materialzed aggregate views. In Proc. of PODS, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. R. Hull, M. Benedikt, V. Christophides, and J. Su. E-Services: A look behind the curtain. In Proc. of PODS, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Kalyanpur, B. Parsia, J. Hendler, and J. Golbeck. SMORE - semantic markup, ontology, and RDF editor. http://www.mindswap.org/papers/.Google ScholarGoogle Scholar
  19. S. Kumar, A. Kunjithapatham, M. Sheshagiri, T. Finin, A. Joshi, Y. Peng, and R. S. Cost. A personal agent application for the semantic web. In AAAI Fall Symposium on Personalized Agents, 2002.Google ScholarGoogle Scholar
  20. N. Kushmerick, R. Doorenbos, and D. Weld. Wrapper induction for information extraction. In Proc. of IJCAI, 1997.Google ScholarGoogle Scholar
  21. A. Y. Levy, I. S. Mumick, and Y. Sagiv. Query optimization by predicate move-around. In Proc. of VLDB, pages 96--107, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. L. Littman. Probabilistic propositional planning: Representations and complexity. In Proc. of AAAI, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. M. L. Littman, T. L. Dean, and L. P. Kaelbling. On the complexity of solving Markov decision problems. In Proc. of UAI, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. T. Malone, K. Grant, F. Turbak, S. Brobst, and M. Cohen. Intelligent information-sharing systems. Comm. of the ACM, 30(5):390--402, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. B. McBride. Jena: Implementing the RDF model and syntax specification. In Proc. of the 2001 Semantic Web Workshop, 2001.Google ScholarGoogle Scholar
  26. L. McDowell, O. Etzioni, S. D. Gribble, A. Halevy, H. Levy, W. Pentney, D. Verma, and S. Vlasseva. Mangrove: Enticing ordinary people onto the semantic web via instant gratification. In Proc. of Second International Semantic Web Conference, October 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. S. A. McIlraith, T. C. Son, and H. Zeng. Mobilizing the semantic web with daml-enabled web services. In Proc. of Semantic Web Workshop, 2001.Google ScholarGoogle Scholar
  28. C. Mohan. Workflow management in the internet age. www.almaden.ibm.com/u/mohan/workflow.pdf, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. S. Mukherjee, H. Davulcu, M. Kifer, P. Senkul, and G. Yang. Logic based approaches to workflow modeling and verification. In Logics for Emerging Applications of Databases, 2003.Google ScholarGoogle Scholar
  30. T. Payne, R. Singh, and K. Sycara. Calendar agents on the semantic web. IEEE Intelligent Systems, 3(11):84--86, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. A. Pnueli. The temporal logic of programs. In Proc. of the 18th Annual IEEE Symposium on Foundations of Computer Science, 1977.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. M. Puterman. Markov decision processes. Wiley Inter-science, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  33. K. Ross, D. Srivastava, P. Stuckey, and S. Sudarshan. Foundations of aggregation constraints. In Principles and Practice of Constraint Programming. LNCS, 874. Springer Verlag, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. P. Senkul, M. Kifer, and I. H. Toroslu. A logical framework for scheduling workflows under resource allocation constraints. In Proc. of VLDB, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. L. J. Stockmeyer and A. K. Chandra. Provably difficult combinatorial games. SIAM Journal on Computing, 8(2):151--174, 1979.Google ScholarGoogle Scholar
  36. V. Tamma, M. Wooldridge, and I. Dickinson. An ontology-based approach to automated negotiation. In Proc. of AMEC, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. W3C. RDF calendar workspace. http://www.w3.org/2002/12/cal/.Google ScholarGoogle Scholar

Index Terms

  1. Semantic email

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        WWW '04: Proceedings of the 13th international conference on World Wide Web
        May 2004
        754 pages
        ISBN:158113844X
        DOI:10.1145/988672

        Copyright © 2004 ACM

        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]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 17 May 2004

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate1,899of8,196submissions,23%

        Upcoming Conference

        WWW '24
        The ACM Web Conference 2024
        May 13 - 17, 2024
        Singapore , Singapore

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader