| ICLP 2002 Call for Papers | |||||||||||||||||||||||||||||||||||||||||||
TopicsSince the first ICLP, held in Marseilles in 1982, ICLP has been the premier international conference for presenting research into logic programming. Original papers are sought in all areas of logic programming including (but not restricted to):
Papers describing innovative applications of logic programming (in the broadest sense, e.g. including constraint programming, non-monotonic systems, etc.) are particularly sought. We welcome submission in, but not limited to, the following topics: surveys of an application area, problems to which logic programming may be applied, experience in applying logic programming, software engineering aspects of logic programming and areas where further research is required to meet industrial needs. There will be an award for the best application paper sponsored by IF/Prolog. SubmissionPapers must describe original, previously unpublished research, be written and presented in English, not exceed 15 pages (A4 or letter format, up to 5,000 words), and not be simultaneously submitted for publication elsewhere. The proceedings will be published by Springer Verlag in the Lecture Notes in Computer Science series. Authors are strongly encouraged to use LaTeX2e and the Springer llncs class file, available at http://www.springer.de/comp/lncs/authors.html. Submission is Web-based. In order to submit a paper, authors should upload it via the web at http://www.cs.mu.oz.au/~pjs/ICLP2002/ where more detailed instructions are given. If submission through the Web is not possible, five hard copies may be sent to the program chair. Authors intending to submit a paper are requested to submit an abstract of their paper, through the same web interface, before February 10, to help expedite the paper assignment process.
Associated WorkshopsSeveral pre-conference workshops will take place on July 27 and 28, as well as two parallel workshops on July 31 and August 1. See http://floc02.diku.dk/ICLP/ for a list. | |||||||||||||||||||||||||||||||||||||||||||