2003 International Workshop on Description Logics - DL'03
September 5-7, 2003
Accepted technical papers will be included in the proceedings.
The workshop proceedings will be distributed in paper form at the
workshop, and will be made available electronically in the
CEUR Workshop Proceedings series.
Both kinds of submission should be formatted similar to previous Description Logics workshops, following this example LaTeX file. You can also view compiled postscript and PDF versions of this example file, which contains some more explanations concerning the requested style. Please avoid headers, footers, and page numbering.The use of LaTeX is encouraged but not mandatory. If for some reason LaTeX cannot be used, print out the postscript or PDF version of the example submission and produce by any means a postscript or PDF file with the same margins and possibly the same layout for sections and bibliography. A Microsoft Word style file is not available.
Submissions should be sent by electronic mail as standard postscript or PDF attachments to
and must arrive before June 1, 2003. If you have any difficulties with the requested document format (e.g., because you do not use LaTeX or cannot generate postscript or PDF files), do not hesitate to contact the workshop organizers at firstname.lastname@example.org
Please include in the email (in plain text) the title, author(s), contact name/email, and a short abstract of the paper, e.g.:
|Title:||The Tractability of Subsumption in Frame-Based Description Languages|
|Author:||Ronald J. Brachman and Hector J. Levesque|
|Contact:||Hector J. Levesque <email@example.com>|
|Abstract:||A knowledge representation system provides an important service to the rest of a knowledge-based system: it computes automatically a set of inferences over the beliefs encoded within it. Given that the knowledge-based system relies on these inferences in the midst of its operation (i.e., its diagnosis, planning, or whatever), their computational tractability is an important concern. Here we present evidence as to how the cost of computing one kind of inference is directly related to the expressiveness of the representation language. As it turns out, this cost is perilously sensitive to small changes in the representation language. Even a seemingly simple frame-based description language can pose intractable computational obstacles.|