<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
	<id>tag:old.nabble.com,2006:forum-14109</id>
	<title>Nabble - Lambda Prolog</title>
	<updated>2009-11-04T07:38:47Z</updated>
	<link rel="self" type="application/atom+xml" href="http://old.nabble.com/Lambda-Prolog-f14109.xml" />
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Lambda-Prolog-f14109.html" />
	<subtitle type="html">This is a moderated mailing list for discussions broadly related to the Lambda Prolog language.</subtitle>
	
<entry>
	<id>tag:old.nabble.com,2006:post-26219378</id>
	<title>LATA 2010: last call for papers</title>
	<published>2009-11-04T07:38:47Z</published>
	<updated>2009-11-04T07:38:47Z</updated>
	<author>
		<name>carlos.martin</name>
	</author>
	<content type="html">*********************************************************************
&lt;br&gt;&lt;br&gt;Last Call for Papers
&lt;br&gt;&lt;br&gt;4th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2010)
&lt;br&gt;&lt;br&gt;Trier, Germany, May 24-28, 2010
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://grammars.grlmc.com/LATA2010/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://grammars.grlmc.com/LATA2010/&lt;/a&gt;&lt;br&gt;&lt;br&gt;*********************************************************************
&lt;br&gt;&lt;br&gt;Deadline: December 3
&lt;br&gt;&lt;br&gt;Please notice that the deadline is firm and will not be extended !
&lt;br&gt;=====================================================================
&lt;br&gt;&lt;br&gt;AIMS:
&lt;br&gt;&lt;br&gt;LATA is a yearly conference in theoretical computer science and its applications. As linked to the International PhD School in Formal Languages and Applications that was developed at Rovira i Virgili University (the host of the previous three editions and co-organizer of this one) in the period 2002-2006, LATA 2010 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.).
&lt;br&gt;&lt;br&gt;SCOPE:
&lt;br&gt;&lt;br&gt;Topics of either theoretical or applied interest include, but are not limited to:
&lt;br&gt;&lt;br&gt;- algebraic language theory
&lt;br&gt;- algorithms on automata and words
&lt;br&gt;- automata and logic
&lt;br&gt;- automata for system analysis and programme verification
&lt;br&gt;- automata, concurrency and Petri nets
&lt;br&gt;- cellular automata
&lt;br&gt;- combinatorics on words
&lt;br&gt;- computability
&lt;br&gt;- computational complexity
&lt;br&gt;- computer linguistics
&lt;br&gt;- data and image compression
&lt;br&gt;- decidability questions on words and languages
&lt;br&gt;- descriptional complexity
&lt;br&gt;- DNA and other models of bio-inspired computing
&lt;br&gt;- document engineering
&lt;br&gt;- foundations of finite state technology
&lt;br&gt;- fuzzy and rough languages
&lt;br&gt;- grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.)
&lt;br&gt;- grammars and automata architectures
&lt;br&gt;- grammatical inference and algorithmic learning
&lt;br&gt;- graphs and graph transformation
&lt;br&gt;- language varieties and semigroups
&lt;br&gt;- language-based cryptography
&lt;br&gt;- language-theoretic foundations of artificial intelligence and artificial life
&lt;br&gt;- neural networks
&lt;br&gt;- parallel and regulated rewriting
&lt;br&gt;- parsing
&lt;br&gt;- pattern matching and pattern recognition
&lt;br&gt;- patterns and codes
&lt;br&gt;- power series
&lt;br&gt;- quantum, chemical and optical computing
&lt;br&gt;- semantics
&lt;br&gt;- string and combinatorial issues in computational biology and bioinformatics
&lt;br&gt;- symbolic dynamics
&lt;br&gt;- term rewriting
&lt;br&gt;- text algorithms
&lt;br&gt;- text retrieval
&lt;br&gt;- transducers
&lt;br&gt;- trees, tree languages and tree machines
&lt;br&gt;- weighted machines
&lt;br&gt;&lt;br&gt;STRUCTURE:
&lt;br&gt;&lt;br&gt;LATA 2010 will consist of:
&lt;br&gt;&lt;br&gt;- 3 invited talks
&lt;br&gt;- 2 invited tutorials
&lt;br&gt;- refereed contributions
&lt;br&gt;- open sessions for discussion in specific subfields, on open problems, or on professional issues (if requested by the participants)
&lt;br&gt;&lt;br&gt;INVITED SPEAKERS:
&lt;br&gt;&lt;br&gt;John Brzozowski (Waterloo), Complexity in Convex Languages
&lt;br&gt;Alexander Clark (London), Three Learnable Models for the Description of Language
&lt;br&gt;Lauri Karttunen (Palo Alto), to be announced (tutorial)
&lt;br&gt;Borivoj Melichar (Prague), Arbology: Trees and Pushdown Automata
&lt;br&gt;Anca Muscholl (Bordeaux), Communicating Automata (tutorial)
&lt;br&gt;&lt;br&gt;PROGRAMME COMMITTEE:
&lt;br&gt;&lt;br&gt;Alberto Apostolico (Atlanta)
&lt;br&gt;Thomas Bäck (Leiden)
&lt;br&gt;Stefania Bandini (Milano)
&lt;br&gt;Wolfgang Banzhaf (St. John's)
&lt;br&gt;Henning Bordihn (Potsdam)
&lt;br&gt;Kwang-Moo Choe (Daejeon)
&lt;br&gt;Andrea Corradini (Pisa)
&lt;br&gt;Christophe Costa Florencio (Leuven)
&lt;br&gt;Maxime Crochemore (Marne-la-Vallée)
&lt;br&gt;W. Bruce Croft (Amherst)
&lt;br&gt;Erzsébet Csuhaj-Varjú (Budapest)
&lt;br&gt;Jürgen Dassow (Magdeburg)
&lt;br&gt;Volker Diekert (Stuttgart)
&lt;br&gt;Rodney G. Downey (Wellington)
&lt;br&gt;Frank Drewes (Umea)
&lt;br&gt;Henning Fernau (Trier, co-chair)
&lt;br&gt;Rusins Freivalds (Riga)
&lt;br&gt;Rudolf Freund (Wien)
&lt;br&gt;Paul Gastin (Cachan)
&lt;br&gt;Edwin Hancock (York, UK)
&lt;br&gt;Markus Holzer (Giessen)
&lt;br&gt;Helmut Jürgensen (London, Canada)
&lt;br&gt;Juhani Karhumäki (Turku)
&lt;br&gt;Efim Kinber (Fairfield)
&lt;br&gt;Claude Kirchner (Bordeaux)
&lt;br&gt;Brian Marcus (Vancouver)
&lt;br&gt;Carlos Martín-Vide (Brussels, co-chair)
&lt;br&gt;Risto Miikkulainen (Austin)
&lt;br&gt;Victor Mitrana (Bucharest)
&lt;br&gt;Claudio Moraga (Mieres)
&lt;br&gt;Sven Naumann (Trier)
&lt;br&gt;Chrystopher Nehaniv (Hatfield)
&lt;br&gt;Maurice Nivat (Paris)
&lt;br&gt;Friedrich Otto (Kassel)
&lt;br&gt;Daniel Reidenbach (Loughborough)
&lt;br&gt;Klaus Reinhardt (Tübingen)
&lt;br&gt;Antonio Restivo (Palermo)
&lt;br&gt;Christophe Reutenauer (Montréal)
&lt;br&gt;Kai Salomaa (Kingston, Canada)
&lt;br&gt;Jeffrey Shallit (Waterloo)
&lt;br&gt;Eljas Soisalon-Soininen (Helsinki)
&lt;br&gt;Bernhard Steffen (Dortmund)
&lt;br&gt;Frank Stephan (Singapore)
&lt;br&gt;Wolfgang Thomas (Aachen)
&lt;br&gt;Marc Tommasi (Lille)
&lt;br&gt;Esko Ukkonen (Helsinki)
&lt;br&gt;Todd Wareham (St. John's)
&lt;br&gt;Osamu Watanabe (Tokyo)
&lt;br&gt;Bruce Watson (Pretoria)
&lt;br&gt;Thomas Wilke (Kiel)
&lt;br&gt;Slawomir Zadrozny (Warsaw)
&lt;br&gt;Binhai Zhu (Bozeman)
&lt;br&gt;&lt;br&gt;ORGANIZING COMMITTEE:
&lt;br&gt;&lt;br&gt;Adrian Horia Dediu (Tarragona)
&lt;br&gt;Henning Fernau (Trier, co-chair) 
&lt;br&gt;Maria Gindorf (Trier)
&lt;br&gt;Stefan Gulan (Trier)
&lt;br&gt;Anna Kasprzik (Trier)
&lt;br&gt;Carlos Martín-Vide (Brussels, co-chair) 
&lt;br&gt;Norbert Müller (Trier)
&lt;br&gt;Bianca Truthe (Magdeburg)
&lt;br&gt;&lt;br&gt;SUBMISSIONS:
&lt;br&gt;&lt;br&gt;Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single-spaced pages and should be formatted according to the standard format for Springer Verlag's LNCS series (see &lt;a href=&quot;http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0&lt;/a&gt;). Submissions have to be uploaded at:
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://www.easychair.org/conferences/?conf=lata2010&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/conferences/?conf=lata2010&lt;/a&gt;&lt;br&gt;&lt;br&gt;PUBLICATIONS:
&lt;br&gt;&lt;br&gt;A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference.
&lt;br&gt;&lt;br&gt;A special issue of the Journal of Computer and System Sciences (Elsevier) will be later published containing refereed extended versions of some of the papers contributed to the conference. Submissions to it will be only by invitation.
&lt;br&gt;&lt;br&gt;A special issue of another major journal containing papers oriented to applications is under consideration.
&lt;br&gt;&lt;br&gt;REGISTRATION:
&lt;br&gt;&lt;br&gt;The period for registration will be open since September 1, 2009 until May 24, 2010. The registration form can be found at the website of the conference: &lt;a href=&quot;http://grammars.grlmc.com/LATA2010/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://grammars.grlmc.com/LATA2010/&lt;/a&gt;&lt;br&gt;&lt;br&gt;Early registration fees: 500 Euro
&lt;br&gt;Early registration fees (PhD students): 400 Euro
&lt;br&gt;Late registration fees: 530 Euro
&lt;br&gt;Late registration fees (PhD students): 430 Euro
&lt;br&gt;On-site registration fees: 550 Euro
&lt;br&gt;On-site registration fees (PhD students): 450 Euro
&lt;br&gt;&lt;br&gt;At least one author per paper should register. Papers that do not have a registered author by February 15, 2010 will be excluded from the proceedings.
&lt;br&gt;&lt;br&gt;Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks, lunches, excursion, and conference dinner.
&lt;br&gt;&lt;br&gt;PAYMENT:
&lt;br&gt;&lt;br&gt;Early (resp. late) registration fees must be paid by bank transfer before February 15, 2010 (resp. May 14, 2010) to the conference series account at Open Bank (Plaza Manuel Gomez Moreno 2, 28020 Madrid, Spain): IBAN: ES1300730100510403506598 - Swift code: OPENESMMXXX (account holder: Carlos Martin-Vide &amp; URV – LATA 2010).
&lt;br&gt;&lt;br&gt;Please write the participant’s name in the subject of the bank form. Transfers should not involve any expense for the conference.
&lt;br&gt;&lt;br&gt;On-site registration fees can be paid only in cash.
&lt;br&gt;&lt;br&gt;A receipt for the payment will be provided on site.
&lt;br&gt;&lt;br&gt;Besides paying the registration fees, it is required to fill in the registration form at the website of the conference.
&lt;br&gt;&lt;br&gt;BEST PAPER AWARDS:
&lt;br&gt;&lt;br&gt;An award will be offered to the authors of the two best papers accepted to the conference. Only papers fully authored by PhD students are eligible. The award intends to cover their travel expenses.
&lt;br&gt;&lt;br&gt;IMPORTANT DATES:
&lt;br&gt;&lt;br&gt;Paper submission: December 3, 2009 *
&lt;br&gt;Notification of paper acceptance or rejection: January 21, 2010
&lt;br&gt;Final version of the paper for the LNCS proceedings: February 3, 2010
&lt;br&gt;Early registration: February 15, 2010
&lt;br&gt;Late registration: May 14, 2010
&lt;br&gt;Starting of the conference: May 24, 2010
&lt;br&gt;Submission to the post-conference special issue(s): August 27, 2010
&lt;br&gt;&lt;br&gt;* Contributors who have submitted by the deadline will be allowed to upload an updated version until December 10.
&lt;br&gt;&lt;br&gt;FURTHER INFORMATION:
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26219378&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;gindorf-ti@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;CONTACT:
&lt;br&gt;&lt;br&gt;LATA 2010
&lt;br&gt;Universität Trier
&lt;br&gt;Fachbereich IV – Informatik
&lt;br&gt;Campus II, Behringstraße
&lt;br&gt;D-54286 Trier
&lt;br&gt;&lt;br&gt;Phone: +49-(0)651-201-2836
&lt;br&gt;Fax: +49-(0)651-201-3954
&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26219378&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/LATA-2010%3A-last-call-for-papers-tp26219378p26219378.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26219439</id>
	<title>PAKM Verteiler KSEM Conference Program Announced</title>
	<published>2009-11-03T08:58:52Z</published>
	<updated>2009-11-03T08:58:52Z</updated>
	<author>
		<name>PAKM Verteiler</name>
	</author>
	<content type="html">(Mailing list information, including unsubscription instructions, is located at the end of this message.)
&lt;br&gt;__ 
&lt;br&gt;&lt;br&gt;Dear Ladies and Gentlemen, 
&lt;br&gt;&lt;br&gt;We would like to inform you that the conference program for the KSEM2009 - 3rd International Conference on Knowledge Science, Engineering and Management has been published. For details please see ksem2009.dke.univie.ac.at/ksem_programm.html. 
&lt;br&gt;&lt;br&gt;We are honoured to announce the participation of Prof. John Mylopoulos, University of Trento, and Prof. Fangzhen Lin, Hong Kong University of Science and Technology as invited speakers to the KSEM2009. Prof. Mylopoulos will talk about Models in Knowledge Management, while Prof. Lin will speak about Two Applications of Computer-Aided Theorem Discovery and Verification.
&lt;br&gt;&lt;br&gt;Furthermore we would like to announce two panel discussions to be held during the conference: one on the topic of Required Knowledge for Delivering Services and one on  Knowware: The Third Star after Hardware and Software.
&lt;br&gt;&lt;br&gt;We look forward to welcoming you in Vienna for the KSEM2009. 
&lt;br&gt;&lt;br&gt;Sincerely yours, 
&lt;br&gt;Zhi Jin and Dimitris Karagiannis
&lt;br&gt;&lt;br&gt;&lt;br&gt;-- 
&lt;br&gt;The following information is a reminder of your current mailing
&lt;br&gt;list subscription: 
&lt;br&gt;&lt;br&gt;You are subscribed to the following list:
&lt;br&gt;&amp;nbsp; 
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; PAKM Verteiler
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;using the following email:
&lt;br&gt;&amp;nbsp;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26219439&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;You may automatically unsubscribe from this list at any time by 
&lt;br&gt;visiting the following URL:
&lt;br&gt;&amp;nbsp;
&lt;br&gt;&amp;lt;&lt;a href=&quot;http://tools.dke.univie.ac.at/verteiler/mail.cgi/u/pakm01/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://tools.dke.univie.ac.at/verteiler/mail.cgi/u/pakm01/&lt;/a&gt;&amp;gt;
&lt;br&gt;&lt;br&gt;If the above URL is inoperable, make sure that you have copied the 
&lt;br&gt;entire address. Some mail readers will wrap a long URL and thus break
&lt;br&gt;this automatic unsubscribe mechanism. 
&lt;br&gt;&lt;br&gt;You may also change your subscription by visiting this list's main screen: 
&lt;br&gt;&amp;nbsp;
&lt;br&gt;&amp;lt;&lt;a href=&quot;http://tools.dke.univie.ac.at/verteiler/mail.cgi/list/pakm01&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://tools.dke.univie.ac.at/verteiler/mail.cgi/list/pakm01&lt;/a&gt;&amp;gt;
&lt;br&gt;&lt;br&gt;If you're still having trouble, please contact the list owner at: 
&lt;br&gt;&amp;nbsp;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;lt;mailto:&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26219439&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;pakm@...&lt;/a&gt;&amp;gt;
&lt;br&gt;&lt;br&gt;The following physical address is associated with this mailing list: 
&lt;br&gt;&amp;nbsp;
&lt;br&gt;Vienna, Austria
&lt;br&gt;&lt;br&gt;Mailing List Powered by Dada Mail
&lt;br&gt;&lt;a href=&quot;http://tools.dke.univie.ac.at/verteiler/mail.cgi/what_is_dada_mail/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://tools.dke.univie.ac.at/verteiler/mail.cgi/what_is_dada_mail/&lt;/a&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26219439&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/PAKM-Verteiler-KSEM-Conference-Program-Announced-tp26219439p26219439.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26219249</id>
	<title>contest: how to combine logics?</title>
	<published>2009-11-02T02:19:50Z</published>
	<updated>2009-11-02T02:19:50Z</updated>
	<author>
		<name>Universal Logic</name>
	</author>
	<content type="html">How to combine logics?
&lt;br&gt;&lt;br&gt;This will be the contest for
&lt;br&gt;the universal logic 2010 price offered by Birkhäuser at the
&lt;br&gt;World Congress on Universal Logic III
&lt;br&gt;Lisbon, Portugal, April 22-25, 2010
&lt;br&gt;&lt;a href=&quot;http://www.uni-log.org&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.uni-log.org&lt;/a&gt;&lt;br&gt;&lt;br&gt;When we have two logics, we may want to put them together.
&lt;br&gt;For example on the one hand we have a temporal logic and on the other hand
&lt;br&gt;we have a deontic logic, how then to put them together to produce a
&lt;br&gt;temporal deontic logic in which we can deal with sentences such as
&lt;br&gt;&amp;quot;Sometimes it is allowed to eat chocolate&amp;quot;?
&lt;br&gt;&lt;br&gt;This is a very interesting question in the engineering of logic. People
&lt;br&gt;have been working in the subject since about 15 years. But there are still
&lt;br&gt;some fundamental problems not completely solved. These problems are
&lt;br&gt;connected to the very nature of what a logical system is. One may wonder
&lt;br&gt;if the intuitive definition of combination of logic as the smallest
&lt;br&gt;conservative extension of two given logics really works, and also if it is
&lt;br&gt;always possible to combine two logics.
&lt;br&gt;&lt;br&gt;If you want to take part to this contest send a short paper (10 to 15
&lt;br&gt;pages) to &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26219249&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;unilog2010@...&lt;/a&gt; before November 15th, 2009. The best ones
&lt;br&gt;will be selected for presentation at a special session during the congress
&lt;br&gt;and a jury will then decide who the winner is.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26219249&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/contest%3A-how-to-combine-logics--tp26219249p26219249.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26219299</id>
	<title>call for organizing next AFP summerschool (2010)</title>
	<published>2009-11-02T00:55:12Z</published>
	<updated>2009-11-02T00:55:12Z</updated>
	<author>
		<name>rinus plasmeijer</name>
	</author>
	<content type="html">&lt;!DOCTYPE HTML PUBLIC &quot;-//W3C//DTD HTML 4.0 Transitional//EN&quot;&gt;
&lt;HTML&gt;&lt;HEAD&gt;
&lt;META http-equiv=Content-Type content=&quot;text/html; charset=iso-8859-1&quot;&gt;
&lt;META content=&quot;MSHTML 6.00.6001.18248&quot; name=GENERATOR&gt;

&lt;/HEAD&gt;
&lt;BODY bgColor=#ffffff&gt;
&lt;DIV&gt;&lt;FONT face=Arial size=2&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-outline-level: 1&quot;&gt;&lt;B&gt;&lt;SPAN style=&quot;FONT-SIZE: 24pt; COLOR: #306090; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'; mso-font-kerning: 18.0pt&quot;&gt;Call 
for organizers:&lt;BR&gt;The Advanced Functional Programming School, 
2010.&lt;?xml:namespace prefix = o ns = &quot;urn:schemas-microsoft-com:office:office&quot; 
/&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/B&gt;&lt;/P&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 0pt; LINE-HEIGHT: normal&quot;&gt;&lt;A href=&quot;&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; COLOR: #006090; FONT-FAMILY: 'Times New Roman','serif'; TEXT-DECORATION: none; mso-fareast-font-family: 'Times New Roman'; text-underline: none&quot;&gt;http://www.cs.uu.nl/~johanj/afp/&lt;/SPAN&gt;&lt;/A&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/P&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;We 
solicit plans for organizing the next Advanced Functional Programming School. 
Since 1995 there have been six Schools on Advanced Functional Programming: 
&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/P&gt;
&lt;UL type=disc&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l4 level1 lfo1; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;COLOR: windowtext&quot;&gt;&lt;A href=&quot;&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;&lt;FONT color=#0000ff&gt;2008, LNCS 5832, Nijmegen, The 
  Netherlands&lt;/FONT&gt;&lt;/SPAN&gt;&lt;/A&gt;&lt;/SPAN&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt; 
  &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l4 level1 lfo1; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;COLOR: windowtext&quot;&gt;&lt;A href=&quot;&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;&lt;FONT color=#0000ff&gt;2004, LNCS 3622, Tartu, Estonia&lt;/FONT&gt;&lt;/SPAN&gt;&lt;/A&gt;&lt;/SPAN&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt; 
  &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l4 level1 lfo1; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;COLOR: windowtext&quot;&gt;&lt;A href=&quot;&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;&lt;FONT color=#0000ff&gt;2002, LNCS 2638, Oxford, UK&lt;/FONT&gt;&lt;/SPAN&gt;&lt;/A&gt;&lt;/SPAN&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt; 
  &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l4 level1 lfo1; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;COLOR: windowtext&quot;&gt;&lt;A href=&quot;&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;&lt;FONT color=#0000ff&gt;1998, LNCS 1608, Braga, Portugal&lt;/FONT&gt;&lt;/SPAN&gt;&lt;/A&gt;&lt;/SPAN&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt; 
  &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l4 level1 lfo1; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;1996, 
  LNCS 1129, Olympia, WA, USA &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l4 level1 lfo1; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;1995, 
  LNCS 925, Baastad, Sweden &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;&lt;/UL&gt;
&lt;DIV class=MsoNormal style=&quot;MARGIN: 0cm 0cm 0pt; LINE-HEIGHT: normal; TEXT-ALIGN: center&quot; align=center&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;
&lt;HR align=center width=&quot;100%&quot; SIZE=2&gt;
&lt;/SPAN&gt;&lt;/DIV&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-outline-level: 2&quot;&gt;&lt;B&gt;&lt;SPAN style=&quot;FONT-SIZE: 18pt; COLOR: #306090; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;The 
goals of this series of schools are&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/B&gt;&lt;/P&gt;
&lt;UL type=disc&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l1 level1 lfo2; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Bring 
  computer scientists, in particular young researchers and programmers, up to 
  date with the latest AFP techniques. &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l1 level1 lfo2; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Use 
  AFP techniques in &quot;programming in the real world&quot;. &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l1 level1 lfo2; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Bridge 
  the gap between results presented at programming conferences and material from 
  introductory textbooks on functional programming. &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;&lt;/UL&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-outline-level: 2&quot;&gt;&lt;B&gt;&lt;SPAN style=&quot;FONT-SIZE: 18pt; COLOR: #306090; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;The 
approach we take to achieve these goals in the schools 
is&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/B&gt;&lt;/P&gt;
&lt;UL type=disc&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l2 level1 lfo3; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;In 
  depth lectures about AFP techniques, taught by experts in the field. 
  &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l2 level1 lfo3; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Lectures 
  are accompanied by practical problems to be solved by the students at the 
  school. The problems guide the students' learning to a great extent. This 
  implies that there has to be a lab at the school site. &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l2 level1 lfo3; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Group 
  work is stimulated, especially because the practical problems will typically 
  be too large for a single person. &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;&lt;/UL&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;By 
functional programming we mean programming in a style that emphasizes the 
evaluation of expressions rather than the execution of 
commands.&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/P&gt;
&lt;DIV class=MsoNormal style=&quot;MARGIN: 0cm 0cm 0pt; LINE-HEIGHT: normal; TEXT-ALIGN: center&quot; align=center&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;
&lt;HR align=center width=&quot;100%&quot; SIZE=2&gt;
&lt;/SPAN&gt;&lt;/DIV&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;The 
lecture notes of the Advanced Functional Programming schools are published after 
the school. The organizers are responsible for publishing the lecture notes. 
&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/P&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Please 
submit a proposal for organizing the next advanced functional programming 
school.&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/P&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-outline-level: 2&quot;&gt;&lt;B&gt;&lt;SPAN style=&quot;FONT-SIZE: 18pt; COLOR: #306090; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Your 
proposal should include&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/B&gt;&lt;/P&gt;
&lt;UL type=disc&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l3 level1 lfo4; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;the 
  name of the organizers (preferably more than one) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l3 level1 lfo4; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;a 
  programme: lecturers (a mix of young and bright, and old and wise lecturers is 
  preferred) and topics (keep in mind that lectures have to be about 
  &quot;programming in the real world&quot;. Applications of functional programming are 
  very important for the school) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l3 level1 lfo4; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;the 
  approximate dates (preferably somewhere in 2010) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l3 level1 lfo4; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;a 
  location &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l3 level1 lfo4; tab-stops: list 36.0pt&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;a 
  budget, including an estimation of the registration and hotel costs per 
  participant.&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;&lt;/UL&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt 18pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;The 
programme, dates, location and budget don't have to be completely fixed when you 
submit your proposal, but there should be sufficient information to review your 
proposal. Your proposal will be reviewed by the steering committee of the 
Advanced Functional Programming Schools, consisting of&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/P&gt;
&lt;P class=MsoListParagraph style=&quot;MARGIN: 0cm 0cm 10pt 36pt; TEXT-INDENT: -18pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-add-space: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; COLOR: black; FONT-FAMILY: Symbol; mso-fareast-font-family: Symbol; mso-bidi-font-family: Symbol&quot;&gt;&lt;SPAN style=&quot;mso-list: Ignore&quot;&gt;·&lt;SPAN style=&quot;FONT: 7pt 'Times New Roman'&quot;&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 
&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; COLOR: black; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Peter 
Achten (AFP6) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/P&gt;
&lt;UL type=disc&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Pedro 
  Henriques (AFP3) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Johan 
  Jeuring (AFP4, AFP5) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Simon 
  Peyton Jones (AFP4) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Pieter 
  Koopman (AFP6) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Erik 
  Meijer (AFP2) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Rinus 
  Plasmeijer (Chairman, AFP6) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Tim 
  Sheard (AFP2) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Doaitse 
  Swierstra (AFP3, AFP6) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Tarmo 
  Uustalu (AFP5) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;
  &lt;LI class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; COLOR: black; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto; mso-list: l0 level1 lfo5&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;Varmo 
  Vene (AFP5) &lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/LI&gt;&lt;/UL&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt; LINE-HEIGHT: normal; mso-margin-top-alt: auto; mso-margin-bottom-alt: auto&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;&lt;BR&gt;Submit 
your proposal to &lt;/SPAN&gt;&lt;A href=&quot;&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt;&lt;FONT color=#0000ff&gt;rinus@...&lt;/FONT&gt;&lt;/SPAN&gt;&lt;/A&gt;&lt;SPAN style=&quot;FONT-SIZE: 12pt; FONT-FAMILY: 'Arial','sans-serif'; mso-fareast-font-family: 'Times New Roman'&quot;&gt; 
before &lt;SPAN style=&quot;COLOR: #ff2222&quot;&gt;December 15, 2009&lt;/SPAN&gt;.&lt;BR&gt;Notification 
January 9, 2010.&lt;o:p&gt;&lt;/o:p&gt;&lt;/SPAN&gt;&lt;/P&gt;
&lt;P class=MsoNormal style=&quot;MARGIN: 0cm 0cm 10pt&quot;&gt;&lt;o:p&gt;&lt;FONT face=Calibri size=3&gt;&amp;nbsp;&lt;/FONT&gt;&lt;/o:p&gt;&lt;/P&gt;&lt;/FONT&gt;&lt;/DIV&gt;&lt;/BODY&gt;&lt;/HTML&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26219299&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/call-for-organizing-next-AFP-summerschool-%282010%29-tp26219299p26219299.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-26060671</id>
	<title>WoLLIC 2010 - 2nd Call for Papers</title>
	<published>2009-10-26T05:30:37Z</published>
	<updated>2009-10-26T05:30:37Z</updated>
	<author>
		<name>Ruy de Queiroz</name>
	</author>
	<content type="html">&lt;span class=&quot;Apple-style-span&quot; style=&quot;font-family: Arial, Helvetica, sans-serif; font-size: medium; border-collapse: collapse; &quot;&gt;&lt;span style=&quot;font-size: large; &quot;&gt;&lt;b&gt;(please circulate; apologies for any cross-postings)&lt;/b&gt;&lt;/span&gt;&lt;div&gt;
&lt;div&gt;&lt;font class=&quot;Apple-style-span&quot; color=&quot;#500050&quot;&gt;&lt;span class=&quot;Apple-style-span&quot; style=&quot;font-size: large; &quot;&gt;&lt;b&gt;&lt;font class=&quot;Apple-style-span&quot; size=&quot;1&quot;&gt;&lt;span class=&quot;Apple-style-span&quot; style=&quot;font-size: 9px; font-weight: normal; &quot;&gt;&lt;br&gt;
&lt;/span&gt;&lt;/font&gt;&lt;/b&gt;&lt;/span&gt;&lt;/font&gt;&lt;/div&gt;&lt;div class=&quot;im&quot; style=&quot;color: rgb(80, 0, 80); &quot;&gt;&lt;div&gt;&lt;div&gt;&lt;br&gt;&lt;/div&gt;&lt;div&gt;&lt;span style=&quot;font-family: Arial, Helvetica, sans-serif; font-size: medium; &quot;&gt;&lt;b&gt;&lt;i&gt;&lt;font size=&quot;+2&quot;&gt;WoLLIC 2010 &lt;br&gt;
17&lt;sup&gt;th&lt;/sup&gt; Workshop on Logic, Language, Information and Computation &lt;/font&gt;&lt;/i&gt;&lt;/b&gt;&lt;br&gt;&lt;b&gt;&lt;font size=&quot;+2&quot;&gt;July 6&lt;sup&gt;th&lt;/sup&gt; to 9&lt;sup&gt;th&lt;/sup&gt;, 2010&lt;br&gt;&lt;/font&gt;&lt;/b&gt;&lt;p&gt;&lt;b&gt;&lt;font size=&quot;+1&quot;&gt;Universidade de Brasília,&lt;br&gt;Brasília, Brazil&lt;/font&gt;&lt;/b&gt;&lt;/p&gt;
&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Scientific Sponsorship&lt;/b&gt; &lt;br&gt;&lt;i&gt;Interest Group in Pure and Applied Logics (&lt;a href=&quot;http://www.cin.ufpe.br/~igpl/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;IGPL&lt;/a&gt;)&lt;/i&gt; &lt;br&gt;&lt;i&gt;The Association for Logic, Language and Information (&lt;a href=&quot;http://www.folli.org/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;FoLLI&lt;/a&gt;)&lt;/i&gt; &lt;br&gt;
&lt;i&gt;Association for Symbolic Logic (&lt;a href=&quot;http://www.aslonline.org/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;ASL&lt;/a&gt;)&lt;/i&gt; &lt;br&gt;&lt;i&gt;European Association for Theoretical Computer Science (&lt;a href=&quot;http://www.eatcs.org/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;EATCS&lt;/a&gt;)&lt;/i&gt; &lt;br&gt;
&lt;i&gt;Sociedade Brasileira de Computação (&lt;a href=&quot;http://www.sbc.org.br/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;SBC&lt;/a&gt;)&lt;/i&gt; &lt;br&gt;&lt;i&gt;Sociedade Brasileira de Lógica (&lt;a href=&quot;http://www.cle.unicamp.br/sbl/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;SBL&lt;/a&gt;)&lt;/i&gt;&lt;/p&gt;
&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Funding&lt;/b&gt; &lt;br&gt;(tbc) &lt;br&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;center&gt;&lt;font size=&quot;+2&quot;&gt;&lt;b&gt;Special: &lt;br&gt;A screening of &lt;a href=&quot;http://zalafilms.com/films/halmos.html&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;em&gt;I want to be a mathematician: A conversation with Paul Halmos&lt;/em&gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/center&gt;
&lt;br&gt;&lt;p&gt;&lt;b&gt;Organisation&lt;/b&gt; &lt;br&gt;&lt;i&gt;&lt;font face=&quot;Arial,Helvetica,Sans-Serif&quot;&gt;&lt;a href=&quot;http://www.mat.unb.br/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Department of Mathematics&lt;/a&gt;, &lt;a href=&quot;http://www.mat.unb.br/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Universidade de Brasília&lt;/a&gt;, Brazil &lt;br&gt;
&lt;a href=&quot;http://www.cin.ufpe.br/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Centro de Informática&lt;/a&gt;, &lt;a href=&quot;http://www.ufpe.br/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Universidade Federal de Pernambuco&lt;/a&gt;, Brazil &lt;/font&gt;&lt;/i&gt;&lt;font face=&quot;Arial,Helvetica,Sans-Serif&quot;&gt;&lt;br&gt;
&lt;/font&gt;&lt;/p&gt;&lt;font face=&quot;Arial,Helvetica,Sans-Serif&quot;&gt;&lt;p&gt;&lt;/p&gt;&lt;hr&gt;&lt;h1&gt;Call for Papers&lt;/h1&gt;&lt;a href=&quot;http://wollic.org/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;WoLLIC&lt;/a&gt; is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The Seventeenth WoLLIC will be held in Brasília, Brazil, from July 6th to 9th, 2010. It is sponsored by the&lt;a href=&quot;http://www.aslonline.org/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Association for Symbolic Logic&lt;/a&gt; (ASL), the &lt;a href=&quot;http://www.cin.ufpe.br/~igpl&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Interest Group in Pure and Applied Logics&lt;/a&gt; (IGPL), the &lt;a href=&quot;http://www.folli.org/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;The Association for Logic, Language and Information&lt;/a&gt; (FoLLI), the &lt;a href=&quot;http://www.eatcs.org/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;European Association for Theoretical Computer Science&lt;/a&gt; (EATCS), the &lt;a href=&quot;http://www.sbc.org.br/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Sociedade Brasileira de Computação&lt;/a&gt; (SBC), and the &lt;a href=&quot;http://www.cle.unicamp.br/sbl/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Sociedade Brasileira de Lógica&lt;/a&gt; (SBL).&lt;p&gt;
&lt;b&gt;Special Event&lt;/b&gt;&lt;br&gt;2010 will mark the 50-th anniversary of the first publication of Paul Halmos&amp;#39; classic book &lt;em&gt;Naïve Set Theory&lt;/em&gt; by Springer Verlag. WoLLIC will celebrate this by screening the documentary about Paul Halmos which was directed by George Csicsery: &amp;quot;I want to be a mathematician. A conversation with Paul Halmos&amp;quot;&lt;a href=&quot;http://zalafilms.com/films/halmos.html&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;http://zalafilms.com/films/halmos.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Paper submission&lt;/b&gt;&lt;br&gt;Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. They must not exceed 10 pages (in font 10 or higher), with up to 5 additional pages for references and technical appendices. The paper&amp;#39;s main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers must be submitted electronically at the WoLLIC 2010 EasyChair website. (Please go to &lt;a href=&quot;http://wollic.org/wollic2010/instructions.html&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;http://wollic.org/wollic2010/instructions.html&lt;/a&gt; for instructions.) A title and single-paragraph abstract should be submitted by February 28, and the full paper by March 7 (firm date). Notifications are expected by April 12, and final papers for the proceedings will be due by May 3 (firm date).&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Proceedings&lt;/b&gt;&lt;br&gt;The proceedings of WoLLIC 2010, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer&amp;#39;s &lt;a href=&quot;http://www.springer.com/lncs&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;LNCS&lt;/a&gt; series (TBC). In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published as a special post-conference WoLLIC 2010 issue of a scientific journal (soon to be announced).&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Invited Speakers&lt;/b&gt;&lt;br&gt;&lt;/p&gt;&lt;ul&gt;&lt;a href=&quot;http://www.ime.usp.br/~mfinger&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Marcelo Finger&lt;/b&gt;&lt;/a&gt; &lt;br&gt;&lt;a href=&quot;http://staff.science.uva.nl/~michiell/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Michiel van Lambalgen&lt;/b&gt;&lt;/a&gt; &lt;br&gt;
&lt;a href=&quot;http://www.cs.technion.ac.il/~janos/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Johann (Janos) Makowsky&lt;/b&gt;&lt;/a&gt; &lt;br&gt;&lt;b&gt;&lt;a href=&quot;http://staff.science.uva.nl/~terwijn/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Sebastiaan Terwijn&lt;/a&gt;&lt;/b&gt;&lt;/ul&gt;
&lt;p&gt;&lt;b&gt;Student Grants&lt;/b&gt;&lt;br&gt;ASL sponsorship of WoLLIC 2010 will permit ASL student members to apply for a modest travel grant (deadline: April 1, 2010). See&lt;a href=&quot;http://www.aslonline.org/studenttravelawards.html&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;http://www.aslonline.org/studenttravelawards.html&lt;/a&gt; for details.&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Important Dates&lt;/b&gt;&lt;/p&gt;&lt;li style=&quot;margin-left: 15px; &quot;&gt;February 28, 2010: Paper title and abstract deadline&lt;/li&gt;&lt;li style=&quot;margin-left: 15px; &quot;&gt;March 7, 2010: Full paper deadline (firm)&lt;/li&gt;&lt;li style=&quot;margin-left: 15px; &quot;&gt;
 April 12, 2010: Author notification&lt;/li&gt;&lt;li style=&quot;margin-left: 15px; &quot;&gt;May 3, 2010: Final version deadline (firm)&lt;p&gt;&lt;a name=&quot;1246e51b5f5c287d_1246e50e0505b732_1246e4215b96e4a1_pc&quot; style=&quot;color: rgb(42, 93, 176); &quot; target=&quot;_top&quot;&gt;&lt;b&gt;Programme Committee&lt;/b&gt;&lt;/a&gt;&lt;/p&gt;
&lt;a name=&quot;1246e51b5f5c287d_1246e50e0505b732_1246e4215b96e4a1_pc&quot; style=&quot;color: rgb(42, 93, 176); &quot; target=&quot;_top&quot;&gt;&lt;/a&gt;&lt;ul&gt;&lt;a name=&quot;1246e51b5f5c287d_1246e50e0505b732_1246e4215b96e4a1_pc&quot; style=&quot;color: rgb(42, 93, 176); &quot; target=&quot;_top&quot;&gt;&lt;/a&gt;&lt;a href=&quot;http://www-2.dc.uba.ar/profesores/becher/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Verónica Becher&lt;/b&gt;&lt;/a&gt; (Buenos Aires) &lt;br&gt;
&lt;a href=&quot;http://www.inf.unibz.it/~bernardi/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Raffaella Bernardi&lt;/b&gt;&lt;/a&gt; (Bolzano) &lt;br&gt;&lt;a href=&quot;http://www.ime.usp.br/~bianconi/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Ricardo Bianconi&lt;/b&gt;&lt;/a&gt; (São Paulo) &lt;br&gt;
&lt;a href=&quot;http://cca-net.de/vasco/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Vasco Brattka&lt;/b&gt;&lt;/a&gt; (Cape Town) &lt;br&gt;&lt;a href=&quot;http://staff.science.uva.nl/~bcate/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Balder ten Cate&lt;/b&gt;&lt;/a&gt; (ENS, Cachan) &lt;br&gt;
&lt;a href=&quot;http://www.comlab.ox.ac.uk/people/bob.coecke/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Bob Coecke&lt;/b&gt;&lt;/a&gt; (Oxford) &lt;br&gt;&lt;a href=&quot;http://www.cs.stevens.edu/~abc/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Adriana Compagnoni&lt;/b&gt;&lt;/a&gt; (Stevens) &lt;br&gt;
&lt;a href=&quot;http://www.cle.unicamp.br/prof/coniglio/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Marcelo Coniglio&lt;/b&gt;&lt;/a&gt; (Campinas) &lt;br&gt;&lt;a href=&quot;http://www.cl.cam.ac.uk/~ad260/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Anuj Dawar&lt;/b&gt;&lt;/a&gt; (Cambridge), chair &lt;br&gt;
&lt;a href=&quot;http://www2.imm.dtu.dk/~vfgo/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Valentin Goranko&lt;/b&gt;&lt;/a&gt; (Copenhagen) &lt;br&gt;&lt;a href=&quot;http://www.kurims.kyoto-u.ac.jp/~hassei/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Masahito Hasegawa&lt;/b&gt;&lt;/a&gt; (Kyoto U, Japan) &lt;br&gt;
&lt;a href=&quot;http://www.phil.uu.nl/~iemhoff/eigen.html&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Rosalie Iemhoff&lt;/b&gt;&lt;/a&gt; (Utrecht) &lt;br&gt;&lt;a href=&quot;http://research.nii.ac.jp/~kanazawa/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Makoto Kanazawa&lt;/b&gt;&lt;/a&gt; (National Institute of Informatics, Japan) &lt;br&gt;
&lt;a href=&quot;http://www.di.ens.fr/~longo/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Giuseppe Longo&lt;/b&gt;&lt;/a&gt; (CNRS &amp;amp; ENS, Paris) &lt;br&gt;&lt;a href=&quot;http://www.entcs.org/mislove.html&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Mike Mislove&lt;/b&gt;&lt;/a&gt; (Tulane) &lt;br&gt;
&lt;a href=&quot;http://nicta.com.au/people/norrishm&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Michael Norrish&lt;/b&gt;&lt;/a&gt; (NICTA, Canberra) &lt;br&gt;&lt;a href=&quot;http://www.cs.cornell.edu/selman/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Bart Selman&lt;/b&gt;&lt;/a&gt; (Cornell) &lt;br&gt;
&lt;a href=&quot;http://www.cis.upenn.edu/~weinstei/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Scott Weinstein&lt;/b&gt;&lt;/a&gt; (Penn)&lt;/ul&gt;&lt;p&gt;&lt;b&gt;Organising Committee&lt;/b&gt;&lt;/p&gt;&lt;ul&gt;&lt;a href=&quot;http://www.mat.unb.br/~ayala/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Mauricio Ayala-Rincon&lt;/a&gt; (U Brasília, Brazil) (co-chair) &lt;br&gt;
&lt;a href=&quot;http://www.cic.unb.br:9080/sitecic/departamento/docentes/flavio&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Flávio L. C. Moura&lt;/a&gt; (U Brasília, Brazil) &lt;br&gt;&lt;a href=&quot;http://www.cic.unb.br:9080/sitecic/departamento/docentes/cn&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Claudia Nalon&lt;/a&gt; (U Brasília, Brazil) &lt;br&gt;
&lt;a href=&quot;http://www.cin.ufpe.br/~ago&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Anjolina G. de Oliveira&lt;/a&gt; (U Fed Pernambuco, Brazil) &lt;br&gt;&lt;a href=&quot;http://www.cin.ufpe.br/~ruy&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;Ruy de Queiroz&lt;/a&gt; (U Fed Pernambuco, Brazil) (co-chair)&lt;/ul&gt;
&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Further information&lt;/b&gt;&lt;br&gt;Contact one of the Co-Chairs of the Organising Committee.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Web page&lt;/b&gt;&lt;br&gt;&lt;a href=&quot;http://wollic.org/wollic2010/&quot; target=&quot;_blank&quot; style=&quot;color: rgb(42, 93, 176); &quot; rel=&quot;nofollow&quot;&gt;http://wollic.org/wollic2010/&lt;/a&gt; &lt;/p&gt;
&lt;div&gt;&lt;span style=&quot;border-collapse: separate; &quot;&gt;&lt;h1&gt;&lt;span style=&quot;font-size: large; &quot;&gt;Steering committee&lt;/span&gt;&lt;/h1&gt;Samson Abramsky, Johan van Benthem, Joe Halpern, Wilfrid Hodges, Daniel Leivant, Angus Macintyre, Grigori Mints, Hiroakira Ono, Ruy de Queiroz&lt;/span&gt;&lt;/div&gt;
&lt;/li&gt;&lt;/font&gt;&lt;/span&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/span&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=26060671&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/WoLLIC-2010---2nd-Call-for-Papers-tp26060671p26060671.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25994200</id>
	<title>*** extended deadline: FLOPS 2010: Last Call for Papers ***</title>
	<published>2009-10-19T19:31:46Z</published>
	<updated>2009-10-19T19:31:46Z</updated>
	<author>
		<name>Matthias Blume-3</name>
	</author>
	<content type="html">----------------------------------------------------------------------------
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; LAST CALL FOR PAPERS
&lt;br&gt;&lt;br&gt;Tenth International Symposium on Functional and Logic Programming
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(FLOPS 2010)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; April 19-21, 2010
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Sendai, Japan
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://www.kb.ecei.tohoku.ac.jp/flops2010/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.kb.ecei.tohoku.ac.jp/flops2010/&lt;/a&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; ** EXTENDED SUBMISSION DEADLINES **
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; abstracts: October 27, 2009
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;papers: November 3, 2009
&lt;br&gt;&lt;br&gt;&lt;br&gt;FLOPS is a forum for research on all issues concerning declarative
&lt;br&gt;programming, including functional programming and logic programming,
&lt;br&gt;and aims to promote cross-fertilization and integration between the
&lt;br&gt;two paradigms. &amp;nbsp;Previous FLOPS meetings were held in Fuji Susono
&lt;br&gt;(1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo
&lt;br&gt;(2001), Aizu (2002), Nara (2004), Fuji Susono (2006), and Ise
&lt;br&gt;(2008).
&lt;br&gt;&lt;br&gt;TOPICS
&lt;br&gt;&lt;br&gt;FLOPS solicits original papers in all areas of functional and logic
&lt;br&gt;programming, including (but not limited to):
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Declarative Pearls: new and excellent declarative programs with
&lt;br&gt;&amp;nbsp; &amp;nbsp;illustrative applications.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Language issues: language design and constructs, programming
&lt;br&gt;&amp;nbsp; &amp;nbsp;methodology, integration of paradigms, interfacing with other
&lt;br&gt;&amp;nbsp; &amp;nbsp;languages, type systems, constraints, concurrency and distributed
&lt;br&gt;&amp;nbsp; &amp;nbsp;computing.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Foundations: logic and semantics, rewrite systems and narrowing,
&lt;br&gt;&amp;nbsp; &amp;nbsp;type theory, proof systems.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Implementation issues: compilation techniques, memory management,
&lt;br&gt;&amp;nbsp; &amp;nbsp;program analysis and transformation, partial evaluation,
&lt;br&gt;&amp;nbsp; &amp;nbsp;parallelism.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Applications: case studies, real-world applications, graphical
&lt;br&gt;&amp;nbsp; &amp;nbsp;user interfaces, Internet applications, XML, databases, formal
&lt;br&gt;&amp;nbsp; &amp;nbsp;methods and model checking.
&lt;br&gt;&lt;br&gt;The proceedings will be published as an LNCS volume. The proceedings
&lt;br&gt;of the previous meeting (FLOPS 2008) were published as LNCS 4989.
&lt;br&gt;&lt;br&gt;INVITED SPEAKERS
&lt;br&gt;&lt;br&gt;TBD
&lt;br&gt;&lt;br&gt;PC CO-CHAIRS
&lt;br&gt;&lt;br&gt;Matthias Blume (Google, Chicago, USA)
&lt;br&gt;German Vidal (Technical University of Valencia, Spain)
&lt;br&gt;&lt;br&gt;CONFERENCE CHAIR
&lt;br&gt;&lt;br&gt;Naoki Kobayashi (Tohoku University, Sendai, Japan)
&lt;br&gt;&lt;br&gt;PC MEMBERS
&lt;br&gt;&lt;br&gt;Nick Benton (Microsoft Research, Cambridge, UK)
&lt;br&gt;Manuel Chakravarty (University of New South Wales, Australia)
&lt;br&gt;Michael Codish (Ben-Gurion University of the Negev, Israel)
&lt;br&gt;Bart Demoen (Katholieke Universiteit Leuven, Belgium)
&lt;br&gt;Agostino Dovier (University of Udine, Italy)
&lt;br&gt;John P. Gallagher (Roskilde University, Denmark)
&lt;br&gt;Maria Garcia de la Banda (Monash University, Australia)
&lt;br&gt;Michael Hanus (University of Kiel, Germany)
&lt;br&gt;Atsushi Igarashi (Kyoto University, Japan)
&lt;br&gt;Patricia Johann (Rutgers University, USA)
&lt;br&gt;Shin-ya Katsumata (Kyoto University, Japan)
&lt;br&gt;Michael Leuschel (University of Dusseldorf, Germany)
&lt;br&gt;Francisco Lopez-Fraguas (Complutense University of Madrid, Spain)
&lt;br&gt;Paqui Lucio (University of the Basque Country, Spain)
&lt;br&gt;Yasuhiko Minamide (University of Tsukuba, Japan)
&lt;br&gt;Frank Pfenning (Carnegie Mellon University, USA)
&lt;br&gt;Francois Pottier (INRIA, France)
&lt;br&gt;Tom Schrijvers (Katholieke Universiteit Leuven, Belgium)
&lt;br&gt;Chung-chieh &amp;quot;Ken&amp;quot; Shan (Rutgers University, USA)
&lt;br&gt;Zhong Shao (Yale University, USA)
&lt;br&gt;Jan-Georg Smaus (University of Freiburg, Germany)
&lt;br&gt;Nobuko Yoshida (Imperial College London, UK)
&lt;br&gt;&lt;br&gt;LOCAL CHAIR
&lt;br&gt;&lt;br&gt;Eijiro Sumii (Tohoku University, Sendai, Japan)
&lt;br&gt;&lt;br&gt;SUBMISSION
&lt;br&gt;&lt;br&gt;Submissions must be unpublished and not submitted for publication
&lt;br&gt;elsewhere. Work that already appeared in unpublished or informally
&lt;br&gt;published workshops proceedings may be submitted. Submissions should
&lt;br&gt;fall into one of the following categories:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Regular research papers: they should describe new results and will
&lt;br&gt;&amp;nbsp; &amp;nbsp;be judged on originality, correctness, and significance.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;System descriptions: they should contain a link to a working
&lt;br&gt;&amp;nbsp; &amp;nbsp;system and will be judged on originality, usefulness, and design.
&lt;br&gt;&lt;br&gt;All submissions must be written in English and can be up to 15
&lt;br&gt;proceedings pages long. Authors are strongly encouraged to use
&lt;br&gt;LaTeX2e and the Springer llncs class file, available at
&lt;br&gt;&lt;a href=&quot;http://www.springer.de/comp/lncs/authors.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.springer.de/comp/lncs/authors.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;Regular research papers should be supported by proofs and/or
&lt;br&gt;experimental results. &amp;nbsp;In case of lack of space, this supporting
&lt;br&gt;information should be made accessible otherwise (e.g., a link to a
&lt;br&gt;web page, or an appendix). Papers should be submitted electronically
&lt;br&gt;at &lt;a href=&quot;http://www.easychair.org/conferences/?conf=flops2010&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/conferences/?conf=flops2010&lt;/a&gt;&lt;br&gt;&lt;br&gt;IMPORTANT DATES
&lt;br&gt;&lt;br&gt;Submission deadlines:
&lt;br&gt;&amp;nbsp; &amp;nbsp;- Abstract: October 27, 2009
&lt;br&gt;&amp;nbsp; &amp;nbsp;- Paper: &amp;nbsp; &amp;nbsp;November 3, 2009
&lt;br&gt;Author notification: December 21, 2009
&lt;br&gt;Camera-ready copy: January 24, 2010
&lt;br&gt;Conference: April 19-21, 2010
&lt;br&gt;&lt;br&gt;PLACE
&lt;br&gt;&lt;br&gt;Sendai, Japan
&lt;br&gt;&lt;br&gt;Some previous FLOPS:
&lt;br&gt;&lt;br&gt;FLOPS 2008, Ise: &lt;a href=&quot;http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/&lt;/a&gt;&lt;br&gt;FLOPS 2006, Fuji Susono: &lt;a href=&quot;http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/&lt;/a&gt;&lt;br&gt;FLOPS 2004, Nara
&lt;br&gt;FLOPS 2002, Aizu: &lt;a href=&quot;http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/&lt;/a&gt;&lt;br&gt;FLOPS 2001, Tokyo: &lt;a href=&quot;http://www.ueda.info.waseda.ac.jp/flops2001/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.ueda.info.waseda.ac.jp/flops2001/&lt;/a&gt;&lt;br&gt;&lt;br&gt;SPONSOR
&lt;br&gt;&lt;br&gt;&amp;nbsp; Japan Society for Software Science and Technology (JSSST), SIG-PPL
&lt;br&gt;&amp;nbsp; Graduate School of Information Sciences, Tohoku University
&lt;br&gt;&amp;nbsp; International Information Science Foundation
&lt;br&gt;&lt;br&gt;IN COOPERATION with
&lt;br&gt;&lt;br&gt;AAFS (Asian Association for Foundation of Software)
&lt;br&gt;ACM SIGPLAN
&lt;br&gt;ALP (Association for Logic Programming)
&lt;br&gt;&lt;br&gt;----------------------------------------------------------------------------
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25994200&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/***-extended-deadline%3A-FLOPS-2010%3A-Last-Call-for-Papers-***-tp25994200p25994200.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25933020</id>
	<title>World Congress, Lisbon 2010 - Call for Papers</title>
	<published>2009-10-16T04:19:21Z</published>
	<updated>2009-10-16T04:19:21Z</updated>
	<author>
		<name>Universal Logic</name>
	</author>
	<content type="html">The third edition of the World Congress and School on Universal Logic will
&lt;br&gt;happen April 18-25, 2010 in Lisbon, Portugal.
&lt;br&gt;&lt;br&gt;There will be:
&lt;br&gt;10 invited speakers, among them: Hartry Field, &amp;nbsp;George Grätzer, Yuri
&lt;br&gt;Gurevich, Gehrard Jaeger, Dana Scott
&lt;br&gt;&lt;br&gt;10 special sessions, among them: logic diagrams, substructural logics,
&lt;br&gt;non-classical mathematics, categorical logic, mutlimodal logics, paradoxes
&lt;br&gt;&lt;br&gt;21 tutorials, among them: Hybrid logic, Logical Pluralism, Erotetic
&lt;br&gt;Logics, Truth-values, Refutation, Ideospheres, How to cut and paste
&lt;br&gt;logical systems
&lt;br&gt;&lt;br&gt;1 contest: How to combine logics?
&lt;br&gt;&lt;br&gt;Submission deadline for contributed talks has been extended to November
&lt;br&gt;15, 2009
&lt;br&gt;&lt;br&gt;UNILOG'2010
&lt;br&gt;World Congress and School on Universal Logic III
&lt;br&gt;April 18-25, 2010, Lisbon, Portugal
&lt;br&gt;&lt;a href=&quot;http://www.uni-log.org&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.uni-log.org&lt;/a&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25933020&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/World-Congress%2C-Lisbon-2010---Call-for-Papers-tp25933020p25933020.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25933004</id>
	<title>FIVE YEARS OF LOGICAL METHODS IN COMPUTER SCIENCE</title>
	<published>2009-10-15T16:29:52Z</published>
	<updated>2009-10-15T16:29:52Z</updated>
	<author>
		<name>MYV</name>
	</author>
	<content type="html">&lt;br&gt;Dear Colleague:
&lt;br&gt;&lt;br&gt;We would like to bring the community up to date on the journal
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp;Logical Methods in Computer Science
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp;www.lmcs-online.org
&lt;br&gt;&lt;br&gt;We started this fully refereed, open access, free electronic journal in 
&lt;br&gt;January 2005, intending to create a high-level platform for publications 
&lt;br&gt;in all theoretical and practical areas in computer science involving 
&lt;br&gt;logical methods, taken in a broad sense. We are now on Issue 3 of Volume 5 
&lt;br&gt;(there are four issues a year). So far, we have received more than 350 
&lt;br&gt;submissions of which we have published 162. In addition to individual 
&lt;br&gt;submissions, our journal publishes special issues, e.g., of selected 
&lt;br&gt;papers of high-level international conferences such as LICS, IJCAR, CAV, 
&lt;br&gt;CSL, and RTA.
&lt;br&gt;&lt;br&gt;We are continuing actively to develop the journal. For example, we accept 
&lt;br&gt;survey articles, and are developing `live' surveys, which can be 
&lt;br&gt;continually updated as knowledge progresses. In another direction, we are 
&lt;br&gt;considering allowing authors to provide additional material of an 
&lt;br&gt;expository nature, such as slides and videos, to enable them to interest a 
&lt;br&gt;wider spectrum of readers in their contribution.
&lt;br&gt;&lt;br&gt;The journal is an overlay of CoRR, the computer science repository of 
&lt;br&gt;arXiv. There are no fees for authors nor for readers. Every paper is 
&lt;br&gt;refereed by two or more referees, and high standards are applied. The 
&lt;br&gt;editorial board consists of about sixty top specialists in all areas of 
&lt;br&gt;logic in computer science.
&lt;br&gt;&lt;br&gt;The journal is covered by Mathematical Reviews, the ISI Web of Knowledge, 
&lt;br&gt;and the DBLP Database.
&lt;br&gt;&lt;br&gt;We welcome your comments and suggestions, and we seek your contributions! 
&lt;br&gt;For more information please consult our web pages:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;www.lmcs-online.org
&lt;br&gt;&lt;br&gt;Yours,
&lt;br&gt;&lt;br&gt;Editor-in-Chief: &amp;nbsp; Dana S. Scott &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25933004&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;dana.scott@...&lt;/a&gt;&amp;gt;
&lt;br&gt;Managing Editors: &amp;nbsp;Benjamin C. Pierce &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25933004&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;bcpierce@...&lt;/a&gt;&amp;gt;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Gordon D. Plotkin &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25933004&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;gdp@...&lt;/a&gt;&amp;gt;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Moshe Y. Vardi &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25933004&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;vardi@...&lt;/a&gt;&amp;gt;
&lt;br&gt;Executive Editors: Jiri Adamek &amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25933004&amp;i=4&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;adamek@...&lt;/a&gt;&amp;gt;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Stefan Milius &amp;nbsp;&amp;lt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25933004&amp;i=5&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;s.milius@...&lt;/a&gt;&amp;gt;
&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25933004&amp;i=6&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/FIVE-YEARS-OF-LOGICAL-METHODS-IN-COMPUTER-SCIENCE-tp25933004p25933004.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25890892</id>
	<title>KSEM Conference Program Announced</title>
	<published>2009-10-13T11:37:10Z</published>
	<updated>2009-10-13T11:37:10Z</updated>
	<author>
		<name>PAKM Verteiler</name>
	</author>
	<content type="html">(Mailing list information, including unsubscription instructions, is located at the end of this message.)
&lt;br&gt;__ 
&lt;br&gt;&lt;br&gt;Dear Ladies and Gentlemen, 
&lt;br&gt;&lt;br&gt;We would like to inform you that the conference program for the KSEM2009 - 3rd International Conference on Knowledge Science, Engineering and Management has been published. For details please see ksem2009.dke.univie.ac.at/ksem_programm.html. 
&lt;br&gt;&lt;br&gt;We are honoured to announce the participation of Prof. John Mylopoulos, University of Trento, and Prof. Fangzhen Lin, Hong Kong University of Science and Technology as invited speakers to the KSEM2009. &amp;nbsp;Prof. Mylopoulos will talk about Models in Knowledge Management, while Prof. Lin will speak about Two Applications of Computer-Aided Theorem Discovery and Verification.
&lt;br&gt;&lt;br&gt;Furthermore we would like to announce two panel discussions to be held during the conference: one on the topic of Required Knowledge for Delivering Services and one on  Knowware: The Third Star after Hardware and Software.
&lt;br&gt;&lt;br&gt;We look forward to welcoming you in Vienna for the KSEM2009. 
&lt;br&gt;&lt;br&gt;Sincerely yours, 
&lt;br&gt;Zhi Jin and Dimitris Karagiannis 
&lt;br&gt;&lt;br&gt;-- 
&lt;br&gt;The following information is a reminder of your current mailing
&lt;br&gt;list subscription: 
&lt;br&gt;&lt;br&gt;You are subscribed to the following list:
&lt;br&gt;&amp;nbsp; 
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; PAKM Verteiler
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;using the following email:
&lt;br&gt;&amp;nbsp;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25890892&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;You may automatically unsubscribe from this list at any time by 
&lt;br&gt;visiting the following URL:
&lt;br&gt;&amp;nbsp;
&lt;br&gt;&amp;lt;&lt;a href=&quot;http://tools.dke.univie.ac.at/verteiler/mail.cgi/u/pakm01/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://tools.dke.univie.ac.at/verteiler/mail.cgi/u/pakm01/&lt;/a&gt;&amp;gt;
&lt;br&gt;&lt;br&gt;If the above URL is inoperable, make sure that you have copied the 
&lt;br&gt;entire address. Some mail readers will wrap a long URL and thus break
&lt;br&gt;this automatic unsubscribe mechanism. 
&lt;br&gt;&lt;br&gt;You may also change your subscription by visiting this list's main screen: 
&lt;br&gt;&amp;nbsp;
&lt;br&gt;&amp;lt;&lt;a href=&quot;http://tools.dke.univie.ac.at/verteiler/mail.cgi/list/pakm01&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://tools.dke.univie.ac.at/verteiler/mail.cgi/list/pakm01&lt;/a&gt;&amp;gt;
&lt;br&gt;&lt;br&gt;If you're still having trouble, please contact the list owner at: 
&lt;br&gt;&amp;nbsp;
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;lt;mailto:&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25890892&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;pakm@...&lt;/a&gt;&amp;gt;
&lt;br&gt;&lt;br&gt;The following physical address is associated with this mailing list: 
&lt;br&gt;&amp;nbsp;
&lt;br&gt;Vienna, Austria
&lt;br&gt;&lt;br&gt;Mailing List Powered by Dada Mail
&lt;br&gt;&lt;a href=&quot;http://tools.dke.univie.ac.at/verteiler/mail.cgi/what_is_dada_mail/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://tools.dke.univie.ac.at/verteiler/mail.cgi/what_is_dada_mail/&lt;/a&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25890892&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/KSEM-Conference-Program-Announced-tp25890892p25890892.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25890864</id>
	<title>Call for Participation: VSTTE 2009</title>
	<published>2009-10-13T08:03:43Z</published>
	<updated>2009-10-13T08:03:43Z</updated>
	<author>
		<name>Jean-Christophe Filliâtre-3</name>
	</author>
	<content type="html">*********************************************************
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; VSTTE &amp;nbsp;2009 &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Workshop on Verified Software &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Theory Tools &amp;nbsp;and Experiments &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(affiliated with Formal Methods Week) &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *** Call For Participation *** &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; November 2, 2009 &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Eindhoven, the Netherlands &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://vstte09.lri.fr/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://vstte09.lri.fr/&lt;/a&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;*********************************************************
&lt;br&gt;&lt;br&gt;The workshop on Verified Software: Theories, Tools, &amp;nbsp; and
&lt;br&gt;Experiments (VSTTE 2009) will take place on &amp;nbsp;November the
&lt;br&gt;2nd. &amp;nbsp; The focus &amp;nbsp;of this workshop &amp;nbsp;will be on tools, &amp;nbsp;as
&lt;br&gt;previous &amp;nbsp; VSTTE &amp;nbsp; conferences &amp;nbsp;in &amp;nbsp;Zurich &amp;nbsp; and &amp;nbsp;Toronto
&lt;br&gt;emphasised &amp;nbsp;theories &amp;nbsp;and &amp;nbsp;experiments. &amp;nbsp; &amp;nbsp;Consisting &amp;nbsp;of
&lt;br&gt;contributed papers &amp;nbsp;and invited talks, &amp;nbsp;the workshop will
&lt;br&gt;focus on the tools &amp;nbsp;behind the development &amp;nbsp;of systematic
&lt;br&gt;methods &amp;nbsp; for &amp;nbsp; specifying, &amp;nbsp; building, &amp;nbsp; &amp;nbsp; and verifying
&lt;br&gt;high-quality software.
&lt;br&gt;&lt;br&gt;Program
&lt;br&gt;=======
&lt;br&gt;&lt;br&gt;09:00-10:00 - Rajeev Joshi, NASA JPL US
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; TBA
&lt;br&gt;&lt;br&gt;10:30-11:30 - Discovering Specifications for Unknown Procedures with
&lt;br&gt;Separation Logic
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Chenguang Luo, Florin Craciun, Shengchao Qin, Guanhua He
&lt;br&gt;and Wei-Ngan Chin.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; On Essential Program Annotations and Completeness of
&lt;br&gt;Verifying Compilers
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Bernhard Beckert, Thorsten Bormer and Vladimir Klebanov.
&lt;br&gt;&lt;br&gt;11:30-12:30 - Jim Woodcock, University of York UK
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; TBA
&lt;br&gt;&lt;br&gt;13:30-14:30 - Pascal Cuoq, CEA France
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; TBA
&lt;br&gt;&lt;br&gt;14:30-15:30 - SMT Solvers: New Oracles for the HOL Theorem Prover
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Tjark Weber.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; An Interval-based SAT Modulo ODE Solver for Model Checking
&lt;br&gt;Nonlinear Hybrid Systems
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Daisuke Ishii, Kazunori Ueda and Hiroshi Hosobe.
&lt;br&gt;&lt;br&gt;16:00-17:00 - John McDermott, Naval Research Lab US
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; TBA
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Kalou Cabrera Castillos, INRIA Nancy France
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; TBA
&lt;br&gt;&lt;br&gt;&lt;br&gt;Registration
&lt;br&gt;============
&lt;br&gt;&lt;br&gt;Participants can register for any combination of FM2009
&lt;br&gt;activities, inclusing VSTTE 2009, at
&lt;br&gt;&lt;a href=&quot;http://www.win.tue.nl/fmweek/Registration.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.win.tue.nl/fmweek/Registration.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;Deadline for (normal) registration is October 19.
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25890864&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Call-for-Participation%3A-VSTTE-2009-tp25890864p25890864.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25890874</id>
	<title>CAV  2010 Call for Papers</title>
	<published>2009-10-13T07:19:25Z</published>
	<updated>2009-10-13T07:19:25Z</updated>
	<author>
		<name>Tayssir Touili</name>
	</author>
	<content type="html">We apologize if you receive multiple copies of this email.
&lt;br&gt;See below on how to unsubscribe.
&lt;br&gt;&lt;br&gt;........................................................................
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 22nd International Conference on
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Computer Aided Verification (CAV)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; CAV 2010
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://www.floc-conference.org/CAV.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.floc-conference.org/CAV.html&lt;/a&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; July 15 - 19, 2010
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Edinburgh, United Kingdom
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Call for Papers
&lt;br&gt;........................................................................
&lt;br&gt;&lt;br&gt;Aims and Scope
&lt;br&gt;---------------
&lt;br&gt;CAV 2010 is the 22nd in a series dedicated to the advancement of the
&lt;br&gt;theory and practice of computer-aided formal analysis methods for
&lt;br&gt;hardware and software systems. This year, CAV is part of the 5th
&lt;br&gt;International Federated Logic Conference (FLoC 2010), which includes
&lt;br&gt;CAV and seven other conferences/symposia: CSF, ICLP, IJCAR, ITP, LICS,
&lt;br&gt;RTA and SAT. More details about FLoC 2010 can be found at
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://www.floc-conference.org/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.floc-conference.org/&lt;/a&gt;&lt;br&gt;&lt;br&gt;CAV considers it vital to continue its leadership in hardware
&lt;br&gt;verification, maintain its recent momentum in software verification, and
&lt;br&gt;consider new domains such as biological systems. The conference covers
&lt;br&gt;the spectrum from theoretical results to concrete applications, with an
&lt;br&gt;emphasis on practical verification tools and the algorithms and
&lt;br&gt;techniques that are needed for their implementation. The proceedings of
&lt;br&gt;the conference will be published in the Springer-Verlag Lecture Notes in
&lt;br&gt;Computer Science series. A selection of papers will be invited to a
&lt;br&gt;special issue of the International Journal on Formal Methods in System
&lt;br&gt;Design.
&lt;br&gt;&lt;br&gt;Topics of interest include:
&lt;br&gt;&amp;nbsp; * Model checking techniques
&lt;br&gt;&amp;nbsp; * Algorithms and tools for verifying models and implementations
&lt;br&gt;&amp;nbsp; * Hardware verification techniques
&lt;br&gt;&amp;nbsp; * Hybrid systems and embedded systems verification
&lt;br&gt;&amp;nbsp; * Program analysis and software verification
&lt;br&gt;&amp;nbsp; * Modeling and specification formalisms
&lt;br&gt;&amp;nbsp; * Deductive, compositional, and abstraction techniques for verification
&lt;br&gt;&amp;nbsp; * Testing and runtime analysis based on verification technology
&lt;br&gt;&amp;nbsp; * Applications and case studies
&lt;br&gt;&amp;nbsp; * Verification in industrial practice
&lt;br&gt;&amp;nbsp; * Formal methods for biological systems
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;Events
&lt;br&gt;-------
&lt;br&gt;There will be pre-conference workshops on July 14 and July 15, and
&lt;br&gt;post-conference workshops on July 20. Please see the conference website
&lt;br&gt;for more details.
&lt;br&gt;&lt;br&gt;&lt;br&gt;There will be tutorials on July 15 (first day of the conference).
&lt;br&gt;&lt;br&gt;Invited tutorial speakers
&lt;br&gt;-------------------------
&lt;br&gt;&lt;br&gt;* Robert Brayton: University of California, Berkeley, US
&lt;br&gt;* Kenneth Mcmillan: Cadence Berkeley Labs, US
&lt;br&gt;* Thomas Reps: University of Wisconsin-Madison, US
&lt;br&gt;* Andrey Rybalchenko: Max Planck Institute, Germany
&lt;br&gt;&lt;br&gt;&lt;br&gt;Invited speakers
&lt;br&gt;----------------
&lt;br&gt;&lt;br&gt;* Somesh Jha: University of Wisconsin-Madison, US
&lt;br&gt;* Pasquale Malacaria: Queen Mary University, United Kingdom
&lt;br&gt;* Maged &amp;nbsp;Michael: IBM, US
&lt;br&gt;&lt;br&gt;&lt;br&gt;CAV Award
&lt;br&gt;---------
&lt;br&gt;&lt;br&gt;An annual award, called the CAV Award, has been established
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;quot;For a specific fundamental contribution
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;or a series of outstanding contributions
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;to the field of Computer-Aided Verification.&amp;quot;
&lt;br&gt;&lt;br&gt;The cited contribution(s) must have been made not more recently than
&lt;br&gt;five years ago and not over twenty years ago. &amp;nbsp;In addition, the
&lt;br&gt;contribution(s) should not yet have received recognition via a major
&lt;br&gt;award, such as the ACM Turing or Kanellakis Awards. (The nominee may
&lt;br&gt;have received such an award for other contributions.)
&lt;br&gt;&lt;br&gt;The award of $10,000 will be granted to an individual or a group of
&lt;br&gt;individuals chosen by the Award Committee from a list of nominations.
&lt;br&gt;The Award Committee may choose to make no award in a given year.
&lt;br&gt;&lt;br&gt;The CAV Award will be presented in an award ceremony at the
&lt;br&gt;Computer-Aided Verification Conference and a citation will be published
&lt;br&gt;in a journal of record (currently, Formal Methods in System Design).
&lt;br&gt;&lt;br&gt;Anyone, with the exception of members of the Award Committee, is
&lt;br&gt;eligible to receive the Award.
&lt;br&gt;&lt;br&gt;Nominations are welcome. Please see the Call for Nominations for the CAV
&lt;br&gt;Award on the conference website.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Paper Submission
&lt;br&gt;----------------
&lt;br&gt;&lt;br&gt;There are two categories of submissions:
&lt;br&gt;&lt;br&gt;* A. Regular papers. Submissions, not exceeding fourteen (14) pages
&lt;br&gt;using Springer's LNCS format, should contain original research, and
&lt;br&gt;sufficient detail to assess the merits and relevance of the
&lt;br&gt;contribution. For papers reporting experimental results, authors are
&lt;br&gt;strongly encouraged to make their data available with their submission.
&lt;br&gt;Submissions reporting on case studies in an industrial context are
&lt;br&gt;strongly invited, and should describe details, weaknesses and strength
&lt;br&gt;in sufficient depth. Simultaneous submission to other conferences with
&lt;br&gt;proceedings or submission of material that has already been published
&lt;br&gt;elsewhere is not allowed.
&lt;br&gt;&lt;br&gt;* B. Tool presentations. Submissions, not exceeding four (4) pages using
&lt;br&gt;Springer's LNCS format, should describe the implemented tool and its
&lt;br&gt;novel features. A demonstration is expected to accompany a tool
&lt;br&gt;presentation. Papers describing tools that have already been presented
&lt;br&gt;in this conference before will be accepted only if significant and clear
&lt;br&gt;enhancements to the tool are reported and implemented.
&lt;br&gt;&lt;br&gt;Papers can be submitted in PDF or PS format. Submission is done with
&lt;br&gt;EasyChair, and the submission site will open on Jan 4, 2010. Please
&lt;br&gt;follow guidelines on the conference website:
&lt;br&gt;&lt;a href=&quot;http://www.floc-conference.org/CAV.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.floc-conference.org/CAV.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;Papers exceeding the stated maximum length run the risk of rejection
&lt;br&gt;without review. The review process will include a feedback/rebuttal
&lt;br&gt;period where authors will have the option to respond to reviewer
&lt;br&gt;comments.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Important Dates
&lt;br&gt;----------------
&lt;br&gt;&lt;br&gt;&amp;nbsp; * Abstract submission: January 11, 2010
&lt;br&gt;&amp;nbsp; * Paper submission (firm): January 15, 2010
&lt;br&gt;&amp;nbsp; * Author feedback/rebuttal period: February 26 - March 1, 2010
&lt;br&gt;&amp;nbsp; * Notification of acceptance/rejection: March 15, 2010
&lt;br&gt;&amp;nbsp; * Final version due: April 16, 2010
&lt;br&gt;&lt;br&gt;&lt;br&gt;Program Chairs
&lt;br&gt;---------------
&lt;br&gt;&lt;br&gt;&amp;nbsp; * Byron Cook: Microsoft Research, United Kingdom
&lt;br&gt;&amp;nbsp; * Paul Jackson: University of Edinburgh, United Kingdom
&lt;br&gt;&amp;nbsp; * Tayssir Touili: LIAFA-CNRS, France
&lt;br&gt;&lt;br&gt;&lt;br&gt;Program Committee
&lt;br&gt;------------------
&lt;br&gt;&lt;br&gt;Rajeev Alur: University of Pennsylvania, US
&lt;br&gt;Domagoj Babic: Synopsys, US
&lt;br&gt;Christel Baier: Technical University of Dresden, Germany
&lt;br&gt;Roderick Bloem:	Graz University of Technology, Austria
&lt;br&gt;Ahmed Bouajjani: &amp;nbsp;LIAFA-University of Paris 7, France
&lt;br&gt;Alessandro Cimatti: &amp;nbsp;FBK-irst, Italy
&lt;br&gt;Byron Cook: Microsoft Research, United Kingdom
&lt;br&gt;Javier Esparza: Munich University, Germany	
&lt;br&gt;Azadeh Farzan: University of Toronto, Canada
&lt;br&gt;Martin Fränzle: University of &amp;nbsp;Oldenburg, Germany
&lt;br&gt;Ganesh Gopalakrishnan: University of Utah, US
&lt;br&gt;Mike Gordon: University of Cambridge, United Kingdom
&lt;br&gt;Orna Grumberg: Technion, Israel
&lt;br&gt;Ziyad Hanna: &amp;nbsp;Jasper, US	
&lt;br&gt;Holger Hermanns: Saarland University, Germany
&lt;br&gt;Alan Hu: University of British Columbia, Canada
&lt;br&gt;Paul Jackson: University of Edinburgh, United Kingdom
&lt;br&gt;Kevin Jones: Green Plug, US
&lt;br&gt;Vineet Kahlon: NEC Labs, US
&lt;br&gt;Jean Krivine: Institut des Hautes Etudes Scientifiques, France
&lt;br&gt;Daniel Kroening: Oxford University, United Kingdom
&lt;br&gt;Sava Krstic: Intel Corporation, US
&lt;br&gt;Marta Kwiatkowska: Oxford University, United Kingdom
&lt;br&gt;Kenneth McMillan: Cadence, US
&lt;br&gt;David Monniaux: VERIMAG-CNRS, France
&lt;br&gt;Markus Müller-Olm: Muenster University, Germany	
&lt;br&gt;Kedar Namjoshi: Bell Labs, US
&lt;br&gt;Doron Peled: Bar Ilan University, Israel
&lt;br&gt;Amir Pnueli: New York University, US
&lt;br&gt;Shaz Qadeer: Microsoft Research, US
&lt;br&gt;Jean-Francois Raskin: Brussels University, Belgium
&lt;br&gt;Natasha Sharygina: University of Lugano, Switzerland
&lt;br&gt;Tayssir Touili: &amp;nbsp;LIAFA-CNRS, France
&lt;br&gt;Helmut Veith: University of Darmstadt, Germany
&lt;br&gt;Kwangkeun Yi: Seoul National University, Korea
&lt;br&gt;Karen Yorav: IBM Haifa, Israel
&lt;br&gt;Greta Yorsh: IBM, US
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;Steering Committee
&lt;br&gt;-------------------
&lt;br&gt;&lt;br&gt;&amp;nbsp; * Edmund M. Clarke: Carnegie Mellon University, US
&lt;br&gt;&amp;nbsp; * Mike Gordon: University of Cambridge, United Kingdom
&lt;br&gt;&amp;nbsp; * Robert P. Kurshan: Cadence, US
&lt;br&gt;&amp;nbsp; * Amir Pnueli, New York University, US
&lt;br&gt;&lt;br&gt;&lt;br&gt;----------------------------------------------------------
&lt;br&gt;We apologize if you receive multiple copies of this email.
&lt;br&gt;If you do not want any further announcements regarding CAV 2010, reply
&lt;br&gt;to this email and put 'UNSUBSCRIBE' in the body or subject of your
&lt;br&gt;reply.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25890874&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/CAV--2010-Call-for-Papers-tp25890874p25890874.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25890845</id>
	<title>CFP: International Symposium on Memory Management 2010</title>
	<published>2009-10-12T13:07:32Z</published>
	<updated>2009-10-12T13:07:32Z</updated>
	<author>
		<name>Kevin Hoffman-2</name>
	</author>
	<content type="html">International Symposium on Memory Management 2010
&lt;br&gt;Toronto, June 5-6, 2010
&lt;br&gt;&lt;a href=&quot;http://www.cs.purdue.edu/ISMM10/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.cs.purdue.edu/ISMM10/&lt;/a&gt;&lt;br&gt;&lt;br&gt;CALL FOR PAPERS
&lt;br&gt;&lt;br&gt;ISMM is a forum for research in memory management. Areas of interest include
&lt;br&gt;but are not limited to:
&lt;br&gt;&lt;br&gt;* Memory allocation and deallocation
&lt;br&gt;* Garbage collection algorithms and implementations
&lt;br&gt;* Compiler analyses and tools to aid memory management
&lt;br&gt;* Empirical analysis of heap intensive programs
&lt;br&gt;* Formal analysis and verification of heap intensive programs
&lt;br&gt;* Memory system design and analysis
&lt;br&gt;* Verification of memory management algorithms
&lt;br&gt;* Development and evaluation of open source implementations
&lt;br&gt;&lt;br&gt;ISMM solicits full-length submissions covering new work on these topics, as
&lt;br&gt;well as papers presenting confirmations or refutations of important prior
&lt;br&gt;results. Surveys and comparative analyses that shed new light on previously
&lt;br&gt;published techniques are also welcome. 
&lt;br&gt;&lt;br&gt;ORGANIZERS
&lt;br&gt;&lt;br&gt;General Chair: Jan Vitek, Purdue University
&lt;br&gt;Program Chair: Doug Lea, State University of New York at Oswego
&lt;br&gt;&lt;br&gt;Program Committee:
&lt;br&gt;* Hans Boehm, HP Labs
&lt;br&gt;* Cliff Click, Azul Systems
&lt;br&gt;* David Detlefs, Microsoft Research
&lt;br&gt;* Dave Dice, Sun Microsystems
&lt;br&gt;* Christine Flood, Sun Microsystems
&lt;br&gt;* Daniel Frampton, Australian National University
&lt;br&gt;* Samir Genaim, Complutense University of Madrid
&lt;br&gt;* Richard Jones, University of Kent
&lt;br&gt;* Simon Marlow, Microsoft Research
&lt;br&gt;* Nick Mitchell, IBM T.J. Watson Research
&lt;br&gt;* Filip Pizlo, Purdue University
&lt;br&gt;* Martin Vechev, IBM T.J. Watson Research
&lt;br&gt;* Adam Welc, Intel
&lt;br&gt;&lt;br&gt;KEY DATES
&lt;br&gt;&lt;br&gt;Abstracts due: February 3, 2010
&lt;br&gt;Submissions due: February 9, 2010
&lt;br&gt;Author response: March 9-11, 2010
&lt;br&gt;Notification: March 19, 2010
&lt;br&gt;Final copy: April 2, 2010
&lt;br&gt;Conference: June 5-6, 2010
&lt;br&gt;&lt;br&gt;SUBMISSIONS
&lt;br&gt;&lt;br&gt;Submitted papers must be in English and formatted to print on US Letter (8.5 x
&lt;br&gt;11 inches) paper. Submissions must contain an abstract and postal and electronic
&lt;br&gt;mailing addresses for at least one contact author. All papers must be submitted
&lt;br&gt;on-line, preferably in Portable Document Format (PDF), although the submission
&lt;br&gt;system will also accept PostScript. Submissions should be no more than 10 pages
&lt;br&gt;(including bibliography, excluding well marked appendices) in standard ACM
&lt;br&gt;SIGPLAN conference format: two columns, nine-point font (or larger) on a
&lt;br&gt;ten-point baseline (or larger), with columns 20pc (3.33in) wide and 54pc (9in)
&lt;br&gt;tall, and a column gutter of 2pc (0.33in). Detailed formatting guidelines along
&lt;br&gt;with formatting templates or style files for LaTeX are available at
&lt;br&gt;&lt;a href=&quot;http://www.acm.org/sigs/sigplan/authorInformation.htm&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.acm.org/sigs/sigplan/authorInformation.htm&lt;/a&gt;. Papers that violate these
&lt;br&gt;guidelines will be rejected by the program chair. Program committee members are
&lt;br&gt;not required to read appendices, and so a paper should be intelligible without
&lt;br&gt;them. All accepted papers will appear in the published proceedings.
&lt;br&gt;&lt;br&gt;Double-blind reviewing
&lt;br&gt;&lt;br&gt;Authors are anonymous to the reviewers, just as reviewers are anonymous to the
&lt;br&gt;authors. Authors must take reasonable efforts not to disclose their identities
&lt;br&gt;to reviewers: Do not give your names nor mention your institution, research
&lt;br&gt;group or project name. Where necessary for flow, a stand-in name such as &amp;quot;XYZ&amp;quot;,
&lt;br&gt;may be used, with a footnote explaining that the actual name is withheld.
&lt;br&gt;Discuss your own prior work in the third person, as you would other related
&lt;br&gt;work. You may also provide reviewers with anonymous auxiliary material such as
&lt;br&gt;proofs and source code via the PC Chair (see below). Reviewers, for their part,
&lt;br&gt;will be honor-bound not to try to discover authors' identities until their
&lt;br&gt;initial reviews are complete. Authors' identities will be revealed at a later
&lt;br&gt;point in the program committee's deliberations, but will be known only to the
&lt;br&gt;program chair until that point.
&lt;br&gt;&lt;br&gt;Review committee
&lt;br&gt;&lt;br&gt;ISMM uses a separate Review Committee (RC) as part of the reviewing process. The
&lt;br&gt;RC complements the Program Committee (PC) by providing expert reviews. The same
&lt;br&gt;reviewing standards apply to the RC as for the PC. However, RC members review
&lt;br&gt;only a few papers each, and do not participate in the PC meeting. The use of the
&lt;br&gt;RC increases the breadth and depth of the reviewer pool.
&lt;br&gt;&lt;br&gt;Rebuttal
&lt;br&gt;&lt;br&gt;The rebuttal process will occur in early March 2010, and will give the authors
&lt;br&gt;opportunity to respond succinctly to factual errors in reviews, before the
&lt;br&gt;program committee meets to make its decisions. The committee may, but need not,
&lt;br&gt;respond to rebuttals or revise reviews at or after the committee meeting.
&lt;br&gt;&lt;br&gt;Auxiliary Material
&lt;br&gt;&lt;br&gt;Authors may provide the PC Chair with a URL for upload of auxiliary material.
&lt;br&gt;The URL itself will not be seen by reviewers. The authors may reference such
&lt;br&gt;material in their paper, noting that the material has been made available to the
&lt;br&gt;PC Chair. This facility may be used by authors to provide reviewers with useful
&lt;br&gt;information beyond the scope of the submitted paper, such as technical reports,
&lt;br&gt;proofs, and source code, without disclosing the authors' identity. Authors are
&lt;br&gt;obliged to make reasonable efforts to make all auxiliary material suitably
&lt;br&gt;anonymous. Authors are reminded that reviewers are under no obligation to read
&lt;br&gt;any auxiliary material.
&lt;br&gt;Papers accompanied by or based on open-source implementations are especially
&lt;br&gt;welcome. However, if the authors are primary contributors to such a project,
&lt;br&gt;they should provide source URLs separately to the Program Chair for validation,
&lt;br&gt;and not list them in the submission proper.
&lt;br&gt;&lt;br&gt;Proceedings
&lt;br&gt;&lt;br&gt;The proceedings will be published by the ACM. Authors should read the ACM Author
&lt;br&gt;Guidelines and related information. Authors of accepted papers must guarantee
&lt;br&gt;that their paper will be presented at the conference. For additional information
&lt;br&gt;please feel free to contact the Program Chair.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25890845&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/CFP%3A-International-Symposium-on-Memory-Management-2010-tp25890845p25890845.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25826230</id>
	<title>LATA 2010: 2nd call for papers</title>
	<published>2009-10-09T07:15:10Z</published>
	<updated>2009-10-09T07:15:10Z</updated>
	<author>
		<name>carlos.martin</name>
	</author>
	<content type="html">*********************************************************************
&lt;br&gt;&lt;br&gt;2nd Call for Papers
&lt;br&gt;&lt;br&gt;4th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2010)
&lt;br&gt;&lt;br&gt;Trier, Germany, May 24-28, 2010
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://grammars.grlmc.com/LATA2010/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://grammars.grlmc.com/LATA2010/&lt;/a&gt;&lt;br&gt;&lt;br&gt;*********************************************************************
&lt;br&gt;&lt;br&gt;AIMS:
&lt;br&gt;&lt;br&gt;LATA is a yearly conference in theoretical computer science and its applications. As linked to the International PhD School in Formal Languages and Applications that was developed at Rovira i Virgili University (the host of the previous three editions and co-organizer of this one) in the period 2002-2006, LATA 2010 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.).
&lt;br&gt;&lt;br&gt;SCOPE:
&lt;br&gt;&lt;br&gt;Topics of either theoretical or applied interest include, but are not limited to:
&lt;br&gt;&lt;br&gt;- algebraic language theory
&lt;br&gt;- algorithms on automata and words
&lt;br&gt;- automata and logic
&lt;br&gt;- automata for system analysis and programme verification
&lt;br&gt;- automata, concurrency and Petri nets
&lt;br&gt;- cellular automata
&lt;br&gt;- combinatorics on words
&lt;br&gt;- computability
&lt;br&gt;- computational complexity
&lt;br&gt;- computer linguistics
&lt;br&gt;- data and image compression
&lt;br&gt;- decidability questions on words and languages
&lt;br&gt;- descriptional complexity
&lt;br&gt;- DNA and other models of bio-inspired computing
&lt;br&gt;- document engineering
&lt;br&gt;- foundations of finite state technology
&lt;br&gt;- fuzzy and rough languages
&lt;br&gt;- grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.)
&lt;br&gt;- grammars and automata architectures
&lt;br&gt;- grammatical inference and algorithmic learning
&lt;br&gt;- graphs and graph transformation
&lt;br&gt;- language varieties and semigroups
&lt;br&gt;- language-based cryptography
&lt;br&gt;- language-theoretic foundations of artificial intelligence and artificial life
&lt;br&gt;- neural networks
&lt;br&gt;- parallel and regulated rewriting
&lt;br&gt;- parsing
&lt;br&gt;- pattern matching and pattern recognition
&lt;br&gt;- patterns and codes
&lt;br&gt;- power series
&lt;br&gt;- quantum, chemical and optical computing
&lt;br&gt;- semantics
&lt;br&gt;- string and combinatorial issues in computational biology and bioinformatics
&lt;br&gt;- symbolic dynamics
&lt;br&gt;- term rewriting
&lt;br&gt;- text algorithms
&lt;br&gt;- text retrieval
&lt;br&gt;- transducers
&lt;br&gt;- trees, tree languages and tree machines
&lt;br&gt;- weighted machines
&lt;br&gt;&lt;br&gt;STRUCTURE:
&lt;br&gt;&lt;br&gt;LATA 2010 will consist of:
&lt;br&gt;&lt;br&gt;- 3 invited talks
&lt;br&gt;- 2 invited tutorials
&lt;br&gt;- refereed contributions
&lt;br&gt;- open sessions for discussion in specific subfields, on open problems, or on professional issues (if requested by the participants)
&lt;br&gt;&lt;br&gt;INVITED SPEAKERS:
&lt;br&gt;&lt;br&gt;John Brzozowski (Waterloo), Complexity in Convex Languages
&lt;br&gt;Alexander Clark (London), Three Learnable Models for the Description of Language
&lt;br&gt;Lauri Karttunen (Palo Alto), to be announced (tutorial)
&lt;br&gt;Borivoj Melichar (Prague), Arbology: Trees and Pushdown Automata
&lt;br&gt;Anca Muscholl (Bordeaux), Communicating Automata (tutorial)
&lt;br&gt;&lt;br&gt;PROGRAMME COMMITTEE:
&lt;br&gt;&lt;br&gt;Alberto Apostolico (Atlanta)
&lt;br&gt;Thomas Bäck (Leiden)
&lt;br&gt;Stefania Bandini (Milano)
&lt;br&gt;Wolfgang Banzhaf (St. John's)
&lt;br&gt;Henning Bordihn (Potsdam)
&lt;br&gt;Kwang-Moo Choe (Daejeon)
&lt;br&gt;Andrea Corradini (Pisa)
&lt;br&gt;Christophe Costa Florencio (Leuven)
&lt;br&gt;Maxime Crochemore (Marne-la-Vallée)
&lt;br&gt;W. Bruce Croft (Amherst)
&lt;br&gt;Erzsébet Csuhaj-Varjú (Budapest)
&lt;br&gt;Jürgen Dassow (Magdeburg)
&lt;br&gt;Volker Diekert (Stuttgart)
&lt;br&gt;Rodney G. Downey (Wellington)
&lt;br&gt;Frank Drewes (Umea)
&lt;br&gt;Henning Fernau (Trier, co-chair)
&lt;br&gt;Rusins Freivalds (Riga)
&lt;br&gt;Rudolf Freund (Wien)
&lt;br&gt;Paul Gastin (Cachan)
&lt;br&gt;Edwin Hancock (York, UK)
&lt;br&gt;Markus Holzer (Giessen)
&lt;br&gt;Helmut Jürgensen (London, Canada)
&lt;br&gt;Juhani Karhumäki (Turku)
&lt;br&gt;Efim Kinber (Fairfield)
&lt;br&gt;Claude Kirchner (Bordeaux)
&lt;br&gt;Brian Marcus (Vancouver)
&lt;br&gt;Carlos Martín-Vide (Brussels, co-chair)
&lt;br&gt;Risto Miikkulainen (Austin)
&lt;br&gt;Victor Mitrana (Bucharest)
&lt;br&gt;Claudio Moraga (Mieres)
&lt;br&gt;Sven Naumann (Trier)
&lt;br&gt;Chrystopher Nehaniv (Hatfield)
&lt;br&gt;Maurice Nivat (Paris)
&lt;br&gt;Friedrich Otto (Kassel)
&lt;br&gt;Daniel Reidenbach (Loughborough)
&lt;br&gt;Klaus Reinhardt (Tübingen)
&lt;br&gt;Antonio Restivo (Palermo)
&lt;br&gt;Christophe Reutenauer (Montréal)
&lt;br&gt;Kai Salomaa (Kingston, Canada)
&lt;br&gt;Jeffrey Shallit (Waterloo)
&lt;br&gt;Eljas Soisalon-Soininen (Helsinki)
&lt;br&gt;Bernhard Steffen (Dortmund)
&lt;br&gt;Frank Stephan (Singapore)
&lt;br&gt;Wolfgang Thomas (Aachen)
&lt;br&gt;Marc Tommasi (Lille)
&lt;br&gt;Esko Ukkonen (Helsinki)
&lt;br&gt;Todd Wareham (St. John's)
&lt;br&gt;Osamu Watanabe (Tokyo)
&lt;br&gt;Bruce Watson (Pretoria)
&lt;br&gt;Thomas Wilke (Kiel)
&lt;br&gt;Slawomir Zadrozny (Warsaw)
&lt;br&gt;Binhai Zhu (Bozeman)
&lt;br&gt;&lt;br&gt;ORGANIZING COMMITTEE:
&lt;br&gt;&lt;br&gt;Adrian Horia Dediu (Tarragona)
&lt;br&gt;Henning Fernau (Trier, co-chair) 
&lt;br&gt;Maria Gindorf (Trier)
&lt;br&gt;Stefan Gulan (Trier)
&lt;br&gt;Anna Kasprzik (Trier)
&lt;br&gt;Carlos Martín-Vide (Brussels, co-chair) 
&lt;br&gt;Norbert Müller (Trier)
&lt;br&gt;Bianca Truthe (Magdeburg)
&lt;br&gt;&lt;br&gt;SUBMISSIONS:
&lt;br&gt;&lt;br&gt;Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single-spaced pages and should be formatted according to the standard format for Springer Verlag's LNCS series (see &lt;a href=&quot;http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0&lt;/a&gt;). Submissions have to be uploaded at:
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://www.easychair.org/conferences/?conf=lata2010&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/conferences/?conf=lata2010&lt;/a&gt;&lt;br&gt;&lt;br&gt;PUBLICATIONS:
&lt;br&gt;&lt;br&gt;A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference.
&lt;br&gt;&lt;br&gt;A special issue of the Journal of Computer and System Sciences (Elsevier) will be later published containing refereed extended versions of some of the papers contributed to the conference. Submissions to it will be only by invitation.
&lt;br&gt;&lt;br&gt;A special issue of another major journal containing papers oriented to applications is under consideration.
&lt;br&gt;&lt;br&gt;REGISTRATION:
&lt;br&gt;&lt;br&gt;The period for registration will be open since September 1, 2009 until May 24, 2010. The registration form can be found at the website of the conference: &lt;a href=&quot;http://grammars.grlmc.com/LATA2010/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://grammars.grlmc.com/LATA2010/&lt;/a&gt;&lt;br&gt;&lt;br&gt;Early registration fees: 500 Euro
&lt;br&gt;Early registration fees (PhD students): 400 Euro
&lt;br&gt;Late registration fees: 530 Euro
&lt;br&gt;Late registration fees (PhD students): 430 Euro
&lt;br&gt;On-site registration fees: 550 Euro
&lt;br&gt;On-site registration fees (PhD students): 450 Euro
&lt;br&gt;&lt;br&gt;At least one author per paper should register. Papers that do not have a registered author by February 15, 2010 will be excluded from the proceedings.
&lt;br&gt;&lt;br&gt;Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks, lunches, excursion, and conference dinner.
&lt;br&gt;&lt;br&gt;PAYMENT:
&lt;br&gt;&lt;br&gt;Early (resp. late) registration fees must be paid by bank transfer before February 15, 2010 (resp. May 14, 2010) to the conference series account at Open Bank (Plaza Manuel Gomez Moreno 2, 28020 Madrid, Spain): IBAN: ES1300730100510403506598 - Swift code: OPENESMMXXX (account holder: Carlos Martin-Vide &amp; URV – LATA 2010).
&lt;br&gt;&lt;br&gt;Please write the participant’s name in the subject of the bank form. Transfers should not involve any expense for the conference.
&lt;br&gt;&lt;br&gt;On-site registration fees can be paid only in cash.
&lt;br&gt;&lt;br&gt;A receipt for the payment will be provided on site.
&lt;br&gt;&lt;br&gt;Besides paying the registration fees, it is required to fill in the registration form at the website of the conference.
&lt;br&gt;&lt;br&gt;BEST PAPER AWARDS:
&lt;br&gt;&lt;br&gt;An award will be offered to the authors of the two best papers accepted to the conference. Only papers fully authored by PhD students are eligible. The award intends to cover their travel expenses.
&lt;br&gt;&lt;br&gt;IMPORTANT DATES:
&lt;br&gt;&lt;br&gt;Paper submission: December 3, 2009
&lt;br&gt;Notification of paper acceptance or rejection: January 21, 2010
&lt;br&gt;Final version of the paper for the LNCS proceedings: February 3, 2010
&lt;br&gt;Early registration: February 15, 2010
&lt;br&gt;Late registration: May 14, 2010
&lt;br&gt;Starting of the conference: May 24, 2010
&lt;br&gt;Submission to the post-conference special issue(s): August 27, 2010
&lt;br&gt;&lt;br&gt;FURTHER INFORMATION:
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25826230&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;gindorf-ti@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;CONTACT:
&lt;br&gt;&lt;br&gt;LATA 2010
&lt;br&gt;Universität Trier
&lt;br&gt;Fachbereich IV – Informatik
&lt;br&gt;Campus II, Behringstraße
&lt;br&gt;D-54286 Trier
&lt;br&gt;&lt;br&gt;Phone: +49-(0)651-201-2836
&lt;br&gt;Fax: +49-(0)651-201-3954
&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25826230&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/LATA-2010%3A-2nd-call-for-papers-tp25826230p25826230.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25789723</id>
	<title>Call for participation: Methods for Modalities 6</title>
	<published>2009-10-07T05:51:12Z</published>
	<updated>2009-10-07T05:51:12Z</updated>
	<author>
		<name>Thomas Bolander</name>
	</author>
	<content type="html">====================================================================
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; CALL FOR PARTICIPATION
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 6th Workshop on METHODS FOR MODALITIES (M4M-6)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://m4m.loria.fr/M4M6&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://m4m.loria.fr/M4M6&lt;/a&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Copenhagen, Denmark
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; November 12-14, 2009
&lt;br&gt;&amp;nbsp; &amp;nbsp; NOTE: The deadline for early registration is October 19
&lt;br&gt;====================================================================
&lt;br&gt;&lt;br&gt;Scope
&lt;br&gt;-----
&lt;br&gt;The workshop METHODS FOR MODALITIES (M4M) aims to bring together
&lt;br&gt;researchers interested in developing algorithms, verification methods
&lt;br&gt;and tools based on modal logics. Here the term &amp;quot;modal logics&amp;quot; is
&lt;br&gt;conceived broadly, including temporal logic, description logic,
&lt;br&gt;guarded fragments, conditional logic, temporal and hybrid logic, etc.
&lt;br&gt;&lt;br&gt;To stimulate interaction and transfer of expertise, M4M will feature
&lt;br&gt;a number of invited talks by leading scientists, research
&lt;br&gt;presentations aimed at highlighting new developments, and submissions
&lt;br&gt;of system demonstrations.
&lt;br&gt;&lt;br&gt;More information about the previous editions can be found at
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://m4m.loria.fr/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://m4m.loria.fr/&lt;/a&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;Autumn School
&lt;br&gt;-------------
&lt;br&gt;M4M-6 will be preceded by a two-day mini-course called &amp;quot;Autumn School
&lt;br&gt;on Modal Logic&amp;quot; aimed at preparing PhD students and other researchers
&lt;br&gt;for participation in the workshop. The autumn school will be taught
&lt;br&gt;by Carlos Areces, Patrick Blackburn, Valentin Goranko, Renate Schmidt,
&lt;br&gt;and Carsten Schürmann. Consult the autumn school home page for further
&lt;br&gt;information:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://hylocore.ruc.dk/m4m6school.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://hylocore.ruc.dk/m4m6school.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;The autumn school is associated with the FIRST research school
&lt;br&gt;(&lt;a href=&quot;http://first.dk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://first.dk&lt;/a&gt;).
&lt;br&gt;&lt;br&gt;&lt;br&gt;Registration
&lt;br&gt;------------
&lt;br&gt;To register for the workshop and/or the preceding autumn school on
&lt;br&gt;modal logic, please visit the following site:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://hylocore.ruc.dk/m4m6registration.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://hylocore.ruc.dk/m4m6registration.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;Note that the deadline for early registration is October 19.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Workshop venue
&lt;br&gt;--------------
&lt;br&gt;M4M will take place at the IDA Conference Center in the center of
&lt;br&gt;Copenhagen
&lt;br&gt;(&lt;a href=&quot;http://ida.dk/sites/moedecenter/english/Sider/EnglishForside.aspx&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://ida.dk/sites/moedecenter/english/Sider/EnglishForside.aspx&lt;/a&gt;).
&lt;br&gt;The preceeding autumn school will take place at the IT University
&lt;br&gt;of Copenhagen (&lt;a href=&quot;http://www1.itu.dk/sw5211.asp&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www1.itu.dk/sw5211.asp&lt;/a&gt;). For travelling and
&lt;br&gt;accommodation information, please consult the workshop home page
&lt;br&gt;(&lt;a href=&quot;http://m4m.loria.fr/M4M6/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://m4m.loria.fr/M4M6/&lt;/a&gt;).
&lt;br&gt;&lt;br&gt;&lt;br&gt;Invited speakers
&lt;br&gt;-----------------
&lt;br&gt;- Franz Baader, TU Dresden
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;quot;Small is again beautiful in description logics&amp;quot;
&lt;br&gt;&amp;nbsp; &amp;nbsp; (&lt;a href=&quot;http://lat.inf.tu-dresden.de/~baader/index-en.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lat.inf.tu-dresden.de/~baader/index-en.html&lt;/a&gt;)
&lt;br&gt;- Barteld Kooi, University of Groningen
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;quot;Logics for intelligent interaction&amp;quot;
&lt;br&gt;&amp;nbsp; &amp;nbsp; (&lt;a href=&quot;http://www.philos.rug.nl/~barteld/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.philos.rug.nl/~barteld/&lt;/a&gt;)
&lt;br&gt;- Kim Guldstrand Larsen, Aalborg University
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;quot;Modal logics for specification and verification&amp;quot;
&lt;br&gt;&amp;nbsp; &amp;nbsp; (&lt;a href=&quot;http://www.cs.aau.dk/~kgl/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.cs.aau.dk/~kgl/&lt;/a&gt;)
&lt;br&gt;- Renate Schmidt, University of Manchester
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;quot;Simulation and Synthesis of Deduction Calculi&amp;quot;
&lt;br&gt;&amp;nbsp; &amp;nbsp; (&lt;a href=&quot;http://www.cs.man.ac.uk/~schmidt/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.cs.man.ac.uk/~schmidt/&lt;/a&gt;)
&lt;br&gt;- Yde Venema, University of Amsterdam
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;quot;Proof systems for Moss' co-algebraic modality&amp;quot;
&lt;br&gt;&amp;nbsp; &amp;nbsp; (&lt;a href=&quot;http://staff.science.uva.nl/~yde/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://staff.science.uva.nl/~yde/&lt;/a&gt;)
&lt;br&gt;&lt;br&gt;&lt;br&gt;Important dates
&lt;br&gt;---------------
&lt;br&gt;&amp;nbsp; Deadline for early registration M4M-6: October 19, 2009
&lt;br&gt;&amp;nbsp; Deadline for late registration M4M-6: November 5, 2009
&lt;br&gt;&amp;nbsp; Deadline for registration autumn school: November 5, 2009
&lt;br&gt;&amp;nbsp; Autumn school dates: November 11-12, 2009
&lt;br&gt;&amp;nbsp; M4M-6 workshop dates: November 12-14, 2009
&lt;br&gt;&lt;br&gt;&lt;br&gt;Local organisers
&lt;br&gt;----------------
&lt;br&gt;- Thomas Bolander, Technical University of Denmark
&lt;br&gt;&amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25789723&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;tb@...&lt;/a&gt;
&lt;br&gt;- Torben Braüner, Roskilde University
&lt;br&gt;&amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25789723&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;torben@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;&lt;br&gt;Program Committee
&lt;br&gt;-----------------
&lt;br&gt;&amp;nbsp; Carlos Areces, INRIA Lorraine
&lt;br&gt;&amp;nbsp; Lars Birkedal, IT University of Copenhagen
&lt;br&gt;&amp;nbsp; Patrick Blackburn, INRIA Lorraine
&lt;br&gt;&amp;nbsp; Thomas Bolander (co-chair), Technical University of Denmark
&lt;br&gt;&amp;nbsp; Julian Bradfield, University of Edinburgh
&lt;br&gt;&amp;nbsp; Torben Braüner (co-chair), Roskilde University
&lt;br&gt;&amp;nbsp; Balder ten Cate, University of Amsterdam
&lt;br&gt;&amp;nbsp; Stephane Demri, ENS de Cachan
&lt;br&gt;&amp;nbsp; Hans van Ditmarsch, University of Otago
&lt;br&gt;&amp;nbsp; Melvin Fitting, City University of New York
&lt;br&gt;&amp;nbsp; John Gallagher, Roskilde University
&lt;br&gt;&amp;nbsp; Mai Gehrke, Radboud University Nijmegen
&lt;br&gt;&amp;nbsp; Silvio Ghilardi, University of Milano
&lt;br&gt;&amp;nbsp; Valentin Goranko, University of the Witwatersrand
&lt;br&gt;&amp;nbsp; Rajeev Goré, ANU
&lt;br&gt;&amp;nbsp; Michael R. Hansen, Technical University of Denmark
&lt;br&gt;&amp;nbsp; Andreas Herzig, IRIT
&lt;br&gt;&amp;nbsp; Wiebe van der Hoek, University of Liverpool
&lt;br&gt;&amp;nbsp; Martin Lange, LMU München
&lt;br&gt;&amp;nbsp; Carsten Lutz, Dresden University of Technology
&lt;br&gt;&amp;nbsp; Angelo Montanari, University of Udine
&lt;br&gt;&amp;nbsp; Valeria de Paiva, Cuil Inc.
&lt;br&gt;&amp;nbsp; Thomas Schneider, University of Manchester
&lt;br&gt;&amp;nbsp; Carsten Schürmann, IT University of Copenhagen
&lt;br&gt;&amp;nbsp; Gert Smolka, Saarland University
&lt;br&gt;&amp;nbsp; Anders Søgaard, University of Copenhagen
&lt;br&gt;&amp;nbsp; Jørgen Villadsen, Technical University of Denmark
&lt;br&gt;&amp;nbsp; Frank Wolter, University of Liverpool
&lt;br&gt;&amp;nbsp; Thomas Ågotnes, Bergen University College
&lt;br&gt;==================================================================
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25789723&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Call-for-participation%3A-Methods-for-Modalities-6-tp25789723p25789723.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25790139</id>
	<title>CFP: Advances in Modal Logic 2010</title>
	<published>2009-10-07T00:28:39Z</published>
	<updated>2009-10-07T00:28:39Z</updated>
	<author>
		<name>Carlos Areces-3</name>
	</author>
	<content type="html">[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]&amp;lt;&amp;gt;[]
&lt;br&gt;&lt;br&gt;AiML-2010: &amp;nbsp;FIRST CALL FOR PAPERS
&lt;br&gt;&lt;br&gt;8-TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC
&lt;br&gt;MOSCOW, AUGUST 25-29, 2010
&lt;br&gt;&lt;br&gt;&amp;nbsp; &lt;a href=&quot;http://aiml10.mi.ras.ru/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://aiml10.mi.ras.ru/&lt;/a&gt;&lt;br&gt;&lt;br&gt;Advances in Modal Logic is an initiative aimed at presenting
&lt;br&gt;the state of the art in modal logic and its various applications. The
&lt;br&gt;initiative consists of a conference series together with volumes based on
&lt;br&gt;the conferences. Information about the AiML series can be obtained at
&lt;br&gt;&lt;a href=&quot;http://www.aiml.net&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.aiml.net&lt;/a&gt;&amp;nbsp;&amp;lt;&lt;a href=&quot;http://www.aiml.net&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.aiml.net&lt;/a&gt;&amp;gt; . AiML-2010 is the eighth
&lt;br&gt;conference in the series.
&lt;br&gt;&lt;br&gt;TOPICS
&lt;br&gt;We invite submission on all aspects of modal logics, including:
&lt;br&gt;&lt;br&gt;- history of modal logic
&lt;br&gt;- philosophy of modal logic
&lt;br&gt;- applications of modal logic
&lt;br&gt;- computational aspects of modal logic
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ complexity and decidability of modal and temporal logics
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ modal and temporal logic programming
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ model checking
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ theorem proving for modal logics
&lt;br&gt;- theoretical aspects of modal logic
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ algebraic &amp;nbsp;and categorical perspectives on modal logic
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ coalgebraic modal logic
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ completeness and canonicity
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ correspondence and duality theory
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ many-dimensional modal logics
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ modal fixed point logics
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ model theory of modal logic
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ proof theory of modal logic
&lt;br&gt;- specific instances and variations of modal logic
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ description logics
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ dynamic logics and other process logics
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ epistemic and deontic logics
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ modal logics for agent-based systems
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ modal logic and game theory
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ modal logic and grammar formalisms
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ provability and interpretability logics
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ spatial and temporal logics
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ hybrid logic
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ intuitionistic logic
&lt;br&gt;&amp;nbsp; &amp;nbsp;+ substructural logics
&lt;br&gt;&lt;br&gt;Papers on related subjects will also be considered.
&lt;br&gt;&lt;br&gt;&lt;br&gt;INVITED SPEAKERS: TO BE ANNOUNCED
&lt;br&gt;&lt;br&gt;PAPER SUBMISSIONS
&lt;br&gt;There will be two types of submissions to AiML-2010
&lt;br&gt;&lt;br&gt;(1) Full papers for publication in the proceedings and presentation at the
&lt;br&gt;conference.
&lt;br&gt;&lt;br&gt;(2) Abstracts for short presentation only.
&lt;br&gt;&lt;br&gt;Both types of papers should be submitted electronically using the
&lt;br&gt;EasyChair submission page at
&lt;br&gt;&lt;br&gt;&amp;nbsp; &lt;a href=&quot;http://www.easychair.org/conferences/?conf=aiml2010&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/conferences/?conf=aiml2010&lt;/a&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;(1) FULL PAPERS
&lt;br&gt;Authors are invited to submit, for presentation at the conference and
&lt;br&gt;publication in the proceedings, full papers reporting on original research
&lt;br&gt;and not submitted elsewhere. The proceedings of AiML'2010 will be published
&lt;br&gt;by College Publications
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://www.collegepublications.co.uk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.collegepublications.co.uk&lt;/a&gt;&lt;br&gt;&lt;br&gt;in a volume to be made available at the conference.
&lt;br&gt;&lt;br&gt;The submissions should be at most 15 pages, with an optional technical
&lt;br&gt;appendix of up to 5 pages, together with a plain-text abstract of 100-200
&lt;br&gt;words. The submissions must be typeset in LaTex, using a style file and
&lt;br&gt;template that will be provided on the AiML'2010 website
&lt;br&gt;&lt;a href=&quot;http://aiml10.mi.ras.ru/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://aiml10.mi.ras.ru/&lt;/a&gt;&amp;nbsp;in due time.
&lt;br&gt;&lt;br&gt;At least one author of each accepted paper must register for, and attend,
&lt;br&gt;the conference to present the paper.
&lt;br&gt;&lt;br&gt;(2) ABSTRACTS
&lt;br&gt;These should be at most 5 pages. They may describe preliminary results, work
&lt;br&gt;in progress etc., and will be subject to light reviewing. The accepted
&lt;br&gt;abstracts will be made available at the conference, and the authors will
&lt;br&gt;have the opportunity to make short presentations (of up to 15 minutes) on
&lt;br&gt;them.
&lt;br&gt;&lt;br&gt;&lt;br&gt;PROGRAMME COMMITTEE:
&lt;br&gt;&lt;br&gt;Carlos Areces &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (INRIA, Nancy-Grand Est, France)
&lt;br&gt;Philippe Balbiani &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (IRIT, Toulouse, France)
&lt;br&gt;Alexandru Baltag &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(University of Oxford, UK)
&lt;br&gt;Lev Beklemishev &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (Moscow State University, Russia)
&lt;br&gt;Johan van Benthem &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (ILLC, University of Amsterdam, The Netherlands)
&lt;br&gt;Guram Bezhanishvili &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (New Mexico State University, USA)
&lt;br&gt;Torben Brauner &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(Roskilde University, Denmark)
&lt;br&gt;Patrick Blackburn &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (INRIA, Nancy-Grand Est, France)
&lt;br&gt;Balder ten Cate &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (LSV, ENS Cachan, France)
&lt;br&gt;Stephane Demri &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(LSV, ENS Cachan, France)
&lt;br&gt;Melvin Fitting &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(Lehman College, CUNY, USA)
&lt;br&gt;Silvio Ghilardi &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (University of Milano, Italy)
&lt;br&gt;Robert Goldblatt &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(Victoria University of Wellington, New Zealand)
&lt;br&gt;Rajeev Gore &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (The Australian National University, Australia)
&lt;br&gt;Andreas Herzig &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(IRIT, Toulouse, France)
&lt;br&gt;Ian Hodkinson &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (Imperial College London, UK)
&lt;br&gt;Wiebe van der Hoek &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(University of Liverpool, UK)
&lt;br&gt;Rosalie Iemhoff &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (University of Utrecht, The Netherlands)
&lt;br&gt;Alexander Kurz &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(University of Leicester, UK)
&lt;br&gt;Martin Lange &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(Ludwig-Maximilians University, Munich, Germany)
&lt;br&gt;Carsten Lutz &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(University of Bremen, Germany)
&lt;br&gt;Larisa Maksimova &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(Sobolev Inst. of Mathematics, Novosibirsk, Russia)
&lt;br&gt;Edwin Mares &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (Victoria University of Wellington, New Zealand)
&lt;br&gt;Larry Moss &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(Indiana University, USA)
&lt;br&gt;Martin Otto &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (Technical University of Darmstadt, Germany)
&lt;br&gt;Dirk Pattinson &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(Imperial College London, UK)
&lt;br&gt;Mark Reynolds &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; (University of Western Australia, Australia)
&lt;br&gt;Renate Schmidt &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(University of Manchester, UK)
&lt;br&gt;Nobu-Yuki Suzuki &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(Shizuoka University, Japan)
&lt;br&gt;Yde Venema &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(ILLC, University of Amsterdam, The Netherlands)
&lt;br&gt;Igor Walukiewicz &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(LABRI, Bordeaux, France)
&lt;br&gt;Frank Wolter &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(University of Liverpool, UK)
&lt;br&gt;Michael Zakharyaschev &amp;nbsp; &amp;nbsp; &amp;nbsp; (Birkbeck College, London, UK)
&lt;br&gt;&lt;br&gt;&lt;br&gt;PROGRAMME COMMITTEE CO-CHAIRS
&lt;br&gt;Valentin Shehtman (Moscow State University, Russia)
&lt;br&gt;Valentin Goranko (Technical University of Denmark, Denmark)
&lt;br&gt;&lt;br&gt;ORGANIZING COMMITTEE CHAIR:
&lt;br&gt;Lev Beklemishev &amp;nbsp;(Steklov Mathematical Institute, Moscow, Russia)
&lt;br&gt;&lt;br&gt;IMPORTANT DATES
&lt;br&gt;Full papers submission deadline: 16 March 2010
&lt;br&gt;Full papers acceptance notification: 21 May 2010
&lt;br&gt;Short presentations submission deadline: 1 June, 2010
&lt;br&gt;Short presentations acceptance notification: 21 June, 2010
&lt;br&gt;Final version of full papers and abstracts due: 30 June 2010
&lt;br&gt;Conference: 25-29 August, 2010.
&lt;br&gt;&lt;br&gt;&lt;br&gt;CONFERENCE LOCATION
&lt;br&gt;Advances in Modal Logic 2010 will be held at
&lt;br&gt;Steklov Mathematical Institute, Moscow
&lt;br&gt;&lt;br&gt;&lt;br&gt;FURTHER INFORMATION
&lt;br&gt;AiML 2010 website: &amp;nbsp;&lt;a href=&quot;http://aiml10.mi.ras.ru/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://aiml10.mi.ras.ru/&lt;/a&gt;&lt;br&gt;&lt;br&gt;ENQUIRIES
&lt;br&gt;E-mail enquiries should be directed respectively to the chair of the
&lt;br&gt;organizing committee, sent to lbekl(at)yandex(dot)ru,
&lt;br&gt;or to the PC co-chairs, sent to &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25790139&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;aimolog2010@...&lt;/a&gt;.
&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25790139&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/CFP%3A-Advances-in-Modal-Logic-2010-tp25790139p25790139.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25770292</id>
	<title>CfPart: FMICS 2009, 2-3 November 2009, Final Call</title>
	<published>2009-10-06T00:48:37Z</published>
	<updated>2009-10-06T00:48:37Z</updated>
	<author>
		<name>Christophe Joubert-2</name>
	</author>
	<content type="html">&lt;br&gt;FMICS 2009 - FINAL CALL FOR PARTICIPATION
&lt;br&gt;Please visit: &lt;a href=&quot;http://users.dsic.upv.es/workshops/fmics2009&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://users.dsic.upv.es/workshops/fmics2009&lt;/a&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;************************************************************
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 14th International Workshop on &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;Formal Methods for Industrial Critical Systems &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;FMICS 2009 &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;part of the first FMweek &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; November 2-3, 2009 &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Eindhoven, The Netherlands &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;************************************************************
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;** NEWS ** &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;gt;&amp;gt; Final programme &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;gt;&amp;gt; Normal registration before October 19 &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;gt;&amp;gt; Springer LNCS 5825 proceedings &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; *
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;************************************************************
&lt;br&gt;&lt;br&gt;FMICS 2009 &amp;nbsp;is the fourteenth &amp;nbsp;in a series &amp;nbsp;of International
&lt;br&gt;Workshop on Formal Methods &amp;nbsp;for Industrial Critical Systems.
&lt;br&gt;Previous &amp;nbsp;workshops of &amp;nbsp;the &amp;nbsp;ERCIM working &amp;nbsp;group on &amp;nbsp;Formal
&lt;br&gt;Methods for Industrial Critical &amp;nbsp;Systems were held in Oxford
&lt;br&gt;(March &amp;nbsp;1996), Cesena &amp;nbsp;(July &amp;nbsp;1997), &amp;nbsp;Amsterdam (May &amp;nbsp;1998),
&lt;br&gt;Trento (July 1999), Berlin &amp;nbsp;(April 2000), Paris (July 2001),
&lt;br&gt;Malaga (July &amp;nbsp;2002), Trondheim (June 2003), &amp;nbsp;Linz (September
&lt;br&gt;2004), Lisbon &amp;nbsp;(September 2005), Bonn (August &amp;nbsp;2006), Berlin
&lt;br&gt;(July 2007), and L'Aquila (September 2008).
&lt;br&gt;&lt;br&gt;The aim of &amp;nbsp;the FMICS workshop series is to &amp;nbsp;provide a forum
&lt;br&gt;for researchers &amp;nbsp;who are &amp;nbsp;interested in the &amp;nbsp;development and
&lt;br&gt;application of &amp;nbsp;formal methods &amp;nbsp;in industry. &amp;nbsp;In particular,
&lt;br&gt;these workshops bring together &amp;nbsp;scientists and engineers who
&lt;br&gt;are active in the area &amp;nbsp;of formal methods and are interested
&lt;br&gt;in exchanging &amp;nbsp;their experiences in the &amp;nbsp;industrial usage of
&lt;br&gt;these &amp;nbsp;methods. &amp;nbsp;These &amp;nbsp;workshops &amp;nbsp;also &amp;nbsp;strive &amp;nbsp;to &amp;nbsp;promote
&lt;br&gt;research &amp;nbsp;and &amp;nbsp;development &amp;nbsp;for the &amp;nbsp;improvement &amp;nbsp;of &amp;nbsp;formal
&lt;br&gt;methods and tools for industrial applications.
&lt;br&gt;&lt;br&gt;Complete &amp;nbsp;and up &amp;nbsp;to date &amp;nbsp;information can &amp;nbsp;be found &amp;nbsp;at the
&lt;br&gt;event website &lt;a href=&quot;http://users.dsic.upv.es/workshops/fmics2009/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://users.dsic.upv.es/workshops/fmics2009/&lt;/a&gt;.
&lt;br&gt;FMICS 2009 is &amp;nbsp;part of the 1st FMweek &amp;nbsp;(Formal Methods week,
&lt;br&gt;&lt;a href=&quot;http://www.win.tue.nl/fmweek/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.win.tue.nl/fmweek/&lt;/a&gt;), &amp;nbsp;which &amp;nbsp;brings &amp;nbsp;together &amp;nbsp;10
&lt;br&gt;international &amp;nbsp;scientific &amp;nbsp;events, &amp;nbsp;6 &amp;nbsp;project &amp;nbsp;and &amp;nbsp;working
&lt;br&gt;group &amp;nbsp;meetings, &amp;nbsp;and &amp;nbsp;a &amp;nbsp;variety &amp;nbsp;of &amp;nbsp;other &amp;nbsp;activities &amp;nbsp;in
&lt;br&gt;the &amp;nbsp;area. &amp;nbsp;Further &amp;nbsp;information &amp;nbsp;about &amp;nbsp;the &amp;nbsp;FMICS &amp;nbsp;working
&lt;br&gt;group &amp;nbsp;and &amp;nbsp;the &amp;nbsp;next &amp;nbsp;FMICS &amp;nbsp; workshop &amp;nbsp;can &amp;nbsp;be &amp;nbsp;found &amp;nbsp;at:
&lt;br&gt;&lt;a href=&quot;http://www.inrialpes.fr/vasy/fmics&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.inrialpes.fr/vasy/fmics&lt;/a&gt;.
&lt;br&gt;&lt;br&gt;INVITED SPEAKERS
&lt;br&gt;----------------
&lt;br&gt;Dino Distefano &amp;nbsp; &amp;nbsp; &amp;nbsp; Queen Mary, University of London, UK
&lt;br&gt;Diego Latella &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;CNR/ISTI, Italy
&lt;br&gt;Thierry Lecomte &amp;nbsp; &amp;nbsp; &amp;nbsp;ClearSy, France
&lt;br&gt;Ken McMillan &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Cadence Berkeley Labs, USA
&lt;br&gt;&lt;br&gt;Following &amp;nbsp;a &amp;nbsp; tradition &amp;nbsp;established &amp;nbsp;over &amp;nbsp;the &amp;nbsp; past &amp;nbsp;few
&lt;br&gt;years, &amp;nbsp;the European &amp;nbsp;Association &amp;nbsp;of &amp;nbsp;Software Science &amp;nbsp;and
&lt;br&gt;Technology &amp;nbsp;(EASST) &amp;nbsp; will &amp;nbsp;offer &amp;nbsp;an &amp;nbsp;award &amp;nbsp; to &amp;nbsp;the &amp;nbsp;best
&lt;br&gt;FMICS &amp;nbsp;paper.
&lt;br&gt;&lt;br&gt;PROGRAM CHAIRS
&lt;br&gt;--------------
&lt;br&gt;Maria Alpuente &amp;nbsp; &amp;nbsp; &amp;nbsp; Technical University of Valencia, Spain
&lt;br&gt;Byron Cook &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Microsoft Research, UK
&lt;br&gt;&lt;br&gt;WORKSHOP CHAIR
&lt;br&gt;--------------
&lt;br&gt;Christophe Joubert &amp;nbsp; Technical University of Valencia, Spain
&lt;br&gt;&lt;br&gt;VENUE
&lt;br&gt;-----
&lt;br&gt;The &amp;nbsp;venue for &amp;nbsp;FMICS 2009 &amp;nbsp;is the &amp;nbsp;Auditorium of &amp;nbsp;Eindhoven
&lt;br&gt;University of Technology. The &amp;nbsp;university campus lies in the
&lt;br&gt;centre of &amp;nbsp;Eindhoven, within walking distance &amp;nbsp;of conference
&lt;br&gt;hotels. The city &amp;nbsp;itself can easily be reached &amp;nbsp;via both its
&lt;br&gt;own airport and Schiphol (the Dutch mainport).
&lt;br&gt;&lt;br&gt;REGISTRATION
&lt;br&gt;------------
&lt;br&gt;The &amp;nbsp;event &amp;nbsp; website &amp;nbsp;provides &amp;nbsp; a &amp;nbsp;one-stop &amp;nbsp; window &amp;nbsp;where
&lt;br&gt;participants &amp;nbsp;can &amp;nbsp; register &amp;nbsp;to &amp;nbsp;FMICS &amp;nbsp;2009 &amp;nbsp; and &amp;nbsp;to &amp;nbsp;any
&lt;br&gt;combination of FMweek events they would &amp;nbsp;like to participate
&lt;br&gt;in, and make hotel reservation for their stay in Eindhoven.
&lt;br&gt;&lt;br&gt;************************************************************
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;+============================================+ &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; ** FMweek ** &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; | &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;+============================================+ &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; FMICS &amp;nbsp; &amp;nbsp; | &amp;nbsp; &amp;nbsp;FM2009 &amp;nbsp; &amp;nbsp;| &amp;nbsp; REFINE &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;+--------------------------------------------+ &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;PDMC &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; TESTCOM/FATES &amp;nbsp; &amp;nbsp; &amp;nbsp; | &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;+--------------------------------------------+ &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp;FACS &amp;nbsp; | &amp;nbsp; CPA &amp;nbsp; | &amp;nbsp; FAST &amp;nbsp; | &amp;nbsp; FMCO &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;+--------------------------------------------+ &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;| &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://www.win.tue.nl/fmweek&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.win.tue.nl/fmweek&lt;/a&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; | &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp;+============================================+ &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;* &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*
&lt;br&gt;************************************************************
&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25770292&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/CfPart%3A-FMICS-2009%2C-2-3-November-2009%2C-Final-Call-tp25770292p25770292.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25770227</id>
	<title>HLDVT 2009 Call for Participation: Early Registration Deadline</title>
	<published>2009-10-05T22:42:48Z</published>
	<updated>2009-10-05T22:42:48Z</updated>
	<author>
		<name>Shireesh Verma</name>
	</author>
	<content type="html">&lt;span style=&quot;font-family:arial, sans-serif;font-size:13px;border-collapse:collapse&quot;&gt;&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:32pt;font-family:Arial&quot;&gt;IEEE International High Level Design&lt;/span&gt;&lt;span style=&quot;font-size:32pt;font-family:&amp;#39;MS Mincho&amp;#39;&quot;&gt;&lt;/span&gt;&lt;span style=&quot;font-size:32pt;font-family:Arial&quot;&gt;Validation and Test Workshop 2009&lt;/span&gt;&lt;span style=&quot;font-size:13pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;


&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:13pt;font-family:Arial&quot;&gt; &lt;/span&gt;&lt;/p&gt;&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;b&gt;&lt;span style=&quot;font-size:21pt;font-family:Arial&quot;&gt;November 4-6, 2009&lt;/span&gt;&lt;/b&gt;&lt;span style=&quot;font-size:13pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;


&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;b&gt;&lt;span style=&quot;font-size:21pt;font-family:Arial&quot;&gt;Grand Hyatt, San Francisco (Union Square)&lt;/span&gt;&lt;/b&gt;&lt;span style=&quot;font-size:13pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Register at &lt;/span&gt;&lt;a href=&quot;http://www.hldvt.com/09/registration.html&quot; style=&quot;color:rgb(42, 93, 176)&quot; target=&quot;_blank&quot; rel=&quot;nofollow&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial;color:rgb(0, 0, 153)&quot;&gt;http://www.hldvt.com/09/registration.html&lt;/span&gt;&lt;/a&gt; &lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;before &lt;b&gt;October 7&lt;/b&gt;&lt;/span&gt;&lt;b&gt;&lt;sup&gt;&lt;span style=&quot;font-size:8.5pt;font-family:Arial&quot;&gt;th&lt;/span&gt;&lt;/sup&gt;&lt;/b&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt; to receive discounted registration rates. Book your hotel room in the heart of San Francisco at a discounted rate of $140.&lt;/span&gt;&lt;span style=&quot;font-size:13pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;


&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-family:&amp;#39;Times New Roman&amp;#39;&quot;&gt; &lt;/span&gt;&lt;/p&gt;&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;For the past 13 years, IEEE International High Level Design Validation and Test Workshop has been a platform for addressing emerging challenges in verification and test methodologies for ICs and systems. &lt;/span&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;The workshop is an informal forum where EDA tool developers, academics, and industrial practitioners get together to discuss contemporary issues in &lt;/span&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;verification, debug, synthesis, and test.&lt;/span&gt;&lt;span style=&quot;font-size:13pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;


&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt; &lt;/span&gt;&lt;b&gt;&lt;span style=&quot;font-size:21pt;font-family:Arial&quot;&gt;This year&amp;#39;s program will feature….&lt;/span&gt;&lt;/b&gt;&lt;span style=&quot;font-size:13pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;


&lt;p style=&quot;margin-left:29pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Symbol&quot;&gt;&lt;span&gt;·&lt;span&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Keynote Address by &lt;b&gt;&lt;i&gt;Sunil R. Shenoy&lt;/i&gt;&lt;/b&gt; - Vice President, Intel Architecture Group, and General Manager, Microprocessor and Graphics Development - Intel Corporation&lt;/span&gt;&lt;/p&gt;


&lt;p style=&quot;margin-left:29pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Symbol&quot;&gt;&lt;span&gt;·&lt;span&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Seventeen Regular Papers&lt;/span&gt;&lt;/p&gt;
&lt;p style=&quot;margin-left:29pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Symbol&quot;&gt;&lt;span&gt;·&lt;span&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Panel: &lt;b&gt;&lt;i&gt;&lt;span style=&quot;color:rgb(34, 30, 31)&quot;&gt;SystemC Why: To Design or to Verify? &lt;span style=&quot;font-weight:normal&quot;&gt;What experts say?&lt;/span&gt;&lt;/span&gt;&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;


&lt;p style=&quot;margin-left:29pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Symbol&quot;&gt;&lt;span&gt;·&lt;span&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Special Session: &lt;b&gt;&lt;i&gt;&lt;span style=&quot;color:rgb(34, 30, 31)&quot;&gt;Innovative Industrial Practices&lt;/span&gt;&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;


&lt;p style=&quot;margin-left:29pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Symbol&quot;&gt;&lt;span&gt;·&lt;span&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Three Invited Sessions:&lt;/span&gt;&lt;/p&gt;
&lt;p style=&quot;margin-top:12pt;margin-right:0in;margin-bottom:12pt;margin-left:1.25in;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:14pt;font-family:Symbol&quot;&gt;&lt;span&gt;·&lt;span&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;i&gt;&lt;span style=&quot;font-size:14pt;font-family:Arial;color:rgb(34, 30, 31)&quot;&gt;RTL Validation and Debug&lt;/span&gt;&lt;/i&gt;&lt;i&gt;&lt;span style=&quot;font-size:14pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/i&gt;&lt;/p&gt;


&lt;p style=&quot;margin-top:0in;margin-right:0in;margin-bottom:12pt;margin-left:1.25in;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:14pt;font-family:Symbol&quot;&gt;&lt;span&gt;·&lt;span&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;i&gt;&lt;span style=&quot;font-size:14pt;font-family:Arial;color:rgb(34, 30, 31)&quot;&gt;High-Level Modeling and Validation&lt;/span&gt;&lt;/i&gt;&lt;i&gt;&lt;span style=&quot;font-size:14pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/i&gt;&lt;/p&gt;


&lt;p style=&quot;margin-top:0in;margin-right:0in;margin-bottom:12pt;margin-left:1.25in;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:14pt;font-family:Symbol&quot;&gt;&lt;span&gt;·&lt;span&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;i&gt;&lt;span style=&quot;font-size:14pt;font-family:Arial;color:rgb(34, 30, 31)&quot;&gt;Post-Silicon Validation and Debug&lt;/span&gt;&lt;/i&gt;&lt;/p&gt;


&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;b&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Helpful Links:&lt;/span&gt;&lt;/b&gt;&lt;span style=&quot;font-size:13pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;


&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Advance Program: &lt;/span&gt;&lt;a href=&quot;http://www.hldvt.com/09/HLDVTAP09.pdf&quot; style=&quot;color:rgb(42, 93, 176)&quot; target=&quot;_blank&quot; rel=&quot;nofollow&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;http://www.hldvt.com/09/HLDVTAP09.pdf&lt;/span&gt;&lt;/a&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;


&lt;p style=&quot;margin-bottom:12pt;text-align:justify&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Hotel Information:   &lt;/span&gt;&lt;a href=&quot;http://www.hldvt.com/09/local.html&quot; style=&quot;color:rgb(42, 93, 176)&quot; target=&quot;_blank&quot; rel=&quot;nofollow&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial;color:rgb(0, 0, 153)&quot;&gt;http://www.hldvt.com/09/local.html&lt;/span&gt;&lt;/a&gt;&lt;span style=&quot;font-size:13pt;font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;


&lt;span style=&quot;font-size:16pt;font-family:Arial&quot;&gt;Home Page:           &lt;/span&gt;&lt;span style=&quot;font-size:12pt;font-family:Cambria&quot;&gt;&lt;a href=&quot;http://www.hldvt.com/09/index.html&quot; style=&quot;color:rgb(42, 93, 176)&quot; target=&quot;_blank&quot; rel=&quot;nofollow&quot;&gt;&lt;span style=&quot;font-size:16pt;font-family:Arial;color:rgb(0, 0, 153)&quot;&gt;http://www.hldvt.com/09/index.html&lt;/span&gt;&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25770227&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/HLDVT-2009-Call-for-Participation%3A-Early-Registration-Deadline-tp25770227p25770227.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25770206</id>
	<title>FMCAD'09 Call For Participation</title>
	<published>2009-10-04T10:16:50Z</published>
	<updated>2009-10-04T10:16:50Z</updated>
	<author>
		<name>Armin Biere</name>
	</author>
	<content type="html">Dear colleague,
&lt;br&gt;&lt;br&gt;we put together a very interesting program for FMCAD'09!
&lt;br&gt;&lt;br&gt;&amp;nbsp; &lt;a href=&quot;http://fmv.jku.at/fmcad09&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://fmv.jku.at/fmcad09&lt;/a&gt;&lt;br&gt;&lt;br&gt;Please register soon. Early registration ends on October 11!
&lt;br&gt;&lt;br&gt;FMCAD'09 takes place from November 15 through 18 at the 
&lt;br&gt;University of Texas at Austin. &amp;nbsp;Beside presentations of 
&lt;br&gt;30 accepted papers we have
&lt;br&gt;&lt;br&gt;&amp;nbsp; * two keynotes, one by Turing Award Winner E. Allen Emerson 
&lt;br&gt;&amp;nbsp; &amp;nbsp; (UT Austin) on &amp;quot;Formal Methods: From Start to Limit&amp;quot; and 
&lt;br&gt;&amp;nbsp; &amp;nbsp; another keynote from John D. Barton (Intel) on &amp;quot;Post Silicon 
&lt;br&gt;&amp;nbsp; &amp;nbsp; Validation/Verification practices in the PC industry&amp;quot;
&lt;br&gt;&amp;nbsp; 
&lt;br&gt;&amp;nbsp; * three industrial experience reports by Michael Theobald 
&lt;br&gt;&amp;nbsp; &amp;nbsp; (D.E. Shaw), John Penix (Google), and 
&lt;br&gt;&amp;nbsp; &amp;nbsp; Jorg Bormann (OneSpin Solutions),
&lt;br&gt;&lt;br&gt;&amp;nbsp; * and last but not least two tutorials, one by 
&lt;br&gt;&amp;nbsp; &amp;nbsp; Nikolaj Bjorner (Microsoft) on &amp;quot;Bit-Precise Constraints: 
&lt;br&gt;&amp;nbsp; &amp;nbsp; Applications and Decision Procedures&amp;quot; and another tutorial by
&lt;br&gt;&amp;nbsp; &amp;nbsp; Moshe Vardi (Rice) on &amp;quot;Formal Techniques for SoC Verification&amp;quot;
&lt;br&gt;&lt;br&gt;There are two panels organized by Vigyan Singhal (Oski Technology)
&lt;br&gt;&lt;br&gt;&amp;nbsp; * a semiconductor panel on the topic &amp;quot;Frontline users speak up!
&lt;br&gt;&amp;nbsp; &amp;nbsp; What works, What doesn't, and What are they doing about it?&amp;quot;
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; Ken Albin (AMD), Alan Carlin (Freescale), Velu Durairaj (TI),
&lt;br&gt;&amp;nbsp; &amp;nbsp; Alan Hunter (ARM), Tushar Ringe (ADI), Dan Smith (NVIDIA)
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; moderated by Adnan Aziz (UT Austin)
&lt;br&gt;&lt;br&gt;&amp;nbsp; * an EDA vendors lunch panel on &amp;quot;What will be the next 
&lt;br&gt;&amp;nbsp; &amp;nbsp; breakthrough solutions in formal?&amp;quot;
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; Harry Foster (Mentor Graphics), 
&lt;br&gt;&amp;nbsp; &amp;nbsp; Ziyad Hanna (Jasper Design Automation),
&lt;br&gt;&amp;nbsp; &amp;nbsp; Kevin Harrer (Synopsys), Axel Scherer (Cadence)
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; moderated by JL Gray (Verilab)
&lt;br&gt;&lt;br&gt;Note again that early registration ends already on October 11.
&lt;br&gt;&lt;br&gt;We hope to see you in Austin!
&lt;br&gt;&lt;br&gt;Regards,
&lt;br&gt;&lt;br&gt;Armin Biere and Carl Pixley (co-chairs)
&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25770206&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/FMCAD%2709-Call-For-Participation-tp25770206p25770206.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25730392</id>
	<title>*** FLOPS 2010: Last Call for Papers ***</title>
	<published>2009-10-02T12:09:35Z</published>
	<updated>2009-10-02T12:09:35Z</updated>
	<author>
		<name>Matthias Blume-3</name>
	</author>
	<content type="html">----------------------------------------------------------------------------
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; LAST CALL FOR PAPERS
&lt;br&gt;&lt;br&gt;Tenth International Symposium on Functional and Logic Programming
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;(FLOPS 2010)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; April 19-21, 2010
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Sendai, Japan
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://www.kb.ecei.tohoku.ac.jp/flops2010/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.kb.ecei.tohoku.ac.jp/flops2010/&lt;/a&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Submission deadline: October 16, 2009
&lt;br&gt;&lt;br&gt;FLOPS is a forum for research on all issues concerning declarative
&lt;br&gt;programming, including functional programming and logic programming,
&lt;br&gt;and aims to promote cross-fertilization and integration between the
&lt;br&gt;two paradigms. &amp;nbsp;Previous FLOPS meetings were held in Fuji Susono
&lt;br&gt;(1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo
&lt;br&gt;(2001), Aizu (2002), Nara (2004), Fuji Susono (2006), and Ise
&lt;br&gt;(2008).
&lt;br&gt;&lt;br&gt;TOPICS
&lt;br&gt;&lt;br&gt;FLOPS solicits original papers in all areas of functional and logic
&lt;br&gt;programming, including (but not limited to):
&lt;br&gt;&lt;br&gt;Declarative Pearls: new and excellent declarative programs with
&lt;br&gt;illustrative applications.
&lt;br&gt;&lt;br&gt;Language issues: language design and constructs, programming
&lt;br&gt;methodology, integration of paradigms, interfacing with other
&lt;br&gt;languages, type systems, constraints, concurrency and distributed
&lt;br&gt;computing.
&lt;br&gt;&lt;br&gt;Foundations: logic and semantics, rewrite systems and narrowing,
&lt;br&gt;type theory, proof systems.
&lt;br&gt;&lt;br&gt;Implementation issues: compilation techniques, memory management,
&lt;br&gt;program analysis and transformation, partial evaluation,
&lt;br&gt;parallelism.
&lt;br&gt;&lt;br&gt;Applications: case studies, real-world applications, graphical
&lt;br&gt;user interfaces, Internet applications, XML, databases, formal
&lt;br&gt;methods and model checking.
&lt;br&gt;&lt;br&gt;The proceedings will be published as an LNCS volume. The proceedings
&lt;br&gt;of the previous meeting (FLOPS 2008) were published as LNCS 4989.
&lt;br&gt;&lt;br&gt;INVITED SPEAKERS
&lt;br&gt;&lt;br&gt;TBD
&lt;br&gt;&lt;br&gt;PC CO-CHAIRS
&lt;br&gt;&lt;br&gt;Matthias Blume (Google, Chicago, USA)
&lt;br&gt;German Vidal (Technical University of Valencia, Spain)
&lt;br&gt;&lt;br&gt;CONFERENCE CHAIR
&lt;br&gt;&lt;br&gt;Naoki Kobayashi (Tohoku University, Sendai, Japan)
&lt;br&gt;&lt;br&gt;PC MEMBERS
&lt;br&gt;&lt;br&gt;Nick Benton (Microsoft Research, Cambridge, UK)
&lt;br&gt;Manuel Chakravarty (University of New South Wales, Australia)
&lt;br&gt;Michael Codish (Ben-Gurion University of the Negev, Israel)
&lt;br&gt;Bart Demoen (Katholieke Universiteit Leuven, Belgium)
&lt;br&gt;Agostino Dovier (University of Udine, Italy)
&lt;br&gt;John P. Gallagher (Roskilde University, Denmark)
&lt;br&gt;Maria Garcia de la Banda (Monash University, Australia)
&lt;br&gt;Michael Hanus (University of Kiel, Germany)
&lt;br&gt;Atsushi Igarashi (Kyoto University, Japan)
&lt;br&gt;Patricia Johann (Rutgers University, USA)
&lt;br&gt;Shin-ya Katsumata (Kyoto University, Japan)
&lt;br&gt;Michael Leuschel (University of Dusseldorf, Germany)
&lt;br&gt;Francisco Lopez-Fraguas (Complutense University of Madrid, Spain)
&lt;br&gt;Paqui Lucio (University of the Basque Country, Spain)
&lt;br&gt;Yasuhiko Minamide (University of Tsukuba, Japan)
&lt;br&gt;Frank Pfenning (Carnegie Mellon University, USA)
&lt;br&gt;Francois Pottier (INRIA, France)
&lt;br&gt;Tom Schrijvers (Katholieke Universiteit Leuven, Belgium)
&lt;br&gt;Chung-chieh &amp;quot;Ken&amp;quot; Shan (Rutgers University, USA)
&lt;br&gt;Zhong Shao (Yale University, USA)
&lt;br&gt;Jan-Georg Smaus (University of Freiburg, Germany)
&lt;br&gt;Nobuko Yoshida (Imperial College London, UK)
&lt;br&gt;&lt;br&gt;LOCAL CHAIR
&lt;br&gt;&lt;br&gt;Eijiro Sumii (Tohoku University, Sendai, Japan)
&lt;br&gt;&lt;br&gt;SUBMISSION
&lt;br&gt;&lt;br&gt;Submissions must be unpublished and not submitted for publication
&lt;br&gt;elsewhere. Work that already appeared in unpublished or informally
&lt;br&gt;published workshops proceedings may be submitted. Submissions should
&lt;br&gt;fall into one of the following categories:
&lt;br&gt;&lt;br&gt;Regular research papers: they should describe new results and will
&lt;br&gt;be judged on originality, correctness, and significance.
&lt;br&gt;&lt;br&gt;System descriptions: they should contain a link to a working
&lt;br&gt;system and will be judged on originality, usefulness, and design.
&lt;br&gt;&lt;br&gt;All submissions must be written in English and can be up to 15
&lt;br&gt;proceedings pages long. Authors are strongly encouraged to use
&lt;br&gt;LaTeX2e and the Springer llncs class file, available at
&lt;br&gt;&lt;a href=&quot;http://www.springer.de/comp/lncs/authors.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.springer.de/comp/lncs/authors.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;Regular research papers should be supported by proofs and/or
&lt;br&gt;experimental results. &amp;nbsp;In case of lack of space, this supporting
&lt;br&gt;information should be made accessible otherwise (e.g., a link to a
&lt;br&gt;web page, or an appendix). Papers should be submitted electronically
&lt;br&gt;at &lt;a href=&quot;http://www.easychair.org/conferences/?conf=flops2010&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/conferences/?conf=flops2010&lt;/a&gt;&lt;br&gt;&lt;br&gt;IMPORTANT DATES
&lt;br&gt;&lt;br&gt;Submission deadlines:
&lt;br&gt;- Abstract: October 16, 2009
&lt;br&gt;- Paper: &amp;nbsp; &amp;nbsp;October 23, 2009
&lt;br&gt;Author notification: December 21, 2009
&lt;br&gt;Camera-ready copy: January 24, 2010
&lt;br&gt;Conference: April 19-21, 2010
&lt;br&gt;&lt;br&gt;PLACE
&lt;br&gt;&lt;br&gt;Sendai, Japan
&lt;br&gt;&lt;br&gt;Some previous FLOPS:
&lt;br&gt;&lt;br&gt;FLOPS 2008, Ise: &lt;a href=&quot;http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/&lt;/a&gt;&lt;br&gt;FLOPS 2006, Fuji Susono: &lt;a href=&quot;http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/&lt;/a&gt;&lt;br&gt;FLOPS 2004, Nara
&lt;br&gt;FLOPS 2002, Aizu: &lt;a href=&quot;http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/&lt;/a&gt;&lt;br&gt;FLOPS 2001, Tokyo: &lt;a href=&quot;http://www.ueda.info.waseda.ac.jp/flops2001/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.ueda.info.waseda.ac.jp/flops2001/&lt;/a&gt;&lt;br&gt;&lt;br&gt;SPONSOR
&lt;br&gt;&lt;br&gt;JSSST SIG-PPL
&lt;br&gt;&lt;br&gt;IN COOPERATION with
&lt;br&gt;&lt;br&gt;AAFS (Asian Association for Foundation of Software)
&lt;br&gt;ACM SIGPLAN
&lt;br&gt;ALP (Association for Logic Programming)
&lt;br&gt;&lt;br&gt;----------------------------------------------------------------------------
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25730392&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/***-FLOPS-2010%3A-Last-Call-for-Papers-***-tp25730392p25730392.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25716469</id>
	<title>RuleML-2009 Call for Participation</title>
	<published>2009-10-01T09:48:30Z</published>
	<updated>2009-10-01T09:48:30Z</updated>
	<author>
		<name>Adrian Paschke</name>
	</author>
	<content type="html">---------------------------------------------------------------------------
&lt;br&gt;Want to learn more about rule technologies, applications and standards?
&lt;br&gt;Want to discuss latest research results and developments?
&lt;br&gt;Want to get in touch with the industry and research experts in rule-based
&lt;br&gt;systems and technologies?
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Don't miss RuleML-2009
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://2009.ruleml.org/registration&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://2009.ruleml.org/registration&lt;/a&gt;&lt;br&gt;---------------------------------------------------------------------------
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; RuleML 2009
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;3rd International Symposium on Rules, Applications and Interoperability
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;November 5-7 2009, Las Vegas, Nevada, USA
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://2009.ruleml.org/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://2009.ruleml.org/&lt;/a&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; co-located with the 12th Business Rules Forum
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;----------------------------
&lt;br&gt;&lt;br&gt;We cordially invite you to participate in the 3rd International Symposium on
&lt;br&gt;Rules, Applications and Interoperability (RuleML-2009) - the premier event
&lt;br&gt;addressing research, applications and standards for rule technologies and
&lt;br&gt;rule-based event processing technologies. It takes place in Las Vegas,
&lt;br&gt;Nevada, USA, Nov. 5-7, collocated with the 12th Business Rules Forum, the
&lt;br&gt;world's largest Business Rules event.
&lt;br&gt;&lt;br&gt;RuleML-2009 has evolved from an annual series of international workshops
&lt;br&gt;since 2002, international conferences in 2005 and 2006, and international
&lt;br&gt;RuleML Symposia since 2007, to the premier event on rule-based systems
&lt;br&gt;addressing industry developments, standards and academic research at the
&lt;br&gt;same time. RuleML-2009 is in the top 100 venues for impact factor (71):
&lt;br&gt;&lt;a href=&quot;http://citeseerx.ist.psu.edu/stats/venues&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://citeseerx.ist.psu.edu/stats/venues&lt;/a&gt;. It is supported by W3C, OMG, ACM,
&lt;br&gt;EPTS, AAAI, ECCAI, IAAIL, ACM, Belgian Business Rules Forum, MIT Sloan CIO
&lt;br&gt;Symposium, BPM Forum Belgium and a listed EU ICT technology conference.
&lt;br&gt;&lt;br&gt;We are building an excellent program with renowned experts as keynote
&lt;br&gt;speakers, tutorials, standards panel sessions, Open Source Day, W3C RIF
&lt;br&gt;workshop, Int. Rule Challenge with prestigious prizes, etc.
&lt;br&gt;&lt;br&gt;MAKE RULEML-2009 YOUR SHOWCASE!
&lt;br&gt;&lt;br&gt;Submit to the 3rd Int. Rule Challenge at &lt;a href=&quot;http://2009.ruleml.org/challenge&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://2009.ruleml.org/challenge&lt;/a&gt;&lt;br&gt;&amp;nbsp;
&lt;br&gt;&lt;br&gt;*******************************************************************
&lt;br&gt;RuleML-2009 highlights and news:
&lt;br&gt;&lt;br&gt;* 3rd Int. Rule Challenge
&lt;br&gt;&lt;br&gt;&amp;quot;Demonstration of benchmarks/evaluations, demos, case studies / use
&lt;br&gt;cases, experience reports, best practice solutions, rule-based
&lt;br&gt;implementations/ tools/ applications, demonstrations engineering methods,
&lt;br&gt;implementations of rule standards&amp;quot;
&lt;br&gt;&lt;br&gt;* Rule Open Source Day 
&lt;br&gt;&lt;br&gt;&amp;quot;Discover how Open Source Rules solutions are being deployed in the
&lt;br&gt;marketplace and how they compare to proprietary solutions&amp;quot;
&lt;br&gt;&lt;br&gt;* Lunch Panel on Standards for Business Rules 
&lt;br&gt;&lt;br&gt;&amp;quot;Want to learn more about latest business rules standard in W3C, OMG, OASIS,
&lt;br&gt;ISO, RuleML and how these apply in the enterprise business arena&amp;quot;
&lt;br&gt;&lt;br&gt;* W3C Rule Interchange Format Standard Workshop
&lt;br&gt;&lt;br&gt;* Keynotes and special talks by &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;
&lt;br&gt;&amp;nbsp; &amp;nbsp;Sandro Hawke (W3C) about W3C RIF &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;&amp;nbsp; &amp;nbsp;Donald Chapin (OMG) about OMG SBVR and ISO Terminology standards
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Paul Vincent (TIBCO) about CEP and Rules &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;&amp;nbsp; &amp;nbsp;Jans Aasman (FranzInc. CEO) &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;
&lt;br&gt;&lt;br&gt;* Tutorials by &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;&amp;nbsp; &amp;nbsp;Mark Proctor (Drools) - Drools Tutorial &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;
&lt;br&gt;&amp;nbsp; &amp;nbsp;Christian Saint Marie (ILog/IBM) - W3C RIF Tutorial &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;
&lt;br&gt;&amp;nbsp; &amp;nbsp;Larry Goldberg and Babara von Halle - Decision Management &amp;nbsp; &amp;nbsp; &amp;nbsp;
&lt;br&gt;&amp;nbsp; &amp;nbsp;Guido Governatori (NICTA) - Business Process Compliance 
&lt;br&gt;&lt;br&gt;* Tracks on 
&lt;br&gt;&amp;nbsp; &amp;nbsp;Rule-based Event Processing
&lt;br&gt;&amp;nbsp; &amp;nbsp;Rule Systems on the Web &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;&amp;nbsp; &amp;nbsp;Rule Transformation and Extraction
&lt;br&gt;&amp;nbsp; &amp;nbsp;Process and Data
&lt;br&gt;&amp;nbsp; &amp;nbsp;Rules and Norms
&lt;br&gt;&amp;nbsp; &amp;nbsp;Rules and Uncertainty
&lt;br&gt;&lt;br&gt;* RuleML-2009 Springer LNCS proceedings published
&lt;br&gt;* 3rd Rule Challenge CEUR proceedings to appear
&lt;br&gt;* IEEE TKDE special issue on Rule technologies to appear Dec. 2009
&lt;br&gt;* Forthcoming RuleML-2009 special journal issue &amp;nbsp;
&lt;br&gt;*******************************************************************
&lt;br&gt;&lt;br&gt;&lt;br&gt;Supported by
&lt;br&gt;===================================================================
&lt;br&gt;W3C, OMG, ACM, AAAI, ECCAI, IAAIL, ACM, Belgian Business Rules Forum
&lt;br&gt;MIT Sloan CIO Symposium, EPTS, BPM Forum Belgium
&lt;br&gt;&lt;br&gt;Sponsored by
&lt;br&gt;===================================================================
&lt;br&gt;&lt;br&gt;BBN Technologies
&lt;br&gt;Franz Inc
&lt;br&gt;NICTA (National ICT Australia) Ltd
&lt;br&gt;Corporate Semantic Web
&lt;br&gt;Logic Programming Associated Ltd
&lt;br&gt;ruleCore
&lt;br&gt;JBoss RedHat
&lt;br&gt;Modelsystems Ltd
&lt;br&gt;&lt;br&gt;(sponsoring opportunities: &lt;a href=&quot;http://2009.ruleml.org/sponsors&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://2009.ruleml.org/sponsors&lt;/a&gt;)
&lt;br&gt;===================================================================
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25716469&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/RR-2009-Call-for-Participation-tp25698943p25716469.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25716402</id>
	<title>FIRST PhD Autumn School on Modal Logic</title>
	<published>2009-10-01T05:38:15Z</published>
	<updated>2009-10-01T05:38:15Z</updated>
	<author>
		<name>Thomas Bolander</name>
	</author>
	<content type="html">&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Call for Participation
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;FIRST PhD Autumn School on Modal Logic
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; IT University of Copenhagen, Denmark
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; November 10-11 2009
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;lt;&lt;a href=&quot;http://hylocore.ruc.dk/m4m6school.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://hylocore.ruc.dk/m4m6school.html&lt;/a&gt;&amp;gt;
&lt;br&gt;&lt;br&gt;&lt;br&gt;The goal of the Autumn School on Modal Logic is to prepare PhD
&lt;br&gt;students and other researchers for participation in the sixth workshop
&lt;br&gt;Methods for Modalities (M4M-6) which takes place November 12-14 2009
&lt;br&gt;in Copenhagen. The workshop Methods for Modalities aims to bring
&lt;br&gt;together researchers interested in developing proof tools and decision
&lt;br&gt;methods based on modal logics. Here the term &amp;quot;modal logics&amp;quot; is
&lt;br&gt;conceived broadly, including description logic, guarded fragments,
&lt;br&gt;conditional logic, temporal and hybrid logic, etc. The first M4M
&lt;br&gt;workshop took place in Amsterdam in 1999. Since then, M4M workshops
&lt;br&gt;have taken place in 2001 (Amsterdam), 2003 (Nancy), 2005 (Berlin), and
&lt;br&gt;2007 (Paris). See
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;lt;&lt;a href=&quot;http://m4m.loria.fr&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://m4m.loria.fr&lt;/a&gt;&amp;gt; &amp;nbsp; &amp;nbsp; &amp;nbsp;
&lt;br&gt;&lt;br&gt;for more information on the workshop series, in particular, see why
&lt;br&gt;modal logic is important for computer science. A goal of having M4M
&lt;br&gt;in Denmark is to strengthen Danish research in reasoning methods for
&lt;br&gt;modal logics, which is a growing area of foundational and increasingly
&lt;br&gt;computational importance.
&lt;br&gt;&lt;br&gt;The Autumn School on Modal Logic is open to anyone interested. The
&lt;br&gt;intended participants will have a general background in theoretical
&lt;br&gt;computer science, but wish to obtain more concrete knowledge on modal
&lt;br&gt;logic and its computational aspects. Besides a working knowledge of
&lt;br&gt;English, prerequisites are a basic knowledge of logic and mathematics
&lt;br&gt;that is usually covered in undergraduate classes on discrete
&lt;br&gt;mathematics.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Lecturers and topics:
&lt;br&gt;&lt;br&gt;Computational Modal Logic
&lt;br&gt;Carlos Areces and Patrick Blackburn, INRIA, Nancy
&lt;br&gt;&lt;br&gt;Temporal Logics for Specification and Verification
&lt;br&gt;Valentin Goranko, Technical University of Denmark
&lt;br&gt;&lt;br&gt;The Judgmental Reconstruction of Modal Logic
&lt;br&gt;Carsten Schürmann, IT University of Copenhagen
&lt;br&gt;&lt;br&gt;Resolution-Based Theorem Proving for Modal and Description Logic
&lt;br&gt;Renate Schmidt, University of Manchester
&lt;br&gt;&lt;br&gt;Hybrid Deduction
&lt;br&gt;Patrick Blackburn, INRIA, Nancy
&lt;br&gt;&lt;br&gt;&lt;br&gt;Time and place:
&lt;br&gt;&lt;br&gt;The Fall school will take place at the IT University of Copenhagen
&lt;br&gt;November 10 and 11 2009.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Registration:
&lt;br&gt;&lt;br&gt;The registration deadline for the Autumn school is
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;*** Friday, October 23 2009 &amp;nbsp;***
&lt;br&gt;&lt;br&gt;Please register here: &lt;a href=&quot;http://hylocore.ruc.dk/m4m6registration.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://hylocore.ruc.dk/m4m6registration.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;FIRST PhD students participate free of charge.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Organization:
&lt;br&gt;&lt;br&gt;Thomas Bolander, Technical University of Denmark
&lt;br&gt;Torben Braüner, Roskilde University
&lt;br&gt;Carsten Schürmann, IT University of Copenhagen
&lt;br&gt;&lt;br&gt;Torben Braüner (&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25716402&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;torben@...&lt;/a&gt;) is main organizer of the school and
&lt;br&gt;can be contacted for more information. The Autumn School on Modal Logic
&lt;br&gt;is supported by the FIRST Research School (&lt;a href=&quot;http://first.dk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://first.dk&lt;/a&gt;) and the
&lt;br&gt;research project HYLOCORE (&lt;a href=&quot;http://hylocore.ruc.dk&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://hylocore.ruc.dk&lt;/a&gt;).
&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25716402&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/FIRST-PhD-Autumn-School-on-Modal-Logic-tp25716402p25716402.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25698943</id>
	<title>RR 2009 Call for Participation</title>
	<published>2009-09-30T16:16:27Z</published>
	<updated>2009-09-30T16:16:27Z</updated>
	<author>
		<name>Terrance Swift</name>
	</author>
	<content type="html">&lt;br&gt;&lt;br&gt;Apologies for multiple postings:
&lt;br&gt;&lt;br&gt;Late registration deadline approaching!
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp;			Call FOR PARTICIPATION
&lt;br&gt;&lt;br&gt;&amp;nbsp;			 &amp;nbsp; &amp;nbsp; &amp;nbsp; RR 2009
&lt;br&gt;&amp;nbsp;		The Third International Conference on
&lt;br&gt;&amp;nbsp;		 &amp;nbsp; &amp;nbsp;Web Reasoning and Rule Systems
&lt;br&gt;&amp;nbsp;		 &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://www.rr-conference.org&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.rr-conference.org&lt;/a&gt;&lt;br&gt;&lt;br&gt;You are invited to RR 2009, the major forum for discussion and
&lt;br&gt;dissemination of new results concerning Web Reasoning and Rule
&lt;br&gt;Systems. &amp;nbsp;The vast scale and the diverse nature of the Semantic Web
&lt;br&gt;presents numerous challenges for knowledge representation and
&lt;br&gt;reasoning. &amp;nbsp;Accordingly, the program features papers on practical and
&lt;br&gt;theoretical aspects of reasoning, including reasoning under
&lt;br&gt;uncertainty and inconsistency, and combining reasons with actions, as
&lt;br&gt;well as scalability and efficiency considerations. &amp;nbsp;Other papers
&lt;br&gt;explore extensions and applications of current standards and
&lt;br&gt;techniques for the Semantic Web including combining rule based systems
&lt;br&gt;with ontologies and description logics, module systems for ontologies
&lt;br&gt;and rules, ontology alignment, and path query languages.
&lt;br&gt;&lt;br&gt;Invited Talks and Tutorial
&lt;br&gt;&lt;br&gt;-- Robert Kowalski &amp;quot;Integrating Logic Programming and Production
&lt;br&gt;&amp;nbsp; &amp;nbsp; Systems with Abductive Logic Programming Agents&amp;quot;
&lt;br&gt;&lt;br&gt;-- Benjamin Grossof &amp;quot;SILK: Higher Level Rules with Defaults and
&lt;br&gt;&amp;nbsp; &amp;nbsp; Semantic Scalability&amp;quot;
&lt;br&gt;&lt;br&gt;-- Thomas Lukasiewicz &amp;quot;Uncertainty Reasoning for the Semantic Web&amp;quot;
&lt;br&gt;&lt;br&gt;The complete list of accepted papers is available at
&lt;br&gt;&lt;a href=&quot;http://www.rr-conference.org/RR2009&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.rr-conference.org/RR2009&lt;/a&gt;.
&lt;br&gt;&lt;br&gt;RR 2009 will be held near Washington, D.C. in Chantilly, Virginia
&lt;br&gt;October 25-26, 2009. &amp;nbsp;It is co-located with ISWC 09 and OWLED 2009.
&lt;br&gt;Registrants of RR 2009 may attend ISWC workshops and tutorials for
&lt;br&gt;free.
&lt;br&gt;&lt;br&gt;Further registration information can be found at
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;https://ww2.eventrebels.com/er/Registration/StepRegInfo.jsp?ActivityID=4116&amp;StepNumber=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://ww2.eventrebels.com/er/Registration/StepRegInfo.jsp?ActivityID=4116&amp;StepNumber=1&lt;/a&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25698943&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/RR-2009-Call-for-Participation-tp25698943p25698943.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25698926</id>
	<title>[fm-announcements] CFP: NASA Formal Methods Symposium 2010</title>
	<published>2009-09-30T11:40:13Z</published>
	<updated>2009-09-30T11:40:13Z</updated>
	<author>
		<name>Munoz, Cesar Augusto (LARC-D320)</name>
	</author>
	<content type="html">We apologize if you receive this message more than once. Please circulate
&lt;br&gt;the information among your colleagues and students.
&lt;br&gt;&lt;br&gt;--------------------------------------------------
&lt;br&gt;CALL FOR PAPERS: 2nd NASA Formal Methods Symposium
&lt;br&gt;--------------------------------------------------
&lt;br&gt;&lt;br&gt;The NASA Formal Methods community invites you to submit a paper to:
&lt;br&gt;&lt;br&gt;The Second NASA Formal Methods Symposium (NFM 2010)
&lt;br&gt;&lt;a href=&quot;http://shemesh.larc.nasa.gov/NFM2010&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://shemesh.larc.nasa.gov/NFM2010&lt;/a&gt;&lt;br&gt;&lt;br&gt;April 13-15, 2010
&lt;br&gt;Washington D.C.
&lt;br&gt;&lt;br&gt;--------------------------------------------------
&lt;br&gt;Important Dates:
&lt;br&gt;--------------------------------------------------
&lt;br&gt;&amp;nbsp;
&lt;br&gt;Submission (abstract): January 8, 2010
&lt;br&gt;Submission (final): January 15, 2010
&lt;br&gt;Notification: February 26, 2010
&lt;br&gt;Final version: March 19, 2010
&lt;br&gt;&lt;br&gt;--------------------------------------------------
&lt;br&gt;Theme of Conference:
&lt;br&gt;--------------------------------------------------
&lt;br&gt;&lt;br&gt;The NASA Formal Methods Symposium is a forum for theoreticians and
&lt;br&gt;practitioners from academia and industry, with the goals of identifying
&lt;br&gt;challenges and providing solutions to achieving assurance in safety-critical
&lt;br&gt;systems. Within NASA, for example, such systems include autonomous robots,
&lt;br&gt;separation assurance algorithms for aircraft, and autonomous rendezvous and
&lt;br&gt;docking for spacecraft. Moreover, emerging paradigms such as code generation
&lt;br&gt;and safety cases are bringing with them new challenges and opportunities.
&lt;br&gt;The focus of the symposium will be on formal techniques, their theory,
&lt;br&gt;current capabilities, and limitations, as well as their application to
&lt;br&gt;aerospace, robotics, and other safety-critical systems. The symposium aims
&lt;br&gt;to introduce researchers, graduate students, and partners in industry to
&lt;br&gt;those topics that are of interest, to survey current research, and to
&lt;br&gt;identify unsolved problems and directions for future research.
&lt;br&gt;&lt;br&gt;NFM 2010 is the second edition of the NASA Formal Methods Symposium, which
&lt;br&gt;started in 2009 and was organized by NASA Ames Research Center in Moffet
&lt;br&gt;Field, California. The symposium originated from the earlier Langley Formal
&lt;br&gt;Methods Workshop series and aims to foster collaboration between NASA
&lt;br&gt;researchers and engineers, as well as the wider aerospace, safety-critical,
&lt;br&gt;and formal methods communities.
&lt;br&gt;&lt;br&gt;--------------------------------------------------
&lt;br&gt;Topics of Interest:
&lt;br&gt;--------------------------------------------------
&lt;br&gt;&lt;br&gt;* Formal verification, including theorem proving, model checking,
&lt;br&gt;&amp;nbsp; and static analysis
&lt;br&gt;* Automated test generation and formal testing of critical systems
&lt;br&gt;* Model-based development
&lt;br&gt;* Techniques and algorithms for scaling formal methods, such as
&lt;br&gt;&amp;nbsp; abstraction and symbolic methods, compositional techniques, as well as
&lt;br&gt;&amp;nbsp; parallel and distributed techniques
&lt;br&gt;* Monitoring and run-time verification
&lt;br&gt;* Code generation from formally verified models
&lt;br&gt;* Safety cases
&lt;br&gt;* Accident/safety analysis
&lt;br&gt;* Formal approaches to fault tolerance
&lt;br&gt;* Theoretical advances and empirical evaluations of formal methods
&lt;br&gt;&amp;nbsp; techniques for safety-critical systems, including hybrid and embedded
&lt;br&gt;&amp;nbsp; systems
&lt;br&gt;* Formal methods in systems engineering
&lt;br&gt;&lt;br&gt;--------------------------------------------------
&lt;br&gt;Submissions:
&lt;br&gt;--------------------------------------------------
&lt;br&gt;&lt;br&gt;Submitted papers must be formatted in the &amp;nbsp;EasyChair class style
&lt;br&gt;(&lt;a href=&quot;http://www.easychair.org/coolnews.cgi&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/coolnews.cgi&lt;/a&gt;). &amp;nbsp;There are two categories of
&lt;br&gt;submissions (to be in NASA conference style):
&lt;br&gt;&lt;br&gt;* Regular papers describing fully developed work and complete
&lt;br&gt;&amp;nbsp; results (10 pages / 30 minute talks)
&lt;br&gt;* Short papers describing interesting work in progress and/or
&lt;br&gt;&amp;nbsp; preliminary results (5 pages / 15 minute talks)
&lt;br&gt;&lt;br&gt;All papers should describe original work that has not been published
&lt;br&gt;elsewhere. Submissions will be fully reviewed and the symposium proceedings
&lt;br&gt;will appear as a NASA Conference Publication. Authors of selected papers
&lt;br&gt;will then be invited to submit extended versions to a special issue of
&lt;br&gt;&amp;quot;Innovations in Systems and Software Engineering: a NASA Journal&amp;quot;
&lt;br&gt;(Springer).
&lt;br&gt;&lt;br&gt;Papers should be submitted through the following link:
&lt;br&gt;&lt;a href=&quot;http://www.easychair.org/conferences/?conf=nfm2010&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/conferences/?conf=nfm2010&lt;/a&gt;&lt;br&gt;&lt;br&gt;--------------------------------------------------
&lt;br&gt;For further information:
&lt;br&gt;--------------------------------------------------
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://shemesh.larc.nasa.gov/NFM2010/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://shemesh.larc.nasa.gov/NFM2010/&lt;/a&gt;&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25698926&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;nfm2010@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;Mike Hinchey
&lt;br&gt;NFM 2010 Conference Chair
&lt;br&gt;&lt;br&gt;Cesar Munoz
&lt;br&gt;NFM 2010 Program Chair
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25698926&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/-fm-announcements--CFP%3A-NASA-Formal-Methods-Symposium-2010-tp25698926p25698926.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25645782</id>
	<title>INAP 2009: CALL FOR PARTICIPATION</title>
	<published>2009-09-28T03:19:48Z</published>
	<updated>2009-09-28T03:19:48Z</updated>
	<author>
		<name>INAP 2009</name>
	</author>
	<content type="html">&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; --- CALL FOR PARTICIPATION ---
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; INAP 2009
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;18th International Conference on
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Applications of Declarative Programming
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;and Knowledge Management
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; November 5-7, 2009
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Evora, Portugal
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://www.di.uevora.pt/inap2009/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.di.uevora.pt/inap2009/&lt;/a&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://inap.dialogengines.com/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://inap.dialogengines.com/&lt;/a&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Organized by the Portuguese AI Society (APPIA), the INAP Committee
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;and the Society of Logic Programming (GLP e.V.)
&lt;br&gt;&lt;br&gt;== Registration ==
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Registration is now open; see details on the web site. &amp;nbsp;Early
&lt;br&gt;&amp;nbsp; &amp;nbsp;registration is available until October 15, 2009.
&lt;br&gt;&lt;br&gt;== INAP 2009 ==
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;INAP is a communicative and dense forum for intensive discussion of
&lt;br&gt;&amp;nbsp; &amp;nbsp;applications of important technologies related to Logic and
&lt;br&gt;&amp;nbsp; &amp;nbsp;Constraint Programming as well as closely related advanced software.
&lt;br&gt;&amp;nbsp; &amp;nbsp;It comprehensively covers the impact of declarative programming
&lt;br&gt;&amp;nbsp; &amp;nbsp;methods and tools in the Internet Society, its underlying
&lt;br&gt;&amp;nbsp; &amp;nbsp;technologies, and leading edge applications in industry, commerce,
&lt;br&gt;&amp;nbsp; &amp;nbsp;government, and societal services.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;INAP 2009 continues a tradition of successful workshops cast around
&lt;br&gt;&amp;nbsp; &amp;nbsp;the applications of declarative programming, which were held in Kobe
&lt;br&gt;&amp;nbsp; &amp;nbsp;(1997), Tokyo (1995, 1996, 1998 - 2001), Potsdam (2004), Fukuoka
&lt;br&gt;&amp;nbsp; &amp;nbsp;(2005) and Wuerzburg (2007).
&lt;br&gt;&lt;br&gt;== Workshop Program ==
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Besides the regular presentations, the conference will host invited
&lt;br&gt;&amp;nbsp; &amp;nbsp;talks by Antonio Porto and Terrance Swift. &amp;nbsp;The provisional program,
&lt;br&gt;&amp;nbsp; &amp;nbsp;including the list of accepted papers may be consulted on the web at
&lt;br&gt;&amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://www.di.uevora.pt/inap2009/program-0.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.di.uevora.pt/inap2009/program-0.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;Hotel and travel information is available on the web site as well.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Looking forward to see you at the conference!
&lt;br&gt;&lt;br&gt;Dietmar Seipel and Salvador Abreu
&lt;br&gt;Conference Chairs, INAP 2009
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25645782&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/INAP-2009%3A-CALL-FOR-PARTICIPATION-tp25645782p25645782.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25625151</id>
	<title>CMCS 2010 Pre-announcement/call for papers</title>
	<published>2009-09-25T05:09:29Z</published>
	<updated>2009-09-25T05:09:29Z</updated>
	<author>
		<name>Alexandra Silva-2</name>
	</author>
	<content type="html">&lt;br&gt;[- apologies for multiple copies -]
&lt;br&gt;------------------------------------------------------
&lt;br&gt;CMCS 2010 Pre-announcement/call for papers
&lt;br&gt;------------------------------------------------------
&lt;br&gt;&lt;br&gt;The Tenth International Workshop on Coalgebraic Methods in Computer Science
&lt;br&gt;26-28 March 2010, Cyprus, Greece (co-located with ETAPS 2010)
&lt;br&gt;&lt;br&gt;Webpage
&lt;br&gt;-----------
&lt;br&gt;&lt;a href=&quot;http://event.cwi.nl/cmcs10/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://event.cwi.nl/cmcs10/&lt;/a&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;Contact
&lt;br&gt;----------
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25625151&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;cmcs10@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;&lt;br&gt;Aims and scope
&lt;br&gt;------------------
&lt;br&gt;&lt;br&gt;The aim of the workshop is to bring together researchers
&lt;br&gt;with a common interest in the theory of coalgebras and its applications.
&lt;br&gt;Over the last two decades, coalgebra has developed into a field of
&lt;br&gt;its own, presenting a mathematical foundation for various kinds
&lt;br&gt;of dynamical systems, infinite data structures, and logics.
&lt;br&gt;Coalgebra has an ever growing range of applications in and interactions
&lt;br&gt;with other fields such as reactive and interactive system theory,
&lt;br&gt;object oriented and concurrent programming, formal system specification,
&lt;br&gt;modal logic, dynamical systems, control systems, category theory,
&lt;br&gt;algebra, analysis, etc.
&lt;br&gt;&lt;br&gt;An anniversary: the 10th CMCS
&lt;br&gt;----------------------------------------
&lt;br&gt;&lt;br&gt;CMCS took place for the first time when ETAPS started, in 1998.
&lt;br&gt;Since then, it has always been collocated with ETAPS, becoming
&lt;br&gt;bi-annual since the start of CALCO (Conference on Algebra and Coalgebra)
&lt;br&gt;in 2005.
&lt;br&gt;&lt;br&gt;In 2010, we will celebrate the 10th edition of CMCS,
&lt;br&gt;by inviting a number of specialists in the field to present overviews
&lt;br&gt;of both obtained results and future challenges.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Programme Committee
&lt;br&gt;--------------------- -----
&lt;br&gt;Chairs: Bart Jacobs (RUN) and Jan Rutten (CWI, VUA, RUN).
&lt;br&gt;Members: to be announced shortly.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Organising Committee
&lt;br&gt;--------------------------
&lt;br&gt;&lt;br&gt;Bart Jacobs,
&lt;br&gt;Milad Niqui (co-chair, CWI),
&lt;br&gt;Jan Rutten, 
&lt;br&gt;Alexandra Silva (co-chair, CWI).
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;Submissions
&lt;br&gt;--------------
&lt;br&gt;There are two types of submissions possible: 
&lt;br&gt;&lt;br&gt;(a) Papers to be evaluated by the PC for publication in the proceedings:
&lt;br&gt;They must have a length no greater than 20 pages.
&lt;br&gt;(Style files will be provided shortly.)
&lt;br&gt;&lt;br&gt;They must contain original contributions,
&lt;br&gt;be clearly written, and include appropriate reference to and comparison 
&lt;br&gt;with related work. &amp;nbsp;
&lt;br&gt;Accepted papers will appear in either ENTCS or EPTCS.
&lt;br&gt;&lt;br&gt;Also a special journal issue of selected papers will be considered.
&lt;br&gt;&lt;br&gt;(b) Short contributions:
&lt;br&gt;These will not be published in the proceedings
&lt;br&gt;but will be bundled in a CWI technical report.
&lt;br&gt;&lt;br&gt;They should be no more than two pages and may describe work in progress,
&lt;br&gt;summarise work submitted to a conference or workshop elsewhere,
&lt;br&gt;or in some other way appeal to the CMCS audience.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Important dates
&lt;br&gt;-------------------
&lt;br&gt;&amp;nbsp; &amp;nbsp;* &amp;nbsp;8 January 2010: strict submission deadline regular papers
&lt;br&gt;&amp;nbsp; &amp;nbsp;* 13 February 2010: notification regular papers
&lt;br&gt;&amp;nbsp; &amp;nbsp;* 15 February 2010: deadline early registration
&lt;br&gt;&amp;nbsp; &amp;nbsp;* 20 February 2010: final version
&lt;br&gt;&amp;nbsp; &amp;nbsp;* 27 February 2010: strict submission deadline short contributions
&lt;br&gt;&amp;nbsp; &amp;nbsp;* 6 March 2010: notification short contributions
&lt;br&gt;&amp;nbsp; &amp;nbsp;* 26-28 March 2010: the workshop
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25625151&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/CMCS-2010-Pre-announcement-call-for-papers-tp25625151p25625151.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25606079</id>
	<title>DAMP 2010 - Extended Deadline [September 27th]</title>
	<published>2009-09-23T07:50:31Z</published>
	<updated>2009-09-23T07:50:31Z</updated>
	<author>
		<name>Enrico Pontelli</name>
	</author>
	<content type="html">&lt;html xmlns:v=&quot;urn:schemas-microsoft-com:vml&quot; xmlns:o=&quot;urn:schemas-microsoft-com:office:office&quot; xmlns:w=&quot;urn:schemas-microsoft-com:office:word&quot; xmlns:m=&quot;http://schemas.microsoft.com/office/2004/12/omml&quot; xmlns=&quot;http://www.w3.org/TR/REC-html40&quot;&gt;

&lt;head&gt;
&lt;meta http-equiv=Content-Type content=&quot;text/html; charset=us-ascii&quot;&gt;
&lt;meta name=Generator content=&quot;Microsoft Word 12 (filtered medium)&quot;&gt;

&lt;!--[if gte mso 9]&gt;&lt;xml&gt;
 &lt;o:shapedefaults v:ext=&quot;edit&quot; spidmax=&quot;1026&quot; /&gt;
&lt;/xml&gt;&lt;![endif]--&gt;&lt;!--[if gte mso 9]&gt;&lt;xml&gt;
 &lt;o:shapelayout v:ext=&quot;edit&quot;&gt;
  &lt;o:idmap v:ext=&quot;edit&quot; data=&quot;1&quot; /&gt;
 &lt;/o:shapelayout&gt;&lt;/xml&gt;&lt;![endif]--&gt;
&lt;/head&gt;

&lt;body lang=EN-US link=blue vlink=purple&gt;

&lt;div class=Section1&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
DAMP 2010: Workshop on&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
Declarative Aspects of Multicore Programming&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
Madrid, SPAIN&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
(colocated with POPL 2010)&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
January, 2010&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
damp10.cs.nmsu.edu&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;----------------------------------------------------------------------&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Extended
DEADLINE: SEPTEMBER 27, 2009&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;----------------------------------------------------------------------&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;The&amp;nbsp; advent&amp;nbsp; of multicore architectures&amp;nbsp; has
profoundly&amp;nbsp; increased the &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;importance of research&amp;nbsp; in parallel&amp;nbsp; computing.
Modern&amp;nbsp; platforms&amp;nbsp; are &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;becoming more complex and heterogenous and novel
solutions&amp;nbsp; are needed&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;to account for their peculiarities.&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;Multicore&amp;nbsp; architectures will&amp;nbsp; differ in&amp;nbsp;
significant ways&amp;nbsp; from their&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;multisocket&amp;nbsp; predecessors. For example,&amp;nbsp; the
communication&amp;nbsp; to compute&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;bandwidth ratio is&amp;nbsp; likely to be higher, which&amp;nbsp;
will positively impact&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;performance. More generally, multicore architectures
introduce several&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;new&amp;nbsp; dimensions&amp;nbsp; of variability&amp;nbsp; in&amp;nbsp;
both&amp;nbsp; performance guarantees&amp;nbsp; and&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;architectural&amp;nbsp; contracts,&amp;nbsp; such as&amp;nbsp; the&amp;nbsp;
memory&amp;nbsp; model,&amp;nbsp; that may&amp;nbsp; not&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;stabilize for several generations of product.&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;Programs&amp;nbsp; written&amp;nbsp; in&amp;nbsp; functional&amp;nbsp;
or&amp;nbsp; (constraint-)logic&amp;nbsp; programming&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;languages, or in other highly declarative languages&amp;nbsp;
with a controlled&amp;nbsp; &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;use of side effects, can&amp;nbsp; greatly simplify
parallel&amp;nbsp; programming. Such &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;declarative programming&amp;nbsp; allows&amp;nbsp; for&amp;nbsp; a&amp;nbsp;
deterministic semantics&amp;nbsp; even&amp;nbsp; &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;when&amp;nbsp; the underlying implementation might be highly
non-deterministic.&amp;nbsp; &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;In addition to simplifying programming this can simplify
debugging and&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;analyzing correctness.&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;DAMP 2010 is the&amp;nbsp; fifth in&amp;nbsp; a series of&amp;nbsp;
one-day&amp;nbsp; workshops seeking to &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;explore&amp;nbsp; ideas in&amp;nbsp; declarative&amp;nbsp;
programming&amp;nbsp; language design that will &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;greatly&amp;nbsp; simplify programming for&amp;nbsp; multicore&amp;nbsp;
architectures, and&amp;nbsp; more &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;generally&amp;nbsp; for tightly&amp;nbsp; coupled parallel&amp;nbsp;
architectures.&amp;nbsp; The emphasis &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;will&amp;nbsp; be&amp;nbsp; on (constraint-)logic and&amp;nbsp;
functional&amp;nbsp; programming, but&amp;nbsp; any &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;declarative programming language ideas that aim to raise the
level of &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;abstraction are welcome. DAMP seeks to gather together
researchers in &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;declarative approaches to parallel programming and to foster
cross &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;fertilization across different approaches.&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;Specific topics include, but are not limited to: &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* investigation&amp;nbsp; of applications&amp;nbsp; of
logic,&amp;nbsp; constraint logic, and &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; functional programing to multicore programing&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* run-time issues of exploitation of parallelism using
declarative &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; programming approaches (e.g., garbage
collection, scheduling)&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* architectural&amp;nbsp;&amp;nbsp; impact&amp;nbsp; on&amp;nbsp;
exploitation&amp;nbsp; of&amp;nbsp; parallelism&amp;nbsp;&amp;nbsp; from &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; declarative languages&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* type systems and analysis for accurately detecting
dependencies, &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; aliasing, side effects, and impure features&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* language level declarative constructs for expressing
parallelism&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* declarative language&amp;nbsp; specification for&amp;nbsp; the
description of data &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; placement and distribution&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* compilation&amp;nbsp;&amp;nbsp; and&amp;nbsp;&amp;nbsp; static
analysis&amp;nbsp;&amp;nbsp; techniques&amp;nbsp;&amp;nbsp; to&amp;nbsp;&amp;nbsp;&amp;nbsp; support &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; exploitation&amp;nbsp; of&amp;nbsp; parallelism from
declarative&amp;nbsp; languages (e.g., &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; granularity control)&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* practical&amp;nbsp; experiences&amp;nbsp; and&amp;nbsp; challenges&amp;nbsp;
arising&amp;nbsp; from&amp;nbsp; parallel &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; declarative programming&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* technology for debugging parallel programs&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;* design&amp;nbsp; and&amp;nbsp;&amp;nbsp;
implementation&amp;nbsp;&amp;nbsp; of&amp;nbsp; domain-specific&amp;nbsp;&amp;nbsp; declarative &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; languages for multicore programming&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;Submission:&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Submitted&amp;nbsp; papers&amp;nbsp; papers&amp;nbsp;
should&amp;nbsp; not&amp;nbsp; exceed&amp;nbsp; 10&amp;nbsp; pages&amp;nbsp; in ACM&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; SIGPLAN conference format. Submission is electronic
via:&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; http://www.easychair.org/conferences/?conf=damp10&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Accepted papers will be published in the ACM
Digital&amp;nbsp; Library and &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; in a physical&amp;nbsp; proceedings.&amp;nbsp; Papers
must&amp;nbsp; adhere to&amp;nbsp; the&amp;nbsp; SIGPLAN &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Republication Policy:&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
http://www.sigplan.org/republicationpolicy.htm&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Concurrent submissions to other conferences,&amp;nbsp;
workshops, journals, &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; or similar forums of&amp;nbsp; publication are&amp;nbsp; not
allowed.&amp;nbsp; However, DAMP &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; is&amp;nbsp;&amp;nbsp; intended to&amp;nbsp; be&amp;nbsp; a&amp;nbsp;
venue for&amp;nbsp; discussion and&amp;nbsp; exploration of &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; works-in-progress, and so publication of a
paper&amp;nbsp; at DAMP&amp;nbsp; 2010 is &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; not intended to preclude later publication as
appropriate.&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Additional information&amp;nbsp; about the submission
process can be&amp;nbsp; found&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; at the conference web site.&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;Important dates:&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Paper
submission:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Sept. 27&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Notification to authors: Oct.&amp;nbsp; 26 &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Camera
ready:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
Nov.&amp;nbsp;&amp;nbsp; 9&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;Program Chair:&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Enrico Pontelli&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; New Mexico State University&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;General Chairs:&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Leaf Petersen&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Intel Corporation&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; Santa Clara, CA, USA&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;Program Committee: &lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Manuel
Carro&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Universidad
Politecnica de Madrid&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Clemens
Grelck&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; University of
Hertfordshire&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Haifeng Guo&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
University of Nebraska at Omaha&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Gabriele
Keller&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; University of New South Wales&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Hans-Wolfgang Loidl&amp;nbsp;&amp;nbsp;&amp;nbsp;
Ludwig-Maximilians-Universitat Munchen&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Leaf
Petersen&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Intel
Corporation&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; John
Reppy&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
University of Chicago&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Ricardo
Rocha&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; University of Porto&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Kostis
Sagonas&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; National Technical
University of Athens&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Vitor Santos Costa&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;
University of Porto&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Satnam
Singh&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Microsoft
Research&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp;&amp;nbsp; Philip
Trinder&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Heriot-Watt University&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; &amp;nbsp;Pascal Van Hentenryck&amp;nbsp; Brown University&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;URL:&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&lt;o:p&gt;&amp;nbsp;&lt;/o:p&gt;&lt;/p&gt;

&lt;p class=MsoNormal&gt;&amp;nbsp; http://damp10.cs.nmsu.edu&lt;o:p&gt;&lt;/o:p&gt;&lt;/p&gt;

&lt;/div&gt;

&lt;/body&gt;

&lt;/html&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25606079&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/DAMP-2010---Extended-Deadline--September-27th--tp25606079p25606079.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25577858</id>
	<title>Verification and Debug at HLDVT</title>
	<published>2009-09-22T22:34:20Z</published>
	<updated>2009-09-22T22:34:20Z</updated>
	<author>
		<name>Shireesh Verma</name>
	</author>
	<content type="html">&lt;div&gt;&lt;br&gt;&lt;/div&gt;&lt;div&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;mso-pagination:none;tab-stops:
28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Learn about recent advances in verification
and debug at&lt;/span&gt;&lt;/p&gt;&lt;/div&gt;&lt;div&gt;&lt;br&gt;&lt;/div&gt;&lt;img src=&quot;webkit-fake-url://2510B76B-93A3-4F06-87DD-11105C9E8E11/application.pdf&quot;&gt;&lt;div&gt;&lt;br&gt;&lt;/div&gt;&lt;div&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:32.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;IEEE International High Level Design&lt;/span&gt;&lt;span style=&quot;font-size:32.0pt;font-family:&amp;quot;MS Mincho&amp;quot;;mso-bidi-font-family:&amp;quot;MS Mincho&amp;quot;&quot;&gt;
&lt;/span&gt;&lt;span style=&quot;font-size:32.0pt;font-family:Arial;mso-bidi-font-family:
Arial&quot;&gt;Validation and Test Workshop 2009&lt;/span&gt;&lt;span style=&quot;font-size:13.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:13.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt; &lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;b&gt;&lt;span style=&quot;font-size:21.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;November 4-6, 2009&lt;/span&gt;&lt;/b&gt;&lt;span style=&quot;font-size:13.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;b&gt;&lt;span style=&quot;font-size:21.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Grand Hyatt, San Francisco (Union
Square)&lt;/span&gt;&lt;/b&gt;&lt;span style=&quot;font-size:13.0pt;font-family:Arial;mso-bidi-font-family:
Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Register at &lt;/span&gt;&lt;a href=&quot;http://www.hldvt.com/09/registration.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial;color:#000099&quot;&gt;http://www.hldvt.com/09/registration.html&lt;/span&gt;&lt;/a&gt;
&lt;span style=&quot;font-size:16.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;before
&lt;b&gt;October 7&lt;/b&gt;&lt;/span&gt;&lt;b&gt;&lt;sup&gt;&lt;span style=&quot;font-size:8.5pt;font-family:Arial;
mso-bidi-font-family:Arial&quot;&gt;th&lt;/span&gt;&lt;/sup&gt;&lt;/b&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt; to receive discount registration
rates.&lt;/span&gt;&lt;span style=&quot;font-size:13.0pt;font-family:Arial;mso-bidi-font-family:
Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-family:&amp;quot;Times New Roman&amp;quot;&quot;&gt; &lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;For the past 13 years, IEEE
International High Level Design Validation and Test Workshop has been a
platform for addressing emerging challenges in verification and test
methodologies for ICs and systems. &lt;/span&gt;&lt;span style=&quot;font-size:16.0pt;
mso-bidi-font-size:12.0pt;font-family:Arial&quot;&gt;The workshop is an informal forum
where EDA tool developers, academics, and industrial practitioners get together
to discuss contemporary issues in &lt;/span&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;verification, debug, synthesis,
and test.&lt;/span&gt;&lt;span style=&quot;font-size:13.0pt;font-family:Arial;mso-bidi-font-family:
Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt; &lt;/span&gt;&lt;b&gt;&lt;span style=&quot;font-size:21.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;This
year&amp;#39;s program will feature….&lt;/span&gt;&lt;/b&gt;&lt;span style=&quot;font-size:13.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoListParagraphCxSpFirst&quot; style=&quot;margin-left:29.0pt;mso-add-space:
auto;text-align:justify;text-indent:-.25in;mso-pagination:none;mso-list:l1 level1 lfo1;
tab-stops:11.0pt .5in;mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Symbol;mso-fareast-font-family:Symbol;
mso-bidi-font-family:Symbol&quot;&gt;&lt;span style=&quot;mso-list:Ignore&quot;&gt;·&lt;span style=&quot;font:7.0pt &amp;quot;Times New Roman&amp;quot;&quot;&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Keynote
Address by &lt;b style=&quot;mso-bidi-font-weight:normal&quot;&gt;&lt;i style=&quot;mso-bidi-font-style:
normal&quot;&gt;Sunil R. Shenoy&lt;/i&gt;&lt;/b&gt; - Vice President, Intel Architecture Group, and
General Manager, Microprocessor and Graphics Development - Intel Corporation &lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoListParagraphCxSpLast&quot; style=&quot;margin-left:29.0pt;mso-add-space:auto;
text-align:justify;text-indent:-.25in;mso-pagination:none;mso-list:l1 level1 lfo1;
tab-stops:11.0pt .5in;mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Symbol;mso-fareast-font-family:Symbol;
mso-bidi-font-family:Symbol&quot;&gt;&lt;span style=&quot;mso-list:Ignore&quot;&gt;·&lt;span style=&quot;font:7.0pt &amp;quot;Times New Roman&amp;quot;&quot;&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Seventeen
Regular Papers&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoListParagraph&quot; style=&quot;margin-left:29.0pt;mso-add-space:auto;
text-align:justify;text-indent:-.25in;mso-pagination:none;mso-list:l1 level1 lfo1;
tab-stops:11.0pt .5in;mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Symbol;mso-fareast-font-family:Symbol;
mso-bidi-font-family:Symbol&quot;&gt;&lt;span style=&quot;mso-list:Ignore&quot;&gt;·&lt;span style=&quot;font:7.0pt &amp;quot;Times New Roman&amp;quot;&quot;&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Panel: &lt;b&gt;&lt;i&gt;&lt;span style=&quot;color:#221E1F&quot;&gt;SystemC Why: To Design or to Verify?&lt;/span&gt;&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;


&lt;p class=&quot;MsoListParagraph&quot; style=&quot;margin-left:29.0pt;mso-add-space:auto;
text-align:justify;text-indent:-.25in;mso-pagination:none;mso-list:l1 level1 lfo1;
tab-stops:11.0pt .5in;mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Symbol;mso-fareast-font-family:Symbol;
mso-bidi-font-family:Symbol&quot;&gt;&lt;span style=&quot;mso-list:Ignore&quot;&gt;·&lt;span style=&quot;font:7.0pt &amp;quot;Times New Roman&amp;quot;&quot;&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Special
Session: &lt;b&gt;&lt;i&gt;&lt;span style=&quot;color:#221E1F&quot;&gt;Innovative Industrial Practices&lt;/span&gt;&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoListParagraph&quot; style=&quot;margin-left:29.0pt;mso-add-space:auto;
text-align:justify;text-indent:-.25in;mso-pagination:none;mso-list:l1 level1 lfo1;
tab-stops:11.0pt .5in;mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Symbol;mso-fareast-font-family:Symbol;
mso-bidi-font-family:Symbol&quot;&gt;&lt;span style=&quot;mso-list:Ignore&quot;&gt;·&lt;span style=&quot;font:7.0pt &amp;quot;Times New Roman&amp;quot;&quot;&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Three
Invited Sessions:&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-top:12.0pt;margin-right:0in;margin-bottom:
12.0pt;margin-left:1.25in;text-align:justify;text-indent:-.25in;mso-pagination:
none;mso-list:l0 level1 lfo2;tab-stops:97.0pt 114.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:14.0pt;font-family:Symbol;mso-fareast-font-family:Symbol;
mso-bidi-font-family:Symbol&quot;&gt;&lt;span style=&quot;mso-list:Ignore&quot;&gt;·&lt;span style=&quot;font:7.0pt &amp;quot;Times New Roman&amp;quot;&quot;&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;i style=&quot;mso-bidi-font-style:normal&quot;&gt;&lt;span style=&quot;font-size:14.0pt;font-family:
Arial;mso-bidi-font-family:Arial;color:#221E1F&quot;&gt;RTL Validation and Debug&lt;/span&gt;&lt;/i&gt;&lt;i style=&quot;mso-bidi-font-style:normal&quot;&gt;&lt;span style=&quot;font-size:14.0pt;font-family:
Arial;mso-bidi-font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/i&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-top:0in;margin-right:0in;margin-bottom:12.0pt;
margin-left:1.25in;text-align:justify;text-indent:-.25in;mso-pagination:none;
mso-list:l0 level1 lfo2;tab-stops:97.0pt 114.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:14.0pt;font-family:Symbol;mso-fareast-font-family:Symbol;
mso-bidi-font-family:Symbol&quot;&gt;&lt;span style=&quot;mso-list:Ignore&quot;&gt;·&lt;span style=&quot;font:7.0pt &amp;quot;Times New Roman&amp;quot;&quot;&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;i style=&quot;mso-bidi-font-style:normal&quot;&gt;&lt;span style=&quot;font-size:14.0pt;font-family:
Arial;mso-bidi-font-family:Arial;color:#221E1F&quot;&gt;High-Level Modeling and
Validation&lt;/span&gt;&lt;/i&gt;&lt;i style=&quot;mso-bidi-font-style:normal&quot;&gt;&lt;span style=&quot;font-size:14.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/i&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-top:0in;margin-right:0in;margin-bottom:12.0pt;
margin-left:1.25in;text-align:justify;text-indent:-.25in;mso-pagination:none;
mso-list:l0 level1 lfo2;tab-stops:97.0pt 114.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:14.0pt;font-family:Symbol;mso-fareast-font-family:Symbol;
mso-bidi-font-family:Symbol&quot;&gt;&lt;span style=&quot;mso-list:Ignore&quot;&gt;·&lt;span style=&quot;font:7.0pt &amp;quot;Times New Roman&amp;quot;&quot;&gt;      &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;i style=&quot;mso-bidi-font-style:normal&quot;&gt;&lt;span style=&quot;font-size:14.0pt;font-family:
Arial;mso-bidi-font-family:Arial;color:#221E1F&quot;&gt;Post-Silicon Validation and
Debug&lt;/span&gt;&lt;/i&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;b&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Helpful Links:&lt;/span&gt;&lt;/b&gt;&lt;span style=&quot;font-size:13.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Advance Program: &lt;/span&gt;&lt;a href=&quot;http://www.hldvt.com/09/HLDVTAP09.pdf&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;http://www.hldvt.com/09/HLDVTAP09.pdf&lt;/span&gt;&lt;/a&gt;&lt;span style=&quot;font-size:16.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Hotel Information:   &lt;/span&gt;&lt;a href=&quot;http://www.hldvt.com/09/local.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial;color:#000099&quot;&gt;http://www.hldvt.com/09/local.html&lt;/span&gt;&lt;/a&gt;&lt;span style=&quot;font-size:13.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;

&lt;p class=&quot;MsoNormal&quot; style=&quot;margin-bottom:12.0pt;text-align:justify;mso-pagination:
none;tab-stops:28.0pt 56.0pt 84.0pt 112.0pt 140.0pt 168.0pt 196.0pt 224.0pt 3.5in 280.0pt 308.0pt 336.0pt;
mso-layout-grid-align:none;text-autospace:none&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;Home
Page:           &lt;/span&gt;&lt;a href=&quot;http://www.hldvt.com/09/index.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;&lt;span style=&quot;font-size:16.0pt;
font-family:Arial;mso-bidi-font-family:Arial;color:#000099&quot;&gt;http://www.hldvt.com/09/index.html&lt;/span&gt;&lt;/a&gt;&lt;span style=&quot;font-size:13.0pt;font-family:Arial;mso-bidi-font-family:Arial&quot;&gt;&lt;/span&gt;&lt;/p&gt;




&lt;/div&gt;
&lt;br /&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25577858&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Verification-and-Debug-at-HLDVT-tp25577858p25577858.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25538263</id>
	<title>1st CFP: Workshop on Matching and Meaning: Automated development, evolution and interpretation of ontologies.</title>
	<published>2009-09-20T08:24:25Z</published>
	<updated>2009-09-20T08:24:25Z</updated>
	<author>
		<name>Michael Chan-7</name>
	</author>
	<content type="html">Apologies for cross-postings
&lt;br&gt;&lt;br&gt;------------------------------------------------------------------------------
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; CALL FOR PAPERS
&lt;br&gt;------------------------------------------------------------------------------
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Workshop on Matching and Meaning:
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Automated development, evolution and interpretation of ontologies
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://dream.inf.ed.ac.uk/events/wmm-2010&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://dream.inf.ed.ac.uk/events/wmm-2010&lt;/a&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 31st March 2010, part of AISB'10 Convention, Leicester, UK
&lt;br&gt;&lt;br&gt;&lt;br&gt;OVERVIEW
&lt;br&gt;&lt;br&gt;The problem of semantic misalignment - of two (or more) systems failing 
&lt;br&gt;to understand one another when their semantic representation is not
&lt;br&gt;identical - occurs in a huge variety of areas: the Semantic Web,
&lt;br&gt;databases, natural language processing; anywhere, indeed, where
&lt;br&gt;semantics are necessary but centralised control is undesirable or
&lt;br&gt;impractical. &amp;nbsp;In highly dynamic domains, where interactions are between
&lt;br&gt;a large, diverse and evolving community, there is a need for the
&lt;br&gt;resolving of these misalignments - through developing and evolving
&lt;br&gt;existing ontologies or interpreting unknown ontologies in terms of
&lt;br&gt;known ones - to be done automatically and on-the-fly.
&lt;br&gt;&lt;br&gt;The aim of this workshop is to bring together researchers interested in
&lt;br&gt;the problems of automated development, evolution and interpretation of
&lt;br&gt;ontologies in the many different domains in which it occurs. We are
&lt;br&gt;primarily interested in the exchange of ideas and the stimulation of
&lt;br&gt;debate, and the workshop is intended to be a forum for researchers to
&lt;br&gt;present ongoing work and ideas and to engage in discussion with other
&lt;br&gt;researchers from the field. We are particularly interested in novel
&lt;br&gt;ideas and innovative research, which may be in its early stages, and
&lt;br&gt;encourage reports on work in progress.
&lt;br&gt;&lt;br&gt;Topics of interest include:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Ontology evolution
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Ontology matching and alignment
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Ontology versioning
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Representational or structural change
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Formal aspects of ontology dynamics
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Formalisation of and reasoning with contexts
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Foundational issues
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Social and collaborative matching
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Background knowledge in matching
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Extensions to ontology languages to better support change
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Non-monotonic reasoning for ontologies and the Semantic Web
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Inconsistency handling in evolving ontologies
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Uncertainty in matching
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Change propagation in ontologies and metadata
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Ontologies for dynamic environments
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Dynamic knowledge construction and exploitation
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Matching for dynamic applictions (e.g., p2p, agents, web-services)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Case studies, software tools, use cases, applications
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; * Open problems
&lt;br&gt;&lt;br&gt;&lt;br&gt;SUBMISSION GUIDELINES
&lt;br&gt;&lt;br&gt;We encourage the submission of extended abstracts of 2-5 pages that
&lt;br&gt;discuss ongoing research, problem descriptions and overviews of the
&lt;br&gt;domain. Accepted papers will be included in the AISB 2010 proceedings
&lt;br&gt;unless the authors prefer them not to be (for example, if the work is
&lt;br&gt;very similar to work presented elsewhere which they nevertheless feel
&lt;br&gt;it would be valuable to present in this context, or if the work is at
&lt;br&gt;a stage where discussion would be valuable but publication would be
&lt;br&gt;premature). Authors wishing their submissions to be included in the
&lt;br&gt;convention proceedings must follow the style guide on the convention
&lt;br&gt;website.
&lt;br&gt;&lt;br&gt;Submissions will be subject to light reviewing, mainly intended to
&lt;br&gt;check fit to workshop.
&lt;br&gt;&lt;br&gt;Abstracts should be submitted electronically in pdf format to
&lt;br&gt;mchan-at-ed.ac.uk by 18th December 2009. Notification of acceptance
&lt;br&gt;will be sent to the submitting author on 15th February 2010.
&lt;br&gt;&lt;br&gt;&lt;br&gt;VENUE
&lt;br&gt;&lt;br&gt;The workshop will take place at De Montfort University in Leicester,
&lt;br&gt;as part of the AISB 2010 Convention
&lt;br&gt;(&lt;a href=&quot;http://www.aisb.org.uk/convention/aisb10/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.aisb.org.uk/convention/aisb10/&lt;/a&gt;), from March 31st to 1st
&lt;br&gt;April, 2010. All workshop participants must be registered for the AISB
&lt;br&gt;2010 Convention. Registration for this workshop is included in the
&lt;br&gt;convention registration fee.
&lt;br&gt;&lt;br&gt;&lt;br&gt;IMPORTANT DATES
&lt;br&gt;&lt;br&gt;Submission: Friday, 18th December 2009
&lt;br&gt;Notification: Monday, 15th February 2010
&lt;br&gt;Workshop: 31st March - 1st April 2010
&lt;br&gt;AISB10 Convention: 29th March - 1st April 2010
&lt;br&gt;&lt;br&gt;&lt;br&gt;PROGRAMME
&lt;br&gt;&lt;br&gt;Presentations: Authors of accepted abstracts will give presentations of
&lt;br&gt;their work; exact times to be decided.
&lt;br&gt;&lt;br&gt;Posters: If it is not possible to fit in presentations for all accepted
&lt;br&gt;authors, some may be asked to present posters instead. There will be a
&lt;br&gt;session of 5 minute poster talks.
&lt;br&gt;&lt;br&gt;Panel: The technical programme will end with a 90 minute panel
&lt;br&gt;discussion on a topic of mutual interest to be decided. Three speakers
&lt;br&gt;will speak for 10 minutes each with a brief to stimulate debate during
&lt;br&gt;the remaining 60 minutes. Discussion amongst all participants, rather
&lt;br&gt;than question-and-answering for the panel, will be strongly encouraged.
&lt;br&gt;&lt;br&gt;&lt;br&gt;ORGANISERS
&lt;br&gt;&lt;br&gt;Fiona McNeill, University of Edinburgh, UK
&lt;br&gt;Michael Chan, University of Edinburgh, UK
&lt;br&gt;&lt;br&gt;&lt;br&gt;PROGRAMMING COMMITTEE
&lt;br&gt;&lt;br&gt;Manuel Atencia Arcas, IIIA-CSIC, Spain
&lt;br&gt;Paolo Besana, University of Edinburgh, UK
&lt;br&gt;Alan Bundy, University of Edinburgh, UK
&lt;br&gt;Jerome Euzenat, INRIA Grenoble Rhone-Alpes, France
&lt;br&gt;Fausto Giunchiglia, University of Trento, Italy
&lt;br&gt;Adam Pease, Articulate Software, USA
&lt;br&gt;Pavel Shvaiko, TasLab, Informatica Trentina, Italy
&lt;br&gt;&lt;br&gt;-- 
&lt;br&gt;The University of Edinburgh is a charitable body, registered in
&lt;br&gt;Scotland, with registration number SC005336.
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25538263&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/1st-CFP%3A-Workshop-on-Matching-and-Meaning%3A-Automated-development%2C-evolution-and-interpretation-of-ontologies.-tp25538263p25538263.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25515110</id>
	<title>Call for Papers: PLPV 2010</title>
	<published>2009-09-18T13:21:14Z</published>
	<updated>2009-09-18T13:21:14Z</updated>
	<author>
		<name>Jean-Christophe Filliâtre-3</name>
	</author>
	<content type="html">&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Call For Papers
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp;Programming Languages meets Program Verification (PLPV) 2010
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://slang.soe.ucsc.edu/plpv10/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://slang.soe.ucsc.edu/plpv10/&lt;/a&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Tuesday, January 19, 2010
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Madrid, Spain
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Affiliated with POPL 2010
&lt;br&gt;&lt;br&gt;&lt;br&gt;Overview: The goal of PLPV is to foster and stimulate research at the
&lt;br&gt;intersection of programming languages and program verification. Work
&lt;br&gt;in this area typically attempts to reduce the burden of program
&lt;br&gt;verification by taking advantage of particular semantic and/or
&lt;br&gt;structural properties of the programming language. One example is
&lt;br&gt;dependently typed programming languages, which leverage a language's
&lt;br&gt;type system to specify and check richer than usual specifications,
&lt;br&gt;possibly with programmer-provided proof terms. Another example is
&lt;br&gt;extended static checking systems like Spec#, which extends C# with
&lt;br&gt;pre- and postconditions along with a static verifier for these
&lt;br&gt;contracts.
&lt;br&gt;&lt;br&gt;We invite submissions on all aspects, both theoretical and practical,
&lt;br&gt;of the integration of programming language and program verification
&lt;br&gt;technology. To encourage cross-pollination between different
&lt;br&gt;communities, we seek a broad the scope for PLPV. &amp;nbsp;In particular,
&lt;br&gt;submissions may have diverse foundations for verification (type-based,
&lt;br&gt;Hoare-logic-based, etc), target diverse kinds of programming languages
&lt;br&gt;(functional, imperative, object-oriented, etc), and apply to diverse
&lt;br&gt;kinds of program properties (data structure invariants, security
&lt;br&gt;properties, temporal protocols, etc).
&lt;br&gt;&lt;br&gt;Submissions: Submissions should fall into one of the following three
&lt;br&gt;categories:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;1. Regular research papers that describe new work on the above or
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; related topics. Submissions in this category have an upper limit
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; of 12 pages, but shorter submissions are also encouraged.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;2. Work-in-progress reports should describe new work that is
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; ongoing and may not be fully completed or evaluated. Submissions
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; in this category should be at most 6 pages in total length.
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp;3. Proposals for challenge problems which the author believes is
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; are useful benchmarks or important domains for language-based
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; program verification techniques. &amp;nbsp;Submissions in this category
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; should be at most 6 pages in total length.
&lt;br&gt;&lt;br&gt;Submissions should be prepared with SIGPLAN two-column conference
&lt;br&gt;format. Submitted papers must adhere to the SIGPLAN republication
&lt;br&gt;policy. Concurrent submissions to other workshops, conferences,
&lt;br&gt;journals, or similar forums of publication are not allowed.
&lt;br&gt;Papers should be submitted through Easychair,
&lt;br&gt;at &lt;a href=&quot;http://www.easychair.org/conferences/?conf=plpv2010&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/conferences/?conf=plpv2010&lt;/a&gt;&lt;br&gt;&lt;br&gt;Publication: Accepted papers will be published by the ACM and appear
&lt;br&gt;in the ACM digital library.
&lt;br&gt;&lt;br&gt;Student Attendees: Students with accepted papers or posters are
&lt;br&gt;encouraged to apply for a SIGPLAN PAC grant that will help to cover
&lt;br&gt;travel expenses to PLPV. Details on the PAC program and the
&lt;br&gt;application can be found on the workshop web page. PAC also offers
&lt;br&gt;support for companion travel.
&lt;br&gt;&lt;br&gt;Important Dates:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; * Electronic submission: October 8, 2009, 11:59pm Samoa time (UTC-11)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Notification: November 8, 2009
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Final version: November 17, 2009
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Workshop: January 19, 2010
&lt;br&gt;&lt;br&gt;Organizers:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; * Cormac Flanagan (University of California, Santa Cruz)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Jean-Christophe Filliâtre (CNRS)
&lt;br&gt;&lt;br&gt;Program Committee:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; * Adam Chlipala (Harvard University)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Ranjit Jhala (University of California, San Diego)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Joseph Kiniry (University College Dublin)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Rustan Leino (Microsoft Research)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Xavier Leroy (INRIA Paris-Rocquencourt)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Conor McBride (University of Strathclyde)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Andrey Rybalchenko (Max Planck Institute for Software Systems)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Tim Sheard (Portland State University)
&lt;br&gt;&amp;nbsp; &amp;nbsp; * Stephanie Weirich (University of Pennsylvania)
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25515110&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Call-for-Papers%3A-PLPV-2010-tp25515110p25515110.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25515107</id>
	<title>Final CFP: Australasian Ontology Workshop (AOW 2009): Papers due 25 September 2009</title>
	<published>2009-09-17T17:46:09Z</published>
	<updated>2009-09-17T17:46:09Z</updated>
	<author>
		<name>Kerry.Taylor</name>
	</author>
	<content type="html">&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;5th Australasian Ontology Workshop (AOW 2009)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 1 December 2009
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Held in Conjunction with the
&lt;br&gt;&amp;nbsp;22nd Australian Joint Conference on Artificial Intelligence (AI'09)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; University of Melbourne, Melbourne, Australia
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://ksg.meraka.org.za/~aow2009&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://ksg.meraka.org.za/~aow2009&lt;/a&gt;&lt;br&gt;&lt;br&gt;AOW 2009 is the fifth in a series of workshops on ontologies held
&lt;br&gt;in the Australasian region.
&lt;br&gt;&lt;br&gt;The primary aim of the workshop is to bring together active researchers in
&lt;br&gt;the broad area of ontologies. Topics of interest include, but are not
&lt;br&gt;limited &amp;nbsp;to:
&lt;br&gt;&lt;br&gt;- Ontology models and theories
&lt;br&gt;- Ontologies and the Semantic Web
&lt;br&gt;- Interoperability in ontologies
&lt;br&gt;- Ontologies and Multi-agent systems
&lt;br&gt;- Description logics for ontologies
&lt;br&gt;- Reasoning with ontologies
&lt;br&gt;- Ontology harvesting on the web
&lt;br&gt;- Ontology of agents and actions
&lt;br&gt;- Ontology visualisation
&lt;br&gt;- Ontology engineering and management
&lt;br&gt;- Ontology-based information extraction &amp;nbsp;and retrieval
&lt;br&gt;- Ontology merging, alignment and integration
&lt;br&gt;- Web ontology languages
&lt;br&gt;- Formal concept analysis and ontologies
&lt;br&gt;- Ontologies for e-research
&lt;br&gt;- Linking open data
&lt;br&gt;- Significant ontology applications
&lt;br&gt;&lt;br&gt;The proceedings of the four previous workshops were published as
&lt;br&gt;volumes in the Conferences in Research and Practice in
&lt;br&gt;Information Technology (CRPIT) series (&lt;a href=&quot;http://crpit.com/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://crpit.com/&lt;/a&gt;), and this
&lt;br&gt;will again be the case for AOW 2009. As with the previous
&lt;br&gt;workshops, we are investigating the possibility of extended versions
&lt;br&gt;of &amp;nbsp;selected papers appearing in a special issue of a suitable journal.
&lt;br&gt;&lt;br&gt;Submission information such as format etc. can be found on the
&lt;br&gt;CRPIT website: &lt;a href=&quot;http://crpit.com/AuthorsSubmitting.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://crpit.com/AuthorsSubmitting.html&lt;/a&gt;. The page
&lt;br&gt;limit is 10 pages.
&lt;br&gt;&lt;br&gt;Important Dates:
&lt;br&gt;Paper submission deadline: 25 September 2009
&lt;br&gt;Notification of acceptance/rejection: 23 October 2009
&lt;br&gt;Camera-ready copies due: 13 November 2009
&lt;br&gt;AOW 2009: 1 December 2009
&lt;br&gt;&lt;br&gt;Papers must be submitted via the EasyChair system at
&lt;br&gt;&lt;br&gt;&amp;nbsp; &lt;a href=&quot;http://www.easychair.org/conferences/?conf=aow2009&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/conferences/?conf=aow2009&lt;/a&gt;&lt;br&gt;&lt;br&gt;This year AOW 2009 will have a best paper award, with a prize
&lt;br&gt;of $250(AUD) being awarded to the author(s) of the best paper.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Workshop Chairs:
&lt;br&gt;Thomas Meyer
&lt;br&gt;Meraka Institute, South Africa
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25515107&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;tommie.meyer@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;Kerry Taylor
&lt;br&gt;CSIRO ICT Centre
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25515107&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Kerry.Taylor@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;&lt;br&gt;Program Committee:
&lt;br&gt;Franz Baader (TU Dresden, Germany)
&lt;br&gt;Richard Booth (Mahasarakham University, Thailand)
&lt;br&gt;Arina Britz (Meraka Institute, South Africa)
&lt;br&gt;Werner Ceusters (SUNY Buffalo, USA)
&lt;br&gt;Michael Compton (CSIRO, Australia)
&lt;br&gt;Oscar Corcho (Universidad Politecnica de Madrid, Spain)
&lt;br&gt;R. Cenk Erdur (Ege University, Turkey)
&lt;br&gt;Aurona Gerber (Meraka Institute, South Africa)
&lt;br&gt;Dennis Hooijmaijers (University of South Australia, Australia)
&lt;br&gt;Bo Hu (SAP Research, UK)
&lt;br&gt;Renato Iannella (NICTA, Australia)
&lt;br&gt;Ken Kaneiwa (NICT, Japan)
&lt;br&gt;Marijke Keet (Free University of Bolzano, Italy)
&lt;br&gt;Kevin Lee (NICTA and UNSW, Australia)
&lt;br&gt;Laurent Lefort (CSIRO, Australia)
&lt;br&gt;Costas Mantratzis (University of Westminster, UK)
&lt;br&gt;Lars Moench (University of Hagen, Germany)
&lt;br&gt;Deshendran Moodley (University of KwaZulu Natal, South Africa)
&lt;br&gt;Mehmet Orgun (Macquarie University, Australia)
&lt;br&gt;Maurice Pagnucco (UNSW, Australia)
&lt;br&gt;Debbie Richards (Macquarie University, Australia)
&lt;br&gt;Rolf Schwitter (Macquarie University, Australia)
&lt;br&gt;Murat Sensoy (Bogazici University, Turkey)
&lt;br&gt;Barry Smith (SUNY Buffalo, USA)
&lt;br&gt;Markus Stumptner (University of South Australia, Australia)
&lt;br&gt;Boontawee Suntisrivaraporn (Thammasat University, Thailand)
&lt;br&gt;Sergio Tessaris (Free University of Bolzano, Italy)
&lt;br&gt;Nwe Ni Tun (National University of Singapore, Singapore)
&lt;br&gt;Ivan Varzinczak (Meraka Institute, South Africa)
&lt;br&gt;Kewen Wang (Griffith University, Australia)
&lt;br&gt;Antoine Zimmermann (DERI, Ireland)
&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25515107&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Final-CFP%3A-Australasian-Ontology-Workshop-%28AOW-2009%29%3A-Papers-due-25-September-2009-tp25515107p25515107.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25515063</id>
	<title>Call for Bids, ESSLLI 2011</title>
	<published>2009-09-17T08:41:19Z</published>
	<updated>2009-09-17T08:41:19Z</updated>
	<author>
		<name>Carlos Areces-3</name>
	</author>
	<content type="html">-----8&amp;lt;-----8&amp;lt;-----8&amp;lt;-----8&amp;lt;-----8&amp;lt;-----8&amp;lt;-----8&amp;lt;-----
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; Please distribute as widely as possible
&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;and excuses for multiple posting.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp;************************************************
&lt;br&gt;&amp;nbsp;* Call for Bids to Host the 23-th ESSLLI, 2011 *
&lt;br&gt;&amp;nbsp;************************************************
&lt;br&gt;&lt;br&gt;The Association for Logic, Language and Computation (FoLLI) and
&lt;br&gt;the ESSLLI Standing Committee invite proposals to host the 23-nd
&lt;br&gt;European Summer School in Logic, Language, and Information
&lt;br&gt;(ESSLLI), to be held in August 2011.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp;*** The ESSLLI Summer School ***
&lt;br&gt;&lt;br&gt;ESSLLI is a summer school which takes place two weeks in the
&lt;br&gt;summer, every year since 1989. The school hosts approximately 50
&lt;br&gt;courses at both introductory and advanced level, and convokes
&lt;br&gt;around 500 participants each year from all over the world.
&lt;br&gt;&lt;br&gt;The main focus of the program of the summer schools is the
&lt;br&gt;interface between linguistics, logic and computation. Courses,
&lt;br&gt;both introductory and advanced, cover a wide variety of topics
&lt;br&gt;within the combined areas of interest: Language and Computation,
&lt;br&gt;Language and Logic, and Logic and Computation. Workshops are also
&lt;br&gt;organized, providing opportunities for in-depth discussion of
&lt;br&gt;issues at the forefront of research, as well as a series of
&lt;br&gt;invited lectures.
&lt;br&gt;&lt;br&gt;Detailed information about the ESSLLI organization can be found in
&lt;br&gt;the ESSLLI general guide, and the organizing and program committee
&lt;br&gt;guides. The guides can be obtained via the Standing Committee
&lt;br&gt;secretary.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp;*** Submission Procedure ***
&lt;br&gt;&lt;br&gt;At this time we seek draft proposals from prospective bidders.
&lt;br&gt;Based on an evaluation of the draft proposals, promising bidders
&lt;br&gt;will be asked to provide additional information for the final
&lt;br&gt;selection procedure. The ESSLLI Standing Committee (SC), in
&lt;br&gt;consultation with the management board of FoLLI, will finally
&lt;br&gt;select the site, the organizing committee, and the program
&lt;br&gt;committee, and supervise the subsequent organization.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp;*** Draft Proposals ***
&lt;br&gt;&lt;br&gt;Draft proposals should identify a target site, date and organizing
&lt;br&gt;team with a chair who will be responsible for the overal
&lt;br&gt;organization. The organization committee is responsible for all
&lt;br&gt;matters having to do with the practical organization. Draft
&lt;br&gt;proposals should at least include information on:
&lt;br&gt;&lt;br&gt;&amp;nbsp;-&amp;gt; Location (accessibility; school venue; accommodation and
&lt;br&gt;&amp;nbsp; &amp;nbsp; facilities)
&lt;br&gt;&amp;nbsp;-&amp;gt; Proposed dates and organizing team
&lt;br&gt;&amp;nbsp;-&amp;gt; Endorsement by hosting organization
&lt;br&gt;&amp;nbsp;-&amp;gt; Local Language, Logic, and Computation community
&lt;br&gt;&amp;nbsp;-&amp;gt; Meeting and accommodation venues; audiovisual equipment
&lt;br&gt;&amp;nbsp;-&amp;gt; Catering and reception facilities; social program
&lt;br&gt;&amp;nbsp; &amp;nbsp; opportunities
&lt;br&gt;&amp;nbsp;-&amp;gt; Budget estimates
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp;*** Proposal Assessment ***
&lt;br&gt;&lt;br&gt;Proposals will be evaluated according to the following criteria
&lt;br&gt;(unordered):
&lt;br&gt;&lt;br&gt;&amp;nbsp;-&amp;gt; Experience of organizing team, involvement in previous ESSLLIs
&lt;br&gt;&amp;nbsp;-&amp;gt; Local endorsement
&lt;br&gt;&amp;nbsp;-&amp;gt; Appropriateness of proposed dates
&lt;br&gt;&amp;nbsp;-&amp;gt; Accessibility and attractiveness of proposed site
&lt;br&gt;&amp;nbsp;-&amp;gt; Adequacy of campus facilities for the anticipated
&lt;br&gt;&amp;nbsp; &amp;nbsp; number of registrants
&lt;br&gt;&amp;nbsp;-&amp;gt; Adequacy of residence accommodations and food services
&lt;br&gt;&amp;nbsp; &amp;nbsp; in an appropriate range of price categories and close
&lt;br&gt;&amp;nbsp; &amp;nbsp; to the conference facilities
&lt;br&gt;&amp;nbsp;-&amp;gt; Adequacy of budget projections
&lt;br&gt;&amp;nbsp;-&amp;gt; Geographical and national balance with regard to meetings in
&lt;br&gt;&amp;nbsp; &amp;nbsp; the decade prior to 2011: Helsinki (2001), Trento (2002),
&lt;br&gt;&amp;nbsp; &amp;nbsp; Wien (2003), Nancy (2004), Edinburgh (2005), Malaga (2006),
&lt;br&gt;&amp;nbsp; &amp;nbsp; Dublin (2007), Hamburg (2008), Bordeaux (2009), Copenhagen (2010)
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp;*** Important Dates ***
&lt;br&gt;&lt;br&gt;&amp;nbsp;-&amp;gt; September 11, 2009, call for bids posted
&lt;br&gt;&amp;nbsp;-&amp;gt; November 6, 2009, draft proposals due
&lt;br&gt;&amp;nbsp; &amp;nbsp; November/December, 2009, SC provides feedback
&lt;br&gt;&amp;nbsp;-&amp;gt; January 31, 2010, final proposals due
&lt;br&gt;&amp;nbsp;-&amp;gt; February 28, 2010, bid selected at ESSLLI SC meeting
&lt;br&gt;&amp;nbsp;-&amp;gt; August 14, 2010, OC and PC progress report
&lt;br&gt;&amp;nbsp;-&amp;gt; August, 2011, 23-nd ESSLLI
&lt;br&gt;&lt;br&gt;Information about FoLLI and ESSLLI can be found at: http://
&lt;br&gt;www.folli.org/. If you want to consult the ESSLLI guidelines,
&lt;br&gt;or have any other queries about drafting your bid, please contact
&lt;br&gt;Sophia Katrenko or Paul Dekker. Draft proposals should be sent to:
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; Sophia Katrenko &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Paul Dekker
&lt;br&gt;&amp;nbsp; &amp;nbsp; Informatics Institute &amp;nbsp; &amp;nbsp;ILLC/Department of Philosophy
&lt;br&gt;&amp;nbsp; &amp;nbsp; Faculty of Science &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Faculty of Humanities
&lt;br&gt;&amp;nbsp; &amp;nbsp; Universiteit van Amsterdam
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; Kruislaan 419 &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Nieuwe Doelenstraat 15
&lt;br&gt;&amp;nbsp; &amp;nbsp; NL-1098 VA &amp;nbsp;Amsterdam &amp;nbsp; &amp;nbsp;NL-1012 CP Amsterdam
&lt;br&gt;&amp;nbsp; &amp;nbsp; The Netherlands
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; +31 (0)20 525 6786 &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;+31 (0)20 5254541
&lt;br&gt;&amp;nbsp; &amp;nbsp; +31 (0)20 525 6896 (fax) &amp;nbsp; &amp;nbsp;+31 (0)20 5254503 (fax)
&lt;br&gt;&amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25515063&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;katrenko@...&lt;/a&gt; &amp;nbsp; &amp;nbsp;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25515063&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;p.j.e.dekker@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25515063&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Call-for-Bids%2C-ESSLLI-2011-tp25515063p25515063.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25515103</id>
	<title>World Congress and School, Lisbon 2010</title>
	<published>2009-09-17T04:13:17Z</published>
	<updated>2009-09-17T04:13:17Z</updated>
	<author>
		<name>Universal Logic</name>
	</author>
	<content type="html">The third edition of the World Congress and School on Universal Logic will
&lt;br&gt;happen April 18-25, 2010 in Lisbon, Portugal.
&lt;br&gt;&lt;br&gt;There will be:
&lt;br&gt;&lt;br&gt;10 invited speakers, among them: Hartry Field, George Grätzer, Yuri
&lt;br&gt;Gurevich, Hiroakira Ono, Gehrard Jaeger, Dana Scott
&lt;br&gt;&lt;br&gt;10 special sessions, among them: logic diagrams, substructural logics,
&lt;br&gt;non-classical mathematics, abstrac algebraic logic, negation categorial logic
&lt;br&gt;&lt;br&gt;21 tutorials, among them: Hybrid logic, Logical Pluralism, Erotetic
&lt;br&gt;Logics, Truth-values, Theory of Institutions, &amp;nbsp;Ideospheres
&lt;br&gt;&lt;br&gt;1 contest: How to combine logics?
&lt;br&gt;&lt;br&gt;Submission deadline for contributed talks is October 15, 2009
&lt;br&gt;&lt;br&gt;UNILOG'2010
&lt;br&gt;World Congress and School on Universal Logic III
&lt;br&gt;April 18-25, 2010, Lisbon, Portugal
&lt;br&gt;&lt;a href=&quot;http://www.uni-log.org&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.uni-log.org&lt;/a&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25515103&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/World-Congress-and-School%2C-Lisbon-2010-tp25515103p25515103.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25457290</id>
	<title>ASCM 2009 and MACIS 2009 - Extended Submission Deadline</title>
	<published>2009-09-15T05:08:54Z</published>
	<updated>2009-09-15T05:08:54Z</updated>
	<author>
		<name>Enric Rodriguez Carbonell</name>
	</author>
	<content type="html">&lt;br&gt;Apologies if you receive multiple copies of this announcement.
&lt;br&gt;&lt;br&gt;=====================================================================
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; The Joint Conference of ASCM 2009 and MACIS 2009
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; December 14th-17th, 2009
&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;JAL Resort Sea Hawk Hotel, Fukuoka, Japan
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; Website: &lt;a href=&quot;http://gcoe.math.kyushu-u.ac.jp/ascm-macis2009/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://gcoe.math.kyushu-u.ac.jp/ascm-macis2009/&lt;/a&gt;&lt;br&gt;&amp;nbsp; &amp;nbsp; Contact Address: &amp;nbsp;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25457290&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;ascm-macis2009@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;=====================================================================
&lt;br&gt;&lt;br&gt;IMPORTANT DATES
&lt;br&gt;---------------
&lt;br&gt;Sep 25, 2009 &amp;nbsp;EXTENDED Submission deadline
&lt;br&gt;Oct 20, 2009 &amp;nbsp;Notification of acceptance/rejection
&lt;br&gt;&lt;br&gt;&lt;br&gt;BACKGROUND
&lt;br&gt;----------
&lt;br&gt;Two international conferences
&lt;br&gt;&lt;br&gt;* the 9th Asian Symposium on Computer Mathematics (ASCM 2009) and
&lt;br&gt;* the 3rd International Conference on Mathematical Aspects of Computer
&lt;br&gt;&amp;nbsp;and Information Sciences (MACIS 2009)
&lt;br&gt;&lt;br&gt;will be held jointly at Fukuoka in December 14th -17th, 2009 supported
&lt;br&gt;by the GCOE program &amp;quot;Math-for-industry&amp;quot; of the Graduate School of
&lt;br&gt;Mathematics of Kyushu University and Mathematical Research Center for
&lt;br&gt;Industrial Technology of Kyushu University. The programs of ASCM and
&lt;br&gt;those of MACIS will be organized independently by each program
&lt;br&gt;committee except invited talks. Sessions of ASCM and those of MACIS
&lt;br&gt;will be held in parallel and invited talks will be given in plenary.
&lt;br&gt;&lt;br&gt;&lt;br&gt;SUBMISSION
&lt;br&gt;----------
&lt;br&gt;The information on the format can be found at
&lt;br&gt;&lt;a href=&quot;http://gcoe.math.kyushu-u.ac.jp/ascm-macis2009/for_authors.html&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://gcoe.math.kyushu-u.ac.jp/ascm-macis2009/for_authors.html&lt;/a&gt;&lt;br&gt;&lt;br&gt;Papers for MACIS 2009 should be electronically submitted to their
&lt;br&gt;corresponding track by visiting
&lt;br&gt;&lt;a href=&quot;http://www.easychair.org/conferences/?conf=macis2009&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.easychair.org/conferences/?conf=macis2009&lt;/a&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;JOINT ORGANIZING COMMITTEE
&lt;br&gt;--------------------------
&lt;br&gt;General Chair:
&lt;br&gt;&lt;br&gt;Masakazu Suzuki (Kyushu University, Japan)
&lt;br&gt;&lt;br&gt;Local chairs:
&lt;br&gt;&lt;br&gt;Hiroshi Yoshida (Kyushu University, Japan)
&lt;br&gt;Tatsuyoshi Hamada (Fukuoka University/JST CREST, Japan)
&lt;br&gt;Koji Nakagawa (Kyushu University, Japan)
&lt;br&gt;&lt;br&gt;Program Committee Chairs of the MACIS:
&lt;br&gt;&lt;br&gt;Hoon Hong &amp;nbsp;(North Carolina State University, USA)
&lt;br&gt;Hirokazu Anai (Kyushu University/Fujitsu Laboratories LTD, Japan)
&lt;br&gt;&lt;br&gt;Program Committee Chairs of the ASCM:
&lt;br&gt;&lt;br&gt;Chee Yap (New York University, USA)
&lt;br&gt;Yosuke Sato &amp;nbsp;(Tokyo University of Science, Japan)
&lt;br&gt;&lt;br&gt;Coordinator of the joint conference:
&lt;br&gt;&lt;br&gt;Kazuhiro Yokoyama (Rikkyo University, Japan)
&lt;br&gt;&lt;br&gt;Program Committee Members of the MACIS:
&lt;br&gt;&lt;br&gt;Enric Rodriguez Carbonell (Technical University of Catalonia, Spain)
&lt;br&gt;Andrzej Cichocki (RIKEN, Japan)
&lt;br&gt;Mohab Safey El Din (INRIA, France)
&lt;br&gt;Jeremy Johnson (Drexel University, USA)
&lt;br&gt;Masaaki Kanno (Niigata University, Japan)
&lt;br&gt;Gabriel Dos Reis (Texas A&amp;M University, USA)
&lt;br&gt;Fabrice Rouillier (INRIA, France)
&lt;br&gt;Eric Schost (Univ. of Western Ontario, Canada)
&lt;br&gt;Hiroshi Yoshida (Kyushu University, Japan)
&lt;br&gt;&lt;br&gt;Program Committee Members of the ASCM:
&lt;br&gt;&lt;br&gt;Xiao-Shan Gao (Chinese Academy of Sciences, China)
&lt;br&gt;Deepak Kapur (Univ. of New Mexico, USA)
&lt;br&gt;Ziming Li (Academy of Mathematics and System Sciences, China)
&lt;br&gt;Hirokazu Murao (The University of Electro Communications, Japan)
&lt;br&gt;Mitsuhiro Nakao (Kyushu Univesity, Japan)
&lt;br&gt;Hyungju Park (KIAS, Korea)
&lt;br&gt;Guenael Renault (LIP6, France)
&lt;br&gt;Ko Sakai (Tsukuba University, Japan)
&lt;br&gt;Alan P. Sexton (University of Birmingham, UK)
&lt;br&gt;Volker Sorge (University of Birmingham, UK)
&lt;br&gt;Gert Vegter (Groningen University, the Netherlands)
&lt;br&gt;Dahan Xavier (Kyushu University, Japan)
&lt;br&gt;&lt;br&gt;&lt;br&gt;=========
&lt;br&gt;ASCM 2009
&lt;br&gt;=========
&lt;br&gt;The Asian Symposium on Computer Mathematics (ASCM) is a series of
&lt;br&gt;conferences which serve as a forum for participants to present original
&lt;br&gt;research, learn of research progress and developments, and exchange
&lt;br&gt;ideas and views on doing mathematics using computers.
&lt;br&gt;&lt;br&gt;The previous ASCM meetings were held in Beijing, China (1995), Kobe,
&lt;br&gt;Japan (1996), Lanzhou, China (1998), Chiang Mai, Thailand (2000),
&lt;br&gt;Matsuyama, Japan (2001) , Beijing, China (2003), Seoul, Korea (2005),
&lt;br&gt;Singapore, Singapore (2007). Further information on previous ASCM
&lt;br&gt;symposium may be found at &lt;a href=&quot;http://www.mmrc.iss.ac.cn/ascm&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.mmrc.iss.ac.cn/ascm&lt;/a&gt;.
&lt;br&gt;This year, the meeting will consist of invited talks,
&lt;br&gt;regular sessions of contributed papers, and three organized sessions.
&lt;br&gt;Regular sessions are run in a traditional style of ASCM.
&lt;br&gt;Each organized session is run by its organizer(s) independently.
&lt;br&gt;&lt;br&gt;Organized sessions:
&lt;br&gt;&lt;br&gt;1) Digitizing Mathematics -- From Pen and Paper to Digital Content
&lt;br&gt;&amp;nbsp;Organizers: Volker Sorge and Alan P. Sexton (Univ. of Birmingham, UK)
&lt;br&gt;&lt;br&gt;2) Validated Numerical Computation
&lt;br&gt;&amp;nbsp;Organizer: Mitsuhiro Nakao (Kyushu Univesity, Japan)
&lt;br&gt;&lt;br&gt;3) Computational Algebraic Number Theory
&lt;br&gt;&amp;nbsp;Organizer: Guenael Renault (LIP6, France)
&lt;br&gt;&lt;br&gt;&lt;br&gt;The selected papers presented at ASCM 2009 will be published
&lt;br&gt;either in MCS special issues or in a volume of LNAI.
&lt;br&gt;&lt;br&gt;&lt;br&gt;==========
&lt;br&gt;MACIS 2009
&lt;br&gt;==========
&lt;br&gt;MACIS is a new series of conferences where foundational research on
&lt;br&gt;theoretical and practical problems of mathematics for computing and
&lt;br&gt;information processing may be presented and discussed. MACIS also
&lt;br&gt;addresses experimental and case studies, scientific and engineering
&lt;br&gt;computation, design and implementation of algorithms and software
&lt;br&gt;systems, and applications of mathematical methods and tools to
&lt;br&gt;outstanding and emerging problems in applied computer and information
&lt;br&gt;sciences.
&lt;br&gt;&lt;br&gt;The first MACIS conference took place in Beijing (China), July
&lt;br&gt;24-26, 2006 (see &lt;a href=&quot;http://www.cc4cm.org/macis2006/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.cc4cm.org/macis2006/&lt;/a&gt;&amp;nbsp;for more
&lt;br&gt;details). The second MACIS conference took place in Paris (France),
&lt;br&gt;December 5-7, 2007 (see &lt;a href=&quot;http://www-spiral.lip6.fr/MACIS2007/&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www-spiral.lip6.fr/MACIS2007/&lt;/a&gt;&amp;nbsp;for
&lt;br&gt;more details).
&lt;br&gt;&lt;br&gt;MACIS2009 is run in a format where each PC member organizes a
&lt;br&gt;session on a specific topic. MACIS 2009 consists of 9 sessions,
&lt;br&gt;which are categorized into three main thema as shown in the
&lt;br&gt;following:
&lt;br&gt;&lt;br&gt;------------------------------+--------------------------------------------- 
&lt;br&gt;&lt;br&gt;theme / sessions &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; | &amp;nbsp;PC member in charge
&lt;br&gt;------------------------------+--------------------------------------------- 
&lt;br&gt;&lt;br&gt;&lt;br&gt;1) Polynomial system solving &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; 
&lt;br&gt;&lt;br&gt;&amp;nbsp;a)complex &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Fabrice Rouillier (INRIA, France)
&lt;br&gt;&amp;nbsp;b)real &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Mohab Safey El Din (INRIA,France)
&lt;br&gt;&amp;nbsp;c)rational &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Eric Schost (U. Western Ontario, Canada)
&lt;br&gt;&lt;br&gt;2) Control/System/Signal
&lt;br&gt;&lt;br&gt;&amp;nbsp;a)control &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Masaaki Kanno (Niigata Univ.,Japan)
&lt;br&gt;&amp;nbsp;b)system (bio/bio-inspired) &amp;nbsp; &amp;nbsp;Hiroshi Yoshida (Kyushu Univ.,Japan)
&lt;br&gt;&amp;nbsp;c)signal &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Andrzej Cichocki (RIKEN, Japan)
&lt;br&gt;&lt;br&gt;3) Software Science
&lt;br&gt;&lt;br&gt;&amp;nbsp;a)Analysis &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Enric Rodriguez-Carbonell (UPC, Spain)
&lt;br&gt;&amp;nbsp;b)Synthesis &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;Jeremy Johnson (Drexel University, USA)
&lt;br&gt;&amp;nbsp;c)Language/Framework &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Gabriel Dos Reis (Texas A&amp;M Univ., USA)
&lt;br&gt;------------------------------+--------------------------------------------- 
&lt;br&gt;&lt;br&gt;&lt;br&gt;The selected papers presented at MACIS 2009 will be published in MCS 
&lt;br&gt;special issues.
&lt;br&gt;&lt;br&gt;-- 
&lt;br&gt;________________________________________________________________
&lt;br&gt;Enric Rodriguez Carbonell &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;www.lsi.upc.edu/~erodri
&lt;br&gt;Technical University of Catalonia (UPC) &amp;nbsp;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25457290&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;erodri@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;Office 114 - Omega Building
&lt;br&gt;Department of Software (LSI) &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; Phone: &amp;nbsp;+34-93-4137792
&lt;br&gt;Jordi Girona 1, 08034 Barcelona, Spain &amp;nbsp; Fax: &amp;nbsp; &amp;nbsp;+34-93-4137833
&lt;br&gt;________________________________________________________________
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25457290&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/ASCM-2009-and-MACIS-2009---Extended-Submission-Deadline-tp25457290p25457290.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25415712</id>
	<title>RR 2009 Call for Participation</title>
	<published>2009-09-11T13:39:51Z</published>
	<updated>2009-09-11T13:39:51Z</updated>
	<author>
		<name>Terrance Swift</name>
	</author>
	<content type="html">&lt;br&gt;&lt;br&gt;Apologies for multiple postings:
&lt;br&gt;&lt;br&gt;Please note that the early registration deadline for RR2009 will end
&lt;br&gt;September 20th, which is only slightly more than a week from now!
&lt;br&gt;&lt;br&gt;Also note, in case you additionally plan to attend ISWC2009, that the ISWC
&lt;br&gt;early registration deadline closes tomorrow.
&lt;br&gt;&lt;br&gt;&lt;br&gt;&amp;nbsp;			Call FOR PARTICIPATION
&lt;br&gt;&lt;br&gt;&amp;nbsp;			 &amp;nbsp; &amp;nbsp; &amp;nbsp; RR 2009
&lt;br&gt;&amp;nbsp;		The Third International Conference on
&lt;br&gt;&amp;nbsp;		 &amp;nbsp; &amp;nbsp;Web Reasoning and Rule Systems
&lt;br&gt;&amp;nbsp;		 &amp;nbsp; &amp;nbsp; &lt;a href=&quot;http://www.rr-conference.org&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.rr-conference.org&lt;/a&gt;&lt;br&gt;&lt;br&gt;You are invited to RR 2009, the major forum for discussion and
&lt;br&gt;dissemination of new results concerning Web Reasoning and Rule
&lt;br&gt;Systems. &amp;nbsp;The vast scale and the diverse nature of the Semantic Web
&lt;br&gt;presents numerous challenges for knowledge representation and
&lt;br&gt;reasoning. &amp;nbsp;Accordingly, the program features papers on practical and
&lt;br&gt;theoretical aspects of reasoning, including reasoning under
&lt;br&gt;uncertainty and inconsistency, and combining reasons with actions, as
&lt;br&gt;well as scalability and efficiency considerations. &amp;nbsp;Other papers
&lt;br&gt;explore extensions and applications of current standards and
&lt;br&gt;techniques for the Semantic Web including combining rule based systems
&lt;br&gt;with ontologies and description logics, module systems for ontologies
&lt;br&gt;and rules, ontology alignment, and path query languages.
&lt;br&gt;&lt;br&gt;Invited Talks and Tutorial
&lt;br&gt;&lt;br&gt;-- Robert Kowalski &amp;quot;Integrating Logic Programming and Production
&lt;br&gt;&amp;nbsp; &amp;nbsp; Systems with Abductive Logic Programming Agents&amp;quot;
&lt;br&gt;&lt;br&gt;-- Benjamin Grossof &amp;quot;SILK: Higher Level Rules with Defaults and
&lt;br&gt;&amp;nbsp; &amp;nbsp; Semantic Scalability&amp;quot;
&lt;br&gt;&lt;br&gt;-- Thomas Lukasiewicz &amp;quot;Uncertainty Reasoning for the Semantic Web&amp;quot;
&lt;br&gt;&lt;br&gt;The complete list of accepted papers is available at
&lt;br&gt;&lt;a href=&quot;http://www.rr-conference.org/RR2009&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://www.rr-conference.org/RR2009&lt;/a&gt;.
&lt;br&gt;&lt;br&gt;RR 2009 will be held near Washington, D.C. in Chantilly, Virginia
&lt;br&gt;October 25-26, 2009. &amp;nbsp;It is co-located with ISWC 09 and OWLED 2009.
&lt;br&gt;Registrants of RR 2009 may attend ISWC workshops and tutorials for
&lt;br&gt;free.
&lt;br&gt;&lt;br&gt;Further registration information can be found at
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;https://ww2.eventrebels.com/er/Registration/StepRegInfo.jsp?ActivityID=4116&amp;StepNumber=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://ww2.eventrebels.com/er/Registration/StepRegInfo.jsp?ActivityID=4116&amp;StepNumber=1&lt;/a&gt;&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25415712&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/RR-2009-Call-for-Participation-tp25415712p25415712.html" />
</entry>

<entry>
	<id>tag:old.nabble.com,2006:post-25383704</id>
	<title>Logic Summer School Invitation 7-14 December 2009 - Australian National University</title>
	<published>2009-09-09T16:30:50Z</published>
	<updated>2009-09-09T16:30:50Z</updated>
	<author>
		<name>Margaret Donnelly</name>
	</author>
	<content type="html">An Open Invitation to attend the
&lt;br&gt;&lt;br&gt;Logic Summer School
&lt;br&gt;The Australian National University
&lt;br&gt;7 to 18 December 2009
&lt;br&gt;&lt;br&gt;As computers become more powerful, their ability to perform complicated
&lt;br&gt;reasoning tasks increases. In order to harness their power, we need to
&lt;br&gt;understand the reasoning they can do, and how they
&lt;br&gt;may do it more efficiently. This understanding begins with logic.
&lt;br&gt;&lt;br&gt;The Australian National University (ANU) has an exciting opportunity for
&lt;br&gt;IT professionals, senior educators and students to enhance their logic
&lt;br&gt;and reasoning skills for the work-force, for teaching, or for higher
&lt;br&gt;degree by research study, in a two-week intensive summer school at the ANU.
&lt;br&gt;&lt;br&gt;The Logic Summer School comprises a blend of practical and theoretical
&lt;br&gt;short courses on aspects of pure and applied logic taught by
&lt;br&gt;international and national experts. The school provides a unique
&lt;br&gt;learning experience for all participants, backed up with
&lt;br&gt;state-of-the-art computational science facilities at the ANU.
&lt;br&gt;&lt;br&gt;&lt;br&gt;Presenters:
&lt;br&gt;&lt;br&gt;Professor John Slaney
&lt;br&gt;The Australian National University
&lt;br&gt;&lt;br&gt;Dr. Rajeev Goré
&lt;br&gt;The Australian National University
&lt;br&gt;&lt;br&gt;Dr Peter Baumgartner
&lt;br&gt;NICTA
&lt;br&gt;&lt;br&gt;Dr Michael Norrish
&lt;br&gt;NICTA
&lt;br&gt;&lt;br&gt;Dr Andreas Bauer
&lt;br&gt;NICTA
&lt;br&gt;&lt;br&gt;Dr Alwen Tiu
&lt;br&gt;The Australian National University
&lt;br&gt;&lt;br&gt;Professor Torsten Schaub
&lt;br&gt;University of Potsdam, Germany
&lt;br&gt;&lt;br&gt;Dr Patrik Haslum
&lt;br&gt;NICTA
&lt;br&gt;&lt;br&gt;Dr Errol Martin
&lt;br&gt;EP Martin Consulting
&lt;br&gt;&lt;br&gt;&lt;br&gt;Program Topics:
&lt;br&gt;&lt;br&gt;&amp;nbsp;* Fundamentals of metalogic
&lt;br&gt;&amp;nbsp;* Introduction to modal logic
&lt;br&gt;&amp;nbsp;* Overview of automated reasoning
&lt;br&gt;&amp;nbsp;* Computability and incompleteness
&lt;br&gt;&amp;nbsp;* Logic and complexity
&lt;br&gt;&amp;nbsp;* Programming in higher order logic
&lt;br&gt;&amp;nbsp;* Answer set programming
&lt;br&gt;&amp;nbsp;* Reasoning about discrete event systems
&lt;br&gt;&amp;nbsp;* Non-classical logic
&lt;br&gt;&lt;br&gt;&lt;br&gt;Is It For You?
&lt;br&gt;&lt;br&gt;The Summer School is for you if you want to expand your knowledge and
&lt;br&gt;understanding of information technology for the workplace or classroom,
&lt;br&gt;or for your studies if you want to take the next step
&lt;br&gt;towards a research degree. It is intended for:
&lt;br&gt;&lt;br&gt;&amp;nbsp;* Students from about the third year of undergraduate studies up
&lt;br&gt;&amp;nbsp; &amp;nbsp;to beginning PhD level who are considering specialising in a
&lt;br&gt;&amp;nbsp; &amp;nbsp;logic-related field
&lt;br&gt;&amp;nbsp;* Teachers who teach logic in computer science, mathematics or
&lt;br&gt;&amp;nbsp; &amp;nbsp;philosophy
&lt;br&gt;&amp;nbsp;* IT professionals who use formal methods or who want to know more
&lt;br&gt;&amp;nbsp; &amp;nbsp;about logic-based technology
&lt;br&gt;&amp;nbsp;* Anyone who finds the idea of two weeks of wall-to-wall logic
&lt;br&gt;&amp;nbsp; &amp;nbsp;enticing!
&lt;br&gt;&lt;br&gt;Fees:
&lt;br&gt;&lt;br&gt;Professionals: $1,650 per person; discounts are available for multiple
&lt;br&gt;registrations from individual companies and institutions.
&lt;br&gt;&lt;br&gt;Students in full-time education: $120 per person; scholarships are
&lt;br&gt;available and are assessed on a case-by-case basis. The web site has
&lt;br&gt;more details.
&lt;br&gt;&lt;br&gt;Registrations after Friday, 6 November 2009, are subject to a 20% surcharge.
&lt;br&gt;&lt;br&gt;To register or for more information visit our web site at:
&lt;br&gt;&lt;a href=&quot;http://lss.rsise.anu.edu.au&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lss.rsise.anu.edu.au&lt;/a&gt;&lt;br&gt;&lt;br&gt;If you would like to discuss this invitation in more detail, including
&lt;br&gt;advice on suitable candidacy, please contact Professor John Slaney by
&lt;br&gt;email: &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25383704&amp;i=0&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;John.Slaney@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;The Logic Summer School is supported by:
&lt;br&gt;NICTA, Canberra Research Laboratory and the
&lt;br&gt;ANU, College of Engineering and Computer Science
&lt;br&gt;&lt;br&gt;General enquiries: &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25383704&amp;i=1&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;lss@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;Phone: +61 2 6125 4043
&lt;br&gt;&lt;br&gt;Fax: +61 2 6125 0010
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://lss.rsise.anu.edu.au&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lss.rsise.anu.edu.au&lt;/a&gt;&lt;br&gt;&lt;br&gt;To view the electronic copy of LSS Brochure go to:
&lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://lss.rsise.anu.edu.au/files/Brochure_2009.pdf&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;http://lss.rsise.anu.edu.au/files/Brochure_2009.pdf&lt;/a&gt;&lt;br&gt;&lt;br&gt;Professor John Slaney
&lt;br&gt;Convenor
&lt;br&gt;The Logic Summer School
&lt;br&gt;_________________________________________________________________________________________________ 
&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;-- 
&lt;br&gt;Margaret Donnelly
&lt;br&gt;&lt;br&gt;Project Officer Support
&lt;br&gt;Computer Science
&lt;br&gt;Building 108
&lt;br&gt;The Australian National University
&lt;br&gt;Canberra &amp;nbsp;ACT &amp;nbsp;0200 &amp;nbsp;Australia
&lt;br&gt;&lt;br&gt;&lt;br&gt;Telephone: &amp;nbsp;+61 2 6125 8192
&lt;br&gt;Fax: &amp;nbsp;+21 2 6125 1110
&lt;br&gt;&lt;br&gt;Email : &lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25383704&amp;i=2&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Margaret.Donnelly@...&lt;/a&gt;
&lt;br&gt;&lt;br&gt;_______________________________________________
&lt;br&gt;Lprolog mailing list
&lt;br&gt;&lt;a href=&quot;http://old.nabble.com/user/SendEmail.jtp?type=post&amp;post=25383704&amp;i=3&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;Lprolog@...&lt;/a&gt;
&lt;br&gt;&lt;a href=&quot;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&quot; target=&quot;_top&quot; rel=&quot;nofollow&quot;&gt;https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog&lt;/a&gt;&lt;br&gt;</content>
	<link rel="alternate" type="text/html" href="http://old.nabble.com/Logic-Summer-School-Invitation-7-14-December-2009---Australian-National-University-tp25383704p25383704.html" />
</entry>

</feed>
