This paper investigates how the vision of the Semantic Web can
be carried over to the realm of email. We introduce a general
notion of semantic email, 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
dene both logical and decision-theoretic models where an email
process is modeled as a set of updates to a data set on which we
specify goals via certain constraints or utilities. We then describe
a set of inference problems that arise while trying to satisfy these
goals and analyze their computational tractability. In particular, we
show that for the logical model it is possible to automatically infer
which email responses are acceptable w.r.t. a set of constraints in
polynomial time, and for the decision-theoretic model 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 in this realm.
%0 Conference Paper
%1 citeulike:532292
%A Mcdowell, Luke
%A Etzioni, Oren
%A Halevy, Alon
%A Levy, Henry
%B WWW '04: Proceedings of the 13th international conference on World Wide Web
%C New York, NY, USA
%D 2004
%I ACM Press
%K sip semanticinfusion
%P 244--254
%R 10.1145/988672.988706
%T Semantic email
%U http://dx.doi.org/10.1145/988672.988706
%X This paper investigates how the vision of the Semantic Web can
be carried over to the realm of email. We introduce a general
notion of semantic email, 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
dene both logical and decision-theoretic models where an email
process is modeled as a set of updates to a data set on which we
specify goals via certain constraints or utilities. We then describe
a set of inference problems that arise while trying to satisfy these
goals and analyze their computational tractability. In particular, we
show that for the logical model it is possible to automatically infer
which email responses are acceptable w.r.t. a set of constraints in
polynomial time, and for the decision-theoretic model 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 in this realm.
%@ 158113844X
@inproceedings{citeulike:532292,
abstract = {This paper investigates how the vision of the Semantic Web can
be carried over to the realm of email. We introduce a general
notion of semantic email, 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
dene both logical and decision-theoretic models where an email
process is modeled as a set of updates to a data set on which we
specify goals via certain constraints or utilities. We then describe
a set of inference problems that arise while trying to satisfy these
goals and analyze their computational tractability. In particular, we
show that for the logical model it is possible to automatically infer
which email responses are acceptable w.r.t. a set of constraints in
polynomial time, and for the decision-theoretic model 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 in this realm.},
added-at = {2006-06-16T10:34:37.000+0200},
address = {New York, NY, USA},
author = {Mcdowell, Luke and Etzioni, Oren and Halevy, Alon and Levy, Henry},
biburl = {https://www.bibsonomy.org/bibtex/21c78584881cf5cc26c0ccdf4b5658d7c/ldietz},
booktitle = {WWW '04: Proceedings of the 13th international conference on World Wide Web},
citeulike-article-id = {532292},
comment = {Introductionto Semantic Email},
doi = {10.1145/988672.988706},
interhash = {83877da8803e594ff54a530fb61b6a3c},
intrahash = {1c78584881cf5cc26c0ccdf4b5658d7c},
isbn = {158113844X},
keywords = {sip semanticinfusion},
pages = {244--254},
priority = {1},
publisher = {ACM Press},
timestamp = {2006-06-16T10:34:37.000+0200},
title = {Semantic email},
url = {http://dx.doi.org/10.1145/988672.988706},
year = 2004
}