<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Logic and Rational Interaction &#187; Computer Science</title>
	<atom:link href="http://loriweb.org/?feed=rss2&#038;cat=40" rel="self" type="application/rss+xml" />
	<link>http://loriweb.org</link>
	<description>loriweb.org - loriweb.net : Webportal for the research community</description>
	<lastBuildDate>Tue, 07 Sep 2010 09:03:22 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Conference announcement: Temporal Representation and Reasoning (TIME&#8217;10), Paris, France</title>
		<link>http://loriweb.org/?p=3303</link>
		<comments>http://loriweb.org/?p=3303#comments</comments>
		<pubDate>Fri, 03 Sep 2010 14:59:53 +0000</pubDate>
		<dc:creator>Sunxin</dc:creator>
				<category><![CDATA[Activities]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Conference and workshop announcements]]></category>
		<category><![CDATA[Temporal Logic]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=3303</guid>
		<description><![CDATA[[ Monday, September 6, 2010 12:00 am to Wednesday, September 8, 2010 12:00 am. ]  

6-8 September 2010, Temporal Representation and Reasoning (TIME'10), Paris, France

This annual event brings together researchers from all areas of computer science that involve temporal representation and reasoning.
The program includes three tracks: temporal representation and reasoning in AI, temporal database management, and temporal logic and verification in computer science. The invited speakers include: I.
Hodkinson, B. Kuijpers, [...]]]></description>
			<content:encoded><![CDATA[<table class="ec3_schedule"><tr><td class="ec3_start">Monday, September 6, 2010 12:00 am</td><td class="ec3_to">to</td><td class="ec3_end">Wednesday, September 8, 2010 12:00 am</td></tr></table><p> </p>
<p>6-8 September 2010, Temporal Representation and Reasoning (TIME&#8217;10), Paris, France</p>
<p>This annual event brings together researchers from all areas of computer science that involve temporal representation and reasoning.<br />
The program includes three tracks: temporal representation and reasoning in AI, temporal database management, and temporal logic and verification in computer science. The invited speakers include: I.<br />
Hodkinson, B. Kuijpers, and M. Leucker.</p>
<p>For further information, visit the website below <a href="http://www.lsv.ens-cachan.fr/Events/TIME10/">http://www.lsv.ens-cachan.fr/Events/TIME10/</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=3303</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CFPs: 4th INDIAN CONFERENCE ON LOGIC AND ITS APPLICATIONS</title>
		<link>http://loriweb.org/?p=3189</link>
		<comments>http://loriweb.org/?p=3189#comments</comments>
		<pubDate>Thu, 15 Jul 2010 02:18:59 +0000</pubDate>
		<dc:creator>Sunxin</dc:creator>
				<category><![CDATA[Activities]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Call for papers]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Conference and workshop announcements]]></category>
		<category><![CDATA[Philosophical Logic]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=3189</guid>
		<description><![CDATA[[ Sunday, January 9, 2011 12:00 am to Tuesday, January 11, 2011 12:00 am. ]  
             4th INDIAN CONFERENCE ON LOGIC AND ITS APPLICATIONS
                                               January 9--11, 2011
                                            Delhi University, India
                                       http://ali.cmi.ac.in/icla2011
DEADLINE EXTENDED TO JULY 31 !!!
                            
CALL FOR PAPERS

ALI, the Association for Logic in India, announces the fourth edition of its biennial International Conference on Logic and its Applications (ICLA), to be held at the Delhi University, from January 9 to 11, 2011.

ICLA is a forum [...]]]></description>
			<content:encoded><![CDATA[<table class="ec3_schedule"><tr><td class="ec3_start">Sunday, January 9, 2011 12:00 am</td><td class="ec3_to">to</td><td class="ec3_end">Tuesday, January 11, 2011 12:00 am</td></tr></table><p> </p>
<p style="text-align: left">             4th INDIAN CONFERENCE ON LOGIC AND ITS APPLICATIONS<br />
                                               January 9&#8211;11, 2011<br />
                                            Delhi University, India<br />
                                       <a href="http://ali.cmi.ac.in/icla2011">http://ali.cmi.ac.in/icla2011</a></p>
<p style="text-align: left">DEADLINE EXTENDED TO JULY 31 !!!<br />
                            </p>
<p style="text-align: left">CALL FOR PAPERS</p>
<p>ALI, the Association for Logic in India, announces the fourth edition of its biennial International Conference on Logic and its Applications (ICLA), to be held at the Delhi University, from January 9 to 11, 2011.</p>
<p>ICLA is a forum for bringing together researchers from a wide variety of fields that formal logic plays a significant role in, along with mathematicians, philosophers and logicians studying foundations of formal logic in itself. A special feature of this conference is the inclusion of studies in systems of logic in the Indian tradition, and<br />
 historical research on logic.</p>
<p>As in the earlier events in this series, we shall have eminent logicians as invited speakers. Pre-conference workshops during Jan 5-8 are also being planned. One such event is &#8216;LogICCC Meets India&#8217; which will take place during Jan 7-8. For more information, see<br />
 <a href="http://www.illc.uva.nl/LogICCCMeetsIndia">http://www.illc.uva.nl/LogICCCMeetsIndia</a>. Details of other workshops will be posted on the conference website in due course. Details of the last ICLA (2009) may be found at <a href="http://ali.cmi.ac.in/icla2009">http://ali.cmi.ac.in/icla2009</a>.</p>
<p>Submission<br />
&#8212;&#8212;&#8212;&#8211;<br />
Authors are invited to submit papers presenting original and unpublished research in any area of logic and applications. Articles on mathematical and philosophical logic, foundations and philosophy of mathematics and the sciences, history of logic, Indian systems of logic, use of formal logic in areas of theoretical computer science and artificial intelligence, or on the relationship between logic and other branches of knowledge, are welcome.</p>
<p>Submissions must be in English and should provide sufficient detail to allow the programme committee to assess the merits of the paper. It should clearly present the context of the problem, summary of the main results and should contain the technical development directed to the specialist. Comparison with related work must be included. The submission may not exceed 12 pages using Springer&#8217;s<br />
LNCS format(<a href="http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0">http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0</a>).<br />
If necessary, detailed proofs of technical results can be included in a clearly marked appendix which may be read at the discretion of the programme committee. All submissions will be in electronic form and submitted via easychair submission system. Simultaneous submission to journals or to other conferences with proceedings is not allowed.</p>
<p>Submitted papers will be peer-reviewed and accepted papers will be published in the conference proceedings, which will be made available at the time of the conference. It is expected that the conference proceedings will appear as a volume in the FoLLI series of Springer Lecture Notes in Artificial Intelligence; this will be confirmed soon.</p>
<p>Important Dates<br />
Deadline for Submission (Extended):                   31 July 2010<br />
Notification to Authors:                                        5 September 2010<br />
Deadline for camera-ready papers:                      10 October 2010</p>
<p style="text-align: left">For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference.</p>
<p>Programme Committee<br />
Mohua Banerjee (IIT Kanpur), co-chair<br />
Dietmar Berwanger (ENS Cachan)<br />
Achim Blumensath (TU Darmstadt)<br />
Richard Booth (University of Luxembourg, and Mahasarakham University, Thailand)<br />
Hans van Ditmarsch (University of Sevilla)<br />
Didier Dubois (IRIT, Paul Sabatier University)<br />
Valentin Goranko (Technical University of Denmark)<br />
Wilfrid Hodges<br />
Peter Jipsen (Chapman University)<br />
Steven Lindell (Haverford College)<br />
Benedikt Loewe (ILLC, Amsterdam)<br />
Shahid Rahman (University of Lille 3)<br />
R Ramanujam (IMSc, Chennai)<br />
K Ramasubramanian (IIT Bombay)<br />
Sundar Sarukkai (Manipal University)<br />
Anil Seth (IIT Kanpur), co-chair<br />
S P Suresh (Chennai Mathematical Institute)<br />
Andrzej Szalas (Linkoeping University)<br />
Katherine Thompson (University of Vienna)<br />
Jouko Vaananen (University of Helsinki)<br />
Scott Weinstein (University of Pennsylvania)</p>
<p>Contact</p>
<p>Any queries related to the conference may be sent to the following email address: <a href="mailto:icla@cse.iitk.ac.in">icla@cse.iitk.ac.in</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=3189</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Workshop on Logic, Language, Information</title>
		<link>http://loriweb.org/?p=3129</link>
		<comments>http://loriweb.org/?p=3129#comments</comments>
		<pubDate>Fri, 02 Jul 2010 15:22:00 +0000</pubDate>
		<dc:creator>Sunxin</dc:creator>
				<category><![CDATA[Activities]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Natural Language Semantics]]></category>
		<category><![CDATA[Programming Theory]]></category>
		<category><![CDATA[Reasoning]]></category>
		<category><![CDATA[To be categorized]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=3129</guid>
		<description><![CDATA[[ Wednesday, May 18, 2011 12:00 am to Saturday, May 21, 2011 12:00 am. ]  

18-21 May 2011, WoLLIC 2011: Workshop on Logic, Language, Information
and Computation, Philadelphia PA, U.S.A.

WoLLIC 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 eighteenth WoLLIC will be
held at the University of Pennsylvania, Philadelphia, USA, [...]]]></description>
			<content:encoded><![CDATA[<table class="ec3_schedule"><tr><td class="ec3_start">Wednesday, May 18, 2011 12:00 am</td><td class="ec3_to">to</td><td class="ec3_end">Saturday, May 21, 2011 12:00 am</td></tr></table><p> </p>
<p>18-21 May 2011, WoLLIC 2011: Workshop on Logic, Language, Information<br />
and Computation, Philadelphia PA, U.S.A.</p>
<p>WoLLIC is an annual international forum on inter-disciplinary research<br />
involving formal logic, computing and programming theory, and natural<br />
language and reasoning. Each meeting includes invited talks and<br />
tutorials as well as contributed papers. The eighteenth WoLLIC will be<br />
held at the University of Pennsylvania, Philadelphia, USA, from May<br />
18th to 21st, 2011.</p>
<p>Contributions are invited on all pertinent subjects, with particular<br />
interest in cross-disciplinary topics. A title and single-paragraph<br />
abstract should be submitted by January 1st.</p>
<p>For more information, see <a href="http://wollic.org/wollic2011/">http://wollic.org/wollic2011/</a></p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=3129</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>7th Workshop on Fixed Points in Computer Science</title>
		<link>http://loriweb.org/?p=3126</link>
		<comments>http://loriweb.org/?p=3126#comments</comments>
		<pubDate>Fri, 02 Jul 2010 15:11:17 +0000</pubDate>
		<dc:creator>Sunxin</dc:creator>
				<category><![CDATA[Activities]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Fixed-point Logics]]></category>
		<category><![CDATA[To be categorized]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=3126</guid>
		<description><![CDATA[[ Saturday, August 21, 2010 12:00 am to Sunday, August 22, 2010 12:00 am. ]  

21-22 August 2010, 7th Workshop on Fixed Points in Computer Science
(FICS 2010), Brno, Czech Republic

Fixed points play a fundamental role in several areas of computer
science and logic by justifying induction and recursive definitions.
The construction and properties of fixed points have been investigated
in many different frameworks such as: design and implementation of
programming languages, program logics, databases. [...]]]></description>
			<content:encoded><![CDATA[<table class="ec3_schedule"><tr><td class="ec3_start">Saturday, August 21, 2010 12:00 am</td><td class="ec3_to">to</td><td class="ec3_end">Sunday, August 22, 2010 12:00 am</td></tr></table><p> </p>
<p>21-22 August 2010, 7th Workshop on Fixed Points in Computer Science<br />
(FICS 2010), Brno, Czech Republic</p>
<p>Fixed points play a fundamental role in several areas of computer<br />
science and logic by justifying induction and recursive definitions.<br />
The construction and properties of fixed points have been investigated<br />
in many different frameworks such as: design and implementation of<br />
programming languages, program logics, databases. The aim of the<br />
workshop is to provide a forum for researchers to present their results<br />
to those members of the computer science and logic communities who<br />
study or apply the theory of fixed points.</p>
<p>FICS-2010 is a satellite workshop to MFCS &amp; CSL 2010. For more<br />
information, see <a href="http://www.lif.univ-mrs.fr/fics2010/">http://www.lif.univ-mrs.fr/fics2010/</a></p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=3126</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>WoLLIC 2011: Workshop on Logic, Language, Information and Computation</title>
		<link>http://loriweb.org/?p=3110</link>
		<comments>http://loriweb.org/?p=3110#comments</comments>
		<pubDate>Thu, 24 Jun 2010 15:12:07 +0000</pubDate>
		<dc:creator>Sunxin</dc:creator>
				<category><![CDATA[Activities]]></category>
		<category><![CDATA[Call for papers]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Programming Theory]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=3110</guid>
		<description><![CDATA[[ Wednesday, May 18, 2011 12:00 am to Saturday, May 21, 2011 12:00 am. ]  

WoLLIC 2011
18th Workshop on Logic, Language, Information and Computation May 18th to 21st, 2011
University of Pennsylvania, USA

Scientific Sponsorship
Interest Group in Pure and Applied Logics
(&#60;http://www.cin.ufpe.br/~igpl/&#62;IGPL.&#62;)
The Association for Logic, Language and Information  (&#60;http://www.folli.org/&#62;FoLLI&#62;)
Association for Symbolic Logic (&#60;http://www.aslonline.org/&#62;ASL?)
European Association for Theoretical Computer
Science (&#60;http://www.eatcs.org/&#62;EATCS)
Sociedade Brasileira de Computação (&#60;http://www.sbc.org.br/&#62;SBC&#62;)
Sociedade Brasileira de Lógica (&#60;http://www.cle.unicamp.br/sbl/&#62;SBL)

Organisation
&#60;http://www.math.upenn.edu&#62;Department&#62; of Mathematics, &#60;http://www.upenn.edu/&#62;University&#62; of Pennsylvania, USA
&#60;http://www.cin.ufpe.br/&#62;Centro&#62; de Informática,
&#60;http://www.ufpe.br/&#62;Universidade&#62; [...]]]></description>
			<content:encoded><![CDATA[<table class="ec3_schedule"><tr><td class="ec3_start">Wednesday, May 18, 2011 12:00 am</td><td class="ec3_to">to</td><td class="ec3_end">Saturday, May 21, 2011 12:00 am</td></tr></table><p> </p>
<p>WoLLIC 2011<br />
18th Workshop on Logic, Language, Information and Computation May 18th to 21st, 2011<br />
University of Pennsylvania, USA</p>
<p>Scientific Sponsorship<br />
Interest Group in Pure and Applied Logics<br />
(&lt;<a href="http://www.cin.ufpe.br/~igpl&gt;&lt;/a&gt;IGPL">http://www.cin.ufpe.br/~igpl/&gt;IGPL</a>.&gt;)<br />
The Association for Logic, Language and Information  (&lt;<a href="http://www.folli.org&gt;&lt;/a&gt;FoLLI">http://www.folli.org/&gt;FoLLI</a>&gt;)<br />
Association for Symbolic Logic (&lt;<a href="http://www.aslonline.org&gt;&lt;/a&gt;ASL">http://www.aslonline.org/&gt;ASL</a>?)<br />
European Association for Theoretical Computer<br />
Science (&lt;<a href="http://www.eatcs.org&gt;&lt;/a&gt;EATCS">http://www.eatcs.org/&gt;EATCS</a>)<br />
Sociedade Brasileira de Computação (&lt;<a href="http://www.sbc.org.br&gt;&lt;/a&gt;SBC">http://www.sbc.org.br/&gt;SBC</a>&gt;)<br />
Sociedade Brasileira de Lógica (&lt;<a href="http://www.cle.unicamp.br/sbl&gt;&lt;/a&gt;SBL">http://www.cle.unicamp.br/sbl/&gt;SBL</a>)</p>
<p>Organisation<br />
&lt;<a href="http://www.math.upenn.edu&gt;department/">http://www.math.upenn.edu&gt;Department</a>&gt; of Mathematics, &lt;<a href="http://www.upenn.edu&gt;&lt;/a&gt;University">http://www.upenn.edu/&gt;University</a>&gt; of Pennsylvania, USA<br />
&lt;<a href="http://www.cin.ufpe.br&gt;&lt;/a&gt;Centro">http://www.cin.ufpe.br/&gt;Centro</a>&gt; de Informática,<br />
&lt;<a href="http://www.ufpe.br&gt;&lt;/a&gt;Universidade">http://www.ufpe.br/&gt;Universidade</a>&gt; Federal de Pernambuco, Brazil</p>
<p> Call for Papers<br />
 &lt;<a href="http://wollic.org&gt;&lt;/a&gt;WoLLIC">http://wollic.org/&gt;WoLLIC</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 eighteenth WoLLIC will be held at the University of Pennsylvania, Philadelphia, USA, from May 18th<br />
to 21st, 2011. It is sponsored by the &lt;<a href="http://www.aslonline.org&gt;&lt;/a&gt;Association">http://www.aslonline.org/&gt;Association</a> for Symbolic Logic (ASL), the<br />
&lt;<a href="http://www.cin.ufpe.br/~igpl&gt;Interest">http://www.cin.ufpe.br/~igpl&gt;Interest</a> Group in Pure and Applied Logics (IGPL), the &lt;<a href="http://www.folli.org&gt;&lt;/a&gt;The">http://www.folli.org/&gt;The</a> Association for Logic, Language and Information (FoLLI), the &lt;<a href="http://www.eatcs.org&gt;&lt;/a&gt;European">http://www.eatcs.org/&gt;European</a> Association for<br />
 Theoretical Computer Science (EATCS), the &lt;<a href="http://www.sbc.org.br&gt;&lt;/a&gt;Sociedade">http://www.sbc.org.br/&gt;Sociedade</a> Brasileira de Computação (SBC), and the &lt;<a href="http://www.cle.unicamp.br/sbl&gt;&lt;/a&gt;Sociedade">http://www.cle.unicamp.br/sbl/&gt;Sociedade</a> Brasileira de Lógica (SBL).</p>
<p>Special Event<br />
(tba)<br />
Paper submission<br />
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<br />
 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&#8217;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 2011 EasyChair website. (Please go to<br />
&lt;<a href="http://wollic.org/wollic2011/instructions.html&gt;http://wollic.org/wollic2011/instructions.html">http://wollic.org/wollic2011/instructions.html&gt;http://wollic.org/wollic2011/instructions.html</a>&gt;<br />
for instructions.) A title and single-paragraph abstract should be submitted by January 1st, and the full paper by January 8 (firm date). Notifications are expected by February 21, and final papers for the proceedings will be due by March 1 (firm date).</p>
<p>Proceedings<br />
The proceedings of WoLLIC 2011, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer&#8217;s &lt;<a href="http://www.springer.com/lncs&gt;LNCS">http://www.springer.com/lncs&gt;LNCS</a> series. 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 2011 issue of a scientific journal (soon to be announced).</p>
<p>Invited Speakers<br />
(tba)</p>
<p>Student Grants<br />
ASL sponsorship of WoLLIC 2011 will permit ASL student members to apply for a modest travel grant. See<br />
&lt;<a href="http://www.aslonline.org/studenttravelawards.html&gt;http://www.aslonline.org/studenttravelawards.html">http://www.aslonline.org/studenttravelawards.html&gt;http://www.aslonline.org/studenttravelawards.html</a>&gt;<br />
for details.<br />
Important Dates<br />
January 1, 2011: Paper title and abstract deadline<br />
January 8, 2011: Full paper deadline (firm)<br />
February 21, 2011: Author notification<br />
March 1, 2011: Final version deadline (firm)<br />
Programme Committee<br />
Krzysztof Apt (Amsterdam) (tbc)<br />
&lt;<a href="http://web.cs.gc.cuny.edu/~sartemov&gt;&lt;/a&gt;Sergei">http://web.cs.gc.cuny.edu/~sartemov/&gt;Sergei</a> Artemov (New York)<br />
&lt;<a href="http://www.andrew.cmu.edu/user/avigad&gt;&lt;/a&gt;Jeremy">http://www.andrew.cmu.edu/user/avigad/&gt;Jeremy</a> Avigad (Pittsburgh)<br />
&lt;<a href="http://www.cs.swan.ac.uk/~csarnold&gt;&lt;/a&gt;Arnold">http://www.cs.swan.ac.uk/~csarnold/&gt;Arnold</a> Beckman (Swansea)<br />
&lt;<a href="http://www.mi.ras.ru/~bekl&gt;&lt;/a&gt;Lev">http://www.mi.ras.ru/~bekl/&gt;Lev</a> Beklemishev (Moscow) (CHAIR)<br />
&lt;<a href="http://www.dm.unipi.it/~berardu&gt;&lt;/a&gt;Alessandro">http://www.dm.unipi.it/~berardu/&gt;Alessandro</a> Berarducci (Pisa)<br />
&lt;<a href="http://www.math.lsa.umich.edu/~ablass&gt;&lt;/a&gt;Andreas">http://www.math.lsa.umich.edu/~ablass/&gt;Andreas</a> Blass (Ann Arbor) (tbc)<br />
&lt;<a href="http://www.math.ucsd.edu/~sbuss&gt;&lt;/a&gt;Sam">http://www.math.ucsd.edu/~sbuss/&gt;Sam</a> Buss (San Diego)<br />
&lt;<a href="http://www.cs.bham.ac.uk/~axj&gt;&lt;/a&gt;Achim">http://www.cs.bham.ac.uk/~axj/&gt;Achim</a> Jung (Birmingham)<br />
&lt;<a href="http://staff.science.uva.nl/~bloewe&gt;&lt;/a&gt;Benedikt">http://staff.science.uva.nl/~bloewe/&gt;Benedikt</a> Löwe (Amsterdam)<br />
&lt;<a href="http://www.cs.technion.ac.il/~janos&gt;&lt;/a&gt;Janos">http://www.cs.technion.ac.il/~janos/&gt;Janos</a> Makowski (Haifa)<br />
&lt;<a href="http://www.let.uu.nl/~ctl/docenten/moortgat.html&gt;Michael">http://www.let.uu.nl/~ctl/docenten/moortgat.html&gt;Michael</a> Moortgat (Utrecht)<br />
&lt;<a href="http://www.dtc.umn.edu/~odlyzko&gt;&lt;/a&gt;Andrew">http://www.dtc.umn.edu/~odlyzko/&gt;Andrew</a> Odlyzko (Minneapolis) (tbc)<br />
&lt;<a href="http://www.phil.uu.nl/~oostrom&gt;&lt;/a&gt;Vincent">http://www.phil.uu.nl/~oostrom/&gt;Vincent</a> van Oostrom (Utrecht)<br />
&lt;<a href="http://www.cs.mcgill.ca/~prakash&gt;&lt;/a&gt;Prakash">http://www.cs.mcgill.ca/~prakash/&gt;Prakash</a> Panangaden (Montréal)<br />
&lt;<a href="http://www.sci.brooklyn.cuny.edu/cis/parikh&gt;&lt;/a&gt;Rohit">http://www.sci.brooklyn.cuny.edu/cis/parikh/&gt;Rohit</a> Parikh (New York)<br />
&lt;<a href="http://www.cis.upenn.edu/~pereira&gt;&lt;/a&gt;Fernando">http://www.cis.upenn.edu/~pereira/&gt;Fernando</a> Pereira (Philadelphia) (tbc)<br />
&lt;<a href="http://www.cin.ufpe.br/~ruy&gt;Ruy">http://www.cin.ufpe.br/~ruy&gt;Ruy</a> de Queiroz (Recife)<br />
&lt;<a href="http://www.poncelet.ru/pers/shen.htm&gt;Alexander">http://www.poncelet.ru/pers/shen.htm&gt;Alexander</a> Shen (Marseilles and Moscow)<br />
&lt;<a href="http://www.cs.ru.nl/~spitters&gt;&lt;/a&gt;Bas">http://www.cs.ru.nl/~spitters/&gt;Bas</a> Spitters (Nijmegen)<br />
&lt;<a href="http://www7.in.tum.de/~veith&gt;&lt;/a&gt;Helmut">http://www7.in.tum.de/~veith/&gt;Helmut</a> Veith (Wien)<br />
&lt;<a href="http://staff.science.uva.nl/~yde&gt;&lt;/a&gt;Yde">http://staff.science.uva.nl/~yde/&gt;Yde</a> Venema (Amsterdam) (tbc)<br />
&lt;<a href="http://www.cis.upenn.edu/~weinstei&gt;&lt;/a&gt;Scott">http://www.cis.upenn.edu/~weinstei/&gt;Scott</a> Weinstein (Philadelphia)<br />
&lt;<a href="http://www.csc.liv.ac.uk/~frank&gt;&lt;/a&gt;Frank">http://www.csc.liv.ac.uk/~frank/&gt;Frank</a> Wolter (Liverpool)</p>
<p>Organising Committee<br />
&lt;<a href="http://www.math.upenn.edu/~vnigam&gt;&lt;/a&gt;Vivek">http://www.math.upenn.edu/~vnigam/&gt;Vivek</a> Nigam (UPenn)<br />
&lt;<a href="http://www.cin.ufpe.br/~ago&gt;Anjolina">http://www.cin.ufpe.br/~ago&gt;Anjolina</a> de Oliveira (U Fed Pernambuco)<br />
&lt;<a href="http://www.cin.ufpe.br/~ruy&gt;Ruy">http://www.cin.ufpe.br/~ruy&gt;Ruy</a> de Queiroz (U Fed Pernambuco) (cochair)<br />
&lt;<a href="http://www.cis.upenn.edu/~scedrov&gt;&lt;/a&gt;Andre">http://www.cis.upenn.edu/~scedrov/&gt;Andre</a> Scedrov (UPenn) (co-chair)</p>
<p>Steering Committee<br />
Samson Abramksy, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Daniel Leivant, Angus Macintyre, Grigori Mints, Hiroakira Ono, Ruy de Queiroz.</p>
<p>Further information<br />
Contact one of the Co-Chairs of the Organising Committee.</p>
<p>Web page<br />
&lt;<a href="http://wollic.org/wollic2011&gt;&lt;/a&gt;http://wollic.org/wollic2011/">http://wollic.org/wollic2011/&gt;http://wollic.org/wollic2011/</a></p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=3110</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Workshop on Comparing Logical Decision Methods/University of Edinburgh</title>
		<link>http://loriweb.org/?p=2968</link>
		<comments>http://loriweb.org/?p=2968#comments</comments>
		<pubDate>Wed, 26 May 2010 06:47:48 +0000</pubDate>
		<dc:creator>Sunxin</dc:creator>
				<category><![CDATA[Activities]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Conference and workshop announcements]]></category>
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=2968</guid>
		<description><![CDATA[[ Thursday, July 15, 2010; ]  Edinburgh, July 15th, 2010
 affiliated with LICS and IJCAR

TOPIC AND OBJECTIVE:
Methods for deciding satisfiability of formulae are of vital  importance for both the theoretical relevance and practical impact of a logic. Different logics require different decision procedures. Nevertheless, certain methodologies like terminating semantic tableaux, automata, games, SAT/SMT methods, resolution, reductions, etc. have proved to be successful in providing decidability results for [...]]]></description>
			<content:encoded><![CDATA[<table class="ec3_schedule"><tr><td colspan="3">Thursday, July 15, 2010</td></tr></table><p> Edinburgh, July 15th, 2010<br />
 affiliated with LICS and IJCAR</p>
<p>TOPIC AND OBJECTIVE:<br />
<span style="color: #0000ff">Methods for deciding satisfiability</span> of formulae are of vital  importance for both the theoretical relevance and practical impact of a logic. Different logics require different decision procedures. Nevertheless, certain methodologies like terminating semantic tableaux, automata, games, SAT/SMT methods, resolution, reductions, etc. have proved to be successful in providing decidability results for several, even quite different logics.  <br />
      Perception of some methodology being better than others has grown within certain communities, for example regarding automata-based techniques in automatic verification or tableau-based techniques in knowledge representation. Such perception, however, is often not based on systematic comparative analysis. Sometimes, different methodologies also turn out to do or even be the same in certain cases. Yet, few formal technical results to that effect are known, and the scientific discussions on the pros and cons, and similarities and differences between different methodologies have been rather sporadic so far.<br />
     The purpose of this workshop is to provide an expert forum for such discussion, to provoke and foster discussion between communities, and to stimulate further research on that topic. It is a generalization and follow-up of the AutoTab workshop which was held with TABLEAUX&#8217;09 last year.<br />
WORKSHOP PROGRAM COMMITTEE:<br />
 Stephane Demri,               CNRS Cachan,        F<br />
 Valentin Goranko (co-chair),  TU of Denmark,      DK<br />
 Rajeev Gore,                  ANU Canberra,       AUS<br />
 Felix Klaedtke,               ETH Zurich,         CH<br />
 Daniel Kröning,               Oxford University,  UK<br />
 Martin Lange (co-chair),      Univ. of Kassel,    D<br />
 Christof Löding,              RWTH Aachen,        D<br />
 Carsten Lutz,                 Univ. of Bremen,    D<br />
 Renate Schmidt,               Univ. of Liverpool, UK<br />
 Colin Stirling,               Univ. of Edinburgh, UK</p>
<p> INVITED TALKS:<br />
 <span style="color: #0000ff"><strong><span style="color: #000000">Moshe Vardi</span></strong></span>, Rice University, TX, US:<br />
 <span style="color: #0000ff">Symbolic Techniques in Propositional Satisfiability Solving</span></p>
<p> <span style="color: #0000ff"><strong><span style="color: #000000">Jerome Leroux</span></strong></span>, LaBRI, Bordeaux, FR:<br />
 <span style="color: #0000ff">Presburger Automata<br />
</span><br />
 <span style="color: #0000ff"><strong><span style="color: #000000">Yevgeny Kazakov</span></strong></span>, Oxford, UK:<br />
 <span style="color: #0000ff">Consequence-Based Reasoning for Description Logic Ontologies</span></p>
<p> CONTRIBUTED TALKS AND WORKSHOP PROGRAMME:<br />
 See <a href="http://www2.imm.dtu.dk/~vfgo/CLODEM2010/CLODEM2010%20Programme.html">http://www2.imm.dtu.dk/~vfgo/CLODEM2010/CLODEM2010%20Programme.html</a></p>
<p> REGISTRATION:<br />
 Through the FLoC&#8217;2010 registration site<br />
FURTHER INFORMATION:<br />
Workshop dinner: We intend to organize a dinner for the participants of the workshop on July 15. At this stage the budget of the workshop is unknown, so we cannot make any commitment for covering, partly or in full, the cost of the dinner.<br />
Workshop website:<br />
      <a href="http://www2.imm.dtu.dk/~vfgo/CLODEM2010/CLODEM2010.html">http://www2.imm.dtu.dk/~vfgo/CLODEM2010/CLODEM2010.html</a><br />
FLoC workshop website:<br />
      <a href="http://www.floc-conference.org/CLoDeM-home.html">http://www.floc-conference.org/CLoDeM-home.html</a><br />
FLoC&#8217;10 website:   <a href="http://www.floc-conference.org/">http://www.floc-conference.org/</a><br />
LICS&#8217;10 website:<br />
      <a href="http://www2.informatik.hu-berlin.de/lics/lics10/index.html">http://www2.informatik.hu-berlin.de/lics/lics10/index.html</a><br />
IJCAR&#8217;10 website:   <a href="http://www.floc-conference.org/IJCAR-home.html">http://www.floc-conference.org/IJCAR-home.html</a></p>
<p> ENQUIRIES to the organizers:<br />
 Valentin Goranko, <a href="http://www2.imm.dtu.dk/~vfgo">http://www2.imm.dtu.dk/~vfgo</a><br />
 Martin Lange,     <a href="http://www.tcs.ifi.lmu.de/~mlange">http://www.tcs.ifi.lmu.de/~mlange</a></p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=2968</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CfP: GAMES 2010</title>
		<link>http://loriweb.org/?p=2770</link>
		<comments>http://loriweb.org/?p=2770#comments</comments>
		<pubDate>Tue, 04 May 2010 09:00:04 +0000</pubDate>
		<dc:creator>Rasmus Rendsvig</dc:creator>
				<category><![CDATA[Activities]]></category>
		<category><![CDATA[Call for papers]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Conference and workshop announcements]]></category>
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=2770</guid>
		<description><![CDATA[[ Thursday, July 1, 2010; Sunday, September 19, 2010 to Thursday, September 23, 2010. ] 


GAMES 2010
Annual Workshop of the ESF Networking Programme on
Games for Design and Verification
September 19 - 23, 2010
St Anne's College, Oxford, UK
http://www.comlab.ox.ac.uk/games2010
CALL FOR CONTRIBUTIONS
The ESF Networking Programme on Games for Design and Verification is a European Network pursuing research and training on the design and verification of computing systems.  This network proposes a research and [...]]]></description>
			<content:encoded><![CDATA[<table class="ec3_schedule"><tr><td colspan="3">Thursday, July 1, 2010</td></tr><tr><td class="ec3_start">Sunday, September 19, 2010</td><td class="ec3_to">to</td><td class="ec3_end">Thursday, September 23, 2010</td></tr></table><p><BR><br />
<BR></p>
<p style="text-align: center;"><strong>GAMES 2010</strong><br />
Annual Workshop of the ESF Networking Programme on<br />
Games for Design and Verification<br />
September 19 &#8211; 23, 2010<br />
St Anne&#8217;s College, Oxford, UK<br />
<a href="http://www.comlab.ox.ac.uk/games2010">http://www.comlab.ox.ac.uk/games2010</a><br />
<strong>CALL FOR CONTRIBUTIONS</strong></p>
<p>The ESF Networking Programme on Games for Design and Verification is a European Network pursuing research and training on the design and verification of computing systems.  This network proposes a research and training programme for the design and verification of computing systems, using a methodological framework that is based on the interplay of finite and infinite games, mathematical logic and automata theory.  For details, see <a href="www.games.rwth-aachen.de/">www.games.rwth-aachen.de/</a></p>
<p>GAMES is the annual workshop of the Network. This year&#8217;s GAMES workshop will be held at St. Anne&#8217;s College Oxford. More information about the games workshop can be found at <a href="http://www.comlab.ox.ac.uk/games2010">http://www.comlab.ox.ac.uk/games2010</a>.</p>
<p><strong>SCOPE:</strong><br />
The scope of the workshop includes the mathematical and algorithmic analysis of finite and infinite games, the interplay of games with automata theory and logic, and applications of games, automata, and logic to the design and verification of computing systems.</p>
<p><strong>PROGRAMME:</strong><br />
As in previous years, GAMES 2010 will be an informal workshop, without proceedings. Its programme consists of six invited tutorials, contributed talks (30 min) and short presentations (15 min). Contributed talks and short presentations will be selected by the programme committee on the basis of submitted abstracts. GAMES 2010 will also feature an open problem session, which will consist of very short (10 min) descriptions of interesting open problems about games.</p>
<p><strong>INVITED TUTORIALS:</strong><br />
- Roderick Bloem   (TU Graz, Austria)<br />
- Thomas Colcombet (Liafa, Paris 7, France)<br />
- Fedor Fomin (Bergen, Norway)<br />
- Paul Goldberg (Liverpool, UK)<br />
- Tristan Tomala  (HEC, Paris, France)<br />
- Wieslaw Zielonka (Liafa, Paris 7, France)</p>
<p><strong>SUBMISSIONS:</strong><br />
Researchers who would like to present a talk at GAMES 2010 are invited to<br />
submit an extended abstract of up to two pages by email to <a href="mailto:games2010@comlab.ox.ac.uk">games2010@comlab.ox.ac.uk</a> by 1st July 2010. Decisions about acceptance will be made by 1st August 2010.</p>
<p><strong>IMPORTANT DATES</strong><br />
Paper submission:    1st July 2010<br />
Author notification: 1st August 2010<br />
Workshop:            20-23 September 2010</p>
<p><strong>SUPPORT:</strong><br />
We will be able to cover travel and accommodation costs for a limited number of participants (especially students). For information, please contact <a href="mailto:games2010@comlab.ox.ac.uk">games2010@comlab.ox.ac.uk</a>. There will be no registration fee.</p>
<p><strong>LOCATION:</strong><br />
The workshop will be held in the Mary Ogilvie Lecture Theatre at St Anne&#8217;s College, Oxford UK. See http://www.st-annes.ox.ac.uk/ for information about the venue.</p>
<p><strong>PROGRAMME COMMITTEE:</strong><br />
- Dietmar Berwanger (ENS Cachan)<br />
- Mikokaj Bojanczyk (Warsaw)<br />
- Patricia Bouyer (ENS Cachan)<br />
- Erich Graedel (Aachen)<br />
- Stephan Kreutzer (Oxford)<br />
- Jean-Francois Raskin (Brussels)<br />
- Helmut Veith (TU Vienna)<br />
- James Worrell (Oxford)</p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=2770</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>1st Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2010)</title>
		<link>http://loriweb.org/?p=2674</link>
		<comments>http://loriweb.org/?p=2674#comments</comments>
		<pubDate>Thu, 15 Apr 2010 07:00:45 +0000</pubDate>
		<dc:creator>Rasmus Rendsvig</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Conference and workshop announcements]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=2674</guid>
		<description><![CDATA[1st Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2010), Minori, Italy
The aim of the symposium is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to concrete [...]]]></description>
			<content:encoded><![CDATA[<p><strong>1st Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2010), Minori, Italy</strong></p>
<p>The aim of the symposium is to bring together researchers from academia and industry which are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to concrete applications, and to stimulate cross-fertilization.</p>
<p>Authors are invited to submit original research or tool papers on any relevant topic in these areas. Papers discussing new ideas that are at an early stage of development are also welcome. Papers focused on formal methods are especially welcome. <del datetime="2010-04-14T11:41:11+00:00">Abstract submission deadline: March 21, 2010</del></p>
<p>For more information, see <a href="http://gandalf.dia.unisa.it/">http://gandalf.dia.unisa.it/</a></p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=2674</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Univ. of Groningen: Carlos Areces &#8212; To B or not to B, is that the question?</title>
		<link>http://loriweb.org/?p=2583</link>
		<comments>http://loriweb.org/?p=2583#comments</comments>
		<pubDate>Mon, 29 Mar 2010 07:00:38 +0000</pubDate>
		<dc:creator>Rasmus Rendsvig</dc:creator>
				<category><![CDATA[Activities]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Courses, seminars and special lectures]]></category>
		<category><![CDATA[Reasoning]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=2583</guid>
		<description><![CDATA[[ Thursday, April 1, 2010; 3:30 pm; ] 


On 1 April, Carlos Areces (INRIA) will be giving a talk entitled 'To B or not to B, is that the question?" at the University of Groningen (Bernoulliborg, Room 293):

Abstract: In this lecture, I will talk about Logic from a computational point of view. In particular, I will review a number of logical languages (propositional [...]]]></description>
			<content:encoded><![CDATA[<table class="ec3_schedule"><tr><td colspan="3">Thursday, April 1, 2010</td></tr><tr><td colspan="3">3:30 pm</td></tr></table><p><BR><br />
<BR></p>
<p>On 1 April, <strong>Carlos Areces</strong> (INRIA) will be giving a talk entitled &#8216;<strong><em>To B or not to B, is that the question?&#8221;</em></strong> at the University of Groningen (Bernoulliborg, Room 293):</p>
<p><strong>Abstract: </strong>In this lecture, I will talk about Logic from a computational point of view. In particular, I will review a number of logical languages (propositional logic, first order logic, modal logics), present some classical reasoning tasks (model checking, satisfiability checking) and discuss their properties. These classical inference tasks have been investigated in detail and their characteristics are, in many cases, well known. I will then discuss other reasoning tasks (model equivalence, retrieval, verification, model building). Some of them can be seen as more complex reasoning tasks defined in terms of satisfiability and model checking. But I will argue that they deserve to be treated as first class citizens. We will even dare question the basic definition of what a satisfiability relation should be: Should we evaluate a formula in a model, or rather `evaluate a model in a formula&#8217;.</p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=2583</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CfP: Automated Reasoning about Context and Ontology Evolution Workshop at ECAI-10</title>
		<link>http://loriweb.org/?p=2576</link>
		<comments>http://loriweb.org/?p=2576#comments</comments>
		<pubDate>Wed, 24 Mar 2010 07:00:32 +0000</pubDate>
		<dc:creator>Rasmus Rendsvig</dc:creator>
				<category><![CDATA[Activities]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Call for papers]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Conference and workshop announcements]]></category>
		<category><![CDATA[Knowledge Representation]]></category>
		<category><![CDATA[Non-Monotonic Reasoning]]></category>
		<category><![CDATA[Reasoning]]></category>

		<guid isPermaLink="false">http://loriweb.org/?p=2576</guid>
		<description><![CDATA[[ Monday, August 16, 2010 to Tuesday, August 17, 2010. ] 

Call for Participation
The ECAI-10 Workshop on
Automated Reasoning about Context and Ontology Evolution (ARCOE-10)
http://www.arcoe.org/2010/
held on August 16-17, 2010
at the European Conference on Artificial Intelligence (ECAI-10)
http://ecai2010.appia.pt/
Description of the workshop

Methods of automated reasoning have solved a large number of problems in Computer Science by using formal ontologies expressed in logic. Over the years, though, each problem or class [...]]]></description>
			<content:encoded><![CDATA[<table class="ec3_schedule"><tr><td class="ec3_start">Monday, August 16, 2010</td><td class="ec3_to">to</td><td class="ec3_end">Tuesday, August 17, 2010</td></tr></table><p><BR></p>
<p style="text-align: center;"><strong>Call for Participation</strong></p>
<p style="text-align: center;">The ECAI-10 Workshop on</p>
<p style="text-align: center;"><strong>Automated Reasoning about Context and Ontology Evolution (ARCOE-10)</strong><br />
<a href="http://www.arcoe.org/2010/">http://www.arcoe.org/2010/</a></p>
<p style="text-align: center;">held on August 16-17, 2010</p>
<p style="text-align: center;">at the <strong>European Conference on Artificial Intelligence (ECAI-10)</strong><br />
<a href="http://ecai2010.appia.pt/">http://ecai2010.appia.pt/</a></p>
<p><strong>Description of the workshop</strong></p>
<p>Methods of automated reasoning have solved a large number of problems in Computer Science by using formal ontologies expressed in logic. Over the years, though, each problem or class of problems has required a different ontology, and sometimes a different version of logic. Moreover, the processes of conceiving, controlling and maintaining an ontology and its versions have turned out to be inherently complex. All this has motivated much investigation in a wide range of disparate disciplines &#8212; from logic-based Knowledge Representation and Reasoning to Software Engineering, from Databases to Multimedia &#8212; about how to relate ontologies to one another.</p>
<p>ARCOE-10 aims at bringing together researchers and practitioners from core areas of Artificial Intelligence (Knowledge Representation and Reasoning, Contexts, and Ontologies) to discuss these kinds of problems and relevant results. Historically, there have been at least three different, yet interdependent motivations behind this type of research: defining the relationship between an ontology and its context, providing support to ontology engineers, enhancing problem solving and communication for software agents.</p>
<p><strong>Ontology and Context.</strong> Most application areas have recognised the need for representing and reasoning about knowledge that is distributed over many resources. Such knowledge depends on its context, i.e., on the syntactic and/or semantic structure of such resources. Research on information integration, distributed knowledge management, the semantic web, multi-agent and distributed reasoning have pinned down different aspects of how ontologies relate to and/or develop within their context.</p>
<p><strong>Ontology Engineering.</strong> Ontology engineers are not supposed to succeed right from the beginning when (individually or collaboratively) developing an ontology. Despite their expertise and any assistance from domain experts, revision cycles are the rule. Research on the automation of the process of engineering an ontology has improved efficiency and reduced the introduction of unintended meanings by means of interactive ontology editors. Moreover, ontology matching has studied the process of manual, off-line alignment of two or more known ontologies.</p>
<p><strong>Problem Solving and Communication for Agents.</strong> Agents that communicate with one another without having full access to their respective ontologies or that are programmed to face new non-classifiable situations must change their own ontology dynamically at run-time &#8212; they cannot rely on human intervention. Research on this problem has either concentrated on non-monotonic reasoning and belief revision or on changes of signature, i.e., of the grammar of the ontology&#8217;s language, with a minimal disruption to the original theory.</p>
<p>ARCOE-10 will provide a multi-disciplinary forum, where differences in methodologies, representation languages and techniques are over-arched and hopefully overcome. Accordingly, the workshop will be structured into four tracks: three of them will focus on specific areas, the fourth one will foster links and integration.</p>
<p><em>Track 1:  Context and Ontology</em><br />
This track will select and present works about Context and Ontology, a well-established research area that has mainly concentrated on the relationship between contexts and ontologies for distributed information and for the enhancement of software agents.</p>
<p><em>Track 2:  Common Sense and Non-Monotonic Reasoning for Ontologies</em><br />
This track will select and present works about logic-based Knowledge Representation and Reasoning, a classic area of AI, which since its origins has produced remarkable results on logic-based methods for supporting knowledge engineers and for enhancing software agents.</p>
<p><em>Track 3:  Automated Ontology Evolution</em><br />
This track will select and present works about Automated Ontology Evolution, an area which in recent years has been drawing the attention of Artificial Intelligence and Knowledge Representation and Reasoning on the automation of ontology evolution.</p>
<p><em>Track 4: Links and integration</em><br />
This track will foster links and integration by means of invited talks and (panel) discussions. Topics that are likely to be covered are: the formalisation of software engineering concepts for ontology development; the relationship between automated reasoning and information retrieval; relationships between representation languages; relationships between canonical domains; relationships between contexts and ontology evolution and between Non-Monotonic Reasoning and ontology evolution.</p>
<p>ARCOE-10 will bring the participants to position the various approaches with respect to one another. Hopefully, though, the workshop will also start a process of cross-pollination and set out the constitution of a truly interdisciplinary research-community dedicated to automated reasoning about contexts and ontology evolution.</p>
<p><strong>Topics</strong></p>
<p><em>Track 1: Context and Ontology </em><br />
Submissions are welcome on the role of context and ontology in areas that include but are not limited to the following ones:</p>
<p>- Information Integration<br />
- The role of context and ontology in Distributed Reasoning and Knowledge Management<br />
- The role of context and ontology in Semantic Web<br />
- Multi-Agent Systems<br />
- Data Grid and Grid Computing<br />
- Pervasive Computing and Ambient Intelligence<br />
- Peer-to-peer Information Systems<br />
- Comparison of uses of contexts and ontologies</p>
<p><em>Track 2: Common Sense and Non-Monotonic Reasoning </em><br />
Submissions are welcome on the role of common sense and non-monotonic reasoning for ontologies in areas that include but are not limited to the following ones:</p>
<p>- Ontology Debugging, Update and Merging<br />
- Inconsistency Handling, Belief Revision and Theory Change for DL ontologies<br />
- Uncertainty Handling, Defeasible Reasoning and Argumentation in ontologies<br />
- Heuristic and Approximate Reasoning<br />
- Planning and Reasoning about Action and Change on the Semantic Web<br />
- Rules and Ontologies<br />
- Temporal and Spatial Reasoning</p>
<p><em>Track 3: Automated Ontology Evolution </em><br />
Submissions are welcome on the role of automated ontology evolution in areas that include but are not limited to the following ones:</p>
<p>- Ontology fault diagnosis and repair<br />
- Problem Solving<br />
- Agent Communication<br />
- Persistent Agents in Changing Environment<br />
- Multimedia on the Web<br />
- IT and Automated Reasoning</p>
<p><strong>Attendance</strong></p>
<p>Authors will be selected on significance of their submission and will be preferred to simple attendees. Attendees will be selected on a first-come-first-served basis. Please check http://ecai2010.appia.pt/ for registration procedure and fees.</p>
<p><strong>Submission Requirements and Dates</strong></p>
<p>ARCOE-10 will accept submissions of long abstracts, for both long presentations and poster presentations. The distinction during the selection-phase will be based on the significance and the quality of submissions as well as oriented towards fostering cross-pollination and discussions during the event. All selected abstracts will be included in the Working Notes. Authors are kindly requested to provide keywords upon submission. The format for submissions is the same as that of ECAI-10. Please check <a href="http://ecai2010.appia.pt/index.php?option=com_content&amp;task=view&amp;id=44&amp;Itemid=69">http://ecai2010.appia.pt/index.php?option=com_content&amp;task=view&amp;id=44&amp;Itemid=69</a> for the style files. Submissions should be no longer than 3 pages.</p>
<p>Abstract submission:   <strong>May 7, 2010</strong><br />
Notification:          June 7, 2010<br />
Camera ready:          June 21, 2010<br />
Early registration:  T.B.A.<br />
Late registration:  T.B.A.<br />
Workshop:          August 16-17, 2010</p>
<p><strong>Submit to</strong></p>
<p>Please submit to <a href="https://www.easychair.org/login.cgi?conf=arcoe10">https://www.easychair.org/login.cgi?conf=arcoe10</a></p>
<p><strong>Workshop Co-Chairs</strong></p>
<p><strong>Alan Bundy</strong><br />
School of Informatics, University of Edinburgh, Informatics Forum, 10 Crichton Street, Edinburgh EH8 9AB, UK.<br />
Tel: +44-131-650-2716, Fax No.: +44-131-650-6899,  website: <a href="http://homepages.inf.ed.ac.uk/bundy">http://homepages.inf.ed.ac.uk/bundy</a></p>
<p><strong>Jos Lehmann</strong> (primary contact)<br />
School of Informatics, University of Edinburgh, Informatics Forum, 10 Crichton Street, Edinburgh EH8 9AB, UK.<br />
Tel: +44-131-650-2725, Fax No.: +44-131-650-6899,  website: <a href="http://www.inf.ed.ac.uk/people/staff/Jos_Lehmann.html">http://www.inf.ed.ac.uk/people/staff/Jos_Lehmann.html</a></p>
<p><strong>Guilin Qi</strong><br />
School of Computer Science and Engineering, Southeast University, 211189, Jiangning District, Nanjing, China.<br />
Fax: +86-25-52090880, website: <a href="http://cse.seu.edu.cn/people/qgl/index_en.htm">http://cse.seu.edu.cn/people/qgl/index_en.htm</a></p>
<p><strong>Ivan José Varzinczak</strong><br />
Meraka Institute, Meiring Naude Road, CSIR, 0001 Pretoria, South Africa.<br />
Tel: +27-12-841-25-94, website: <a href="http://en.varzinczak.net16.net">http://en.varzinczak.net16.net</a></p>
<p><strong>Program Committee</strong></p>
<p>- Grigoris Antoniou (FORTH, Greece)<br />
- Franz Baader (TU Dresden, Germany)<br />
- Richard Booth (University of Luxembourg and Mahasarakham University, Thailand)<br />
- Paolo Bouquet (University of Trento, Italy)<br />
- Jerome Euzenat (INRIA Grenoble Rhone-Alpes, France)<br />
- Giorgos Flouris (FORTH, Greece)<br />
- Chiara Ghidini (FBK Fondazione Bruno Kessler, Italy)<br />
- Deborah McGuinness (Rensselaer Polytechnic Institute, USA)<br />
- Thomas Meyer (Meraka Institute, South Africa)<br />
- Maurice Pagnucco (The University of New South Wales, Australia)<br />
- Valeria de Paiva (Cuil Inc., USA)<br />
- Jeff Pan (University of Aberdeen, UK)<br />
- Dimitris Plexousakis FORTH, Greece)<br />
- Luciano Serafini (FBK Fondazione Bruno Kessler, Italy)<br />
- Renata Wassermann (Universidade de Sao Paulo, Brazil)</p>
]]></content:encoded>
			<wfw:commentRss>http://loriweb.org/?feed=rss2&amp;p=2576</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
