2002 International Workshop on Description Logics - DL2002

Toulouse, France
April 19-21, 2002

ASCII Version of the Call for Papers.

Call for Papers

We invite submissions of technical papers of 8 pages and short position papers (for people that want to participate in the workshop without giving talks). Authors of accepted technical and position papers will be invited to participate in the workshop (participation will be by invitation only).

Accepted technical papers will be included in the proceedings as normal papers (8 pages) or long papers (12 pages). The workshop proceedings will be distributed in paper form at the workshop, and will be made available electronically in the CEUR Workshop Proceedings series.

Important Dates

Paper submission deadline: January 21, 2002
Notification of acceptance: February 18, 2002
Camera ready papers due: March 10, 2002
DL2002 Workshop: April 19-21, 2002


We invite contributions on all other aspects of Description Logics. Possible subjects include

Submission Guidelines

If you want to submit a paper to DL2002, you are invited to send

Both kinds of submission should be formatted the same as for DL2000, following this example LaTeX file. You can also view a compiled version of this example file which contains some more explanations concerning the requested style.

Please avoid headers,footers, and page numbering.

Eletronic Submission

Submissions should be sent by electronic mail as standard postscript or PDF attachments to


and must arrive before January 21, 2002 If you have any difficulties with the requested document format (e.g., because you do not use LaTeX or cannot generate postscript files), do not hesitate to contact the workshop organizers at dl2002@cs.man.ac.uk.

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: Answering Conjunctive Queries Over DL Aboxes: a Preliminary Report
Author: Ian Horrocks and Sergio Tessaris
Contact: Ian Horrocks <horrocks@cs.man.ac.uk>
Abstract: A serious shortcoming of many Description Logic based knowledge representation systems is the inadequacy of their query languages. In this paper we present a novel technique that can be used to provide an expressive query language for such systems. One of the main advantages of this approach is that, being based on a reduction to knowledge base satisfiability, it can easily be adapted to most existing (and future) Description Logic implementations. We believe that providing Description Logic systems with an expressive query language for interrogating the knowledge base will significantly increase their utility.