Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

hp.com home


Technical Reports


printable version
» 

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» People
» Worldwide sites
» Downloads
Content starts here

  Click here for full text: PDF

An ontology for publishing and scheduling events and the lessons learned in developing it.

Sayers, Craig; Letsinger, Reed

HPL-2002-162

Keyword(s): software agents; scheduling; meeting; event; ontology; calendar

Abstract: This paper provides a brief overview of an ontology for publishing and scheduling events. It summarizes our experiences using the FIPA SL0 language in a Jade environment, and aims to capture some practical lessons for future ontology development. The described ontology supports the preferences and uncertainty which are a natural consequence of holding events with real people, in a real world. It represents the relationships between event times, places, and people; handles events that are physically or temporally distributed; and serves to describe events during all stages of scheduling, starting from an initial imprecise specification, and ending with an exact event description suitable for publication. For future ontology development we argue for placing the burden on content producers, rather than consumers; for maintaining a single consistent representation; and for pushing localization and presentation issues to the edges of the network. In addition, we recommend exploiting hierarchies in the information (particularly with recursion) and allowing for the representation of incomplete knowledge.

4 Pages

Back to Index

»Technical Reports

» 2009
» 2008
» 2007
» 2006
» 2005
» 2004
» 2003
» 2002
» 2001
» 2000
» 1990 - 1999

Heritage Technical Reports

» Compaq & DEC Technical Reports
» Tandem Technical Reports
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.