From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.6 required=5.0 tests=AWL autolearn=disabled version=3.1.3 X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105]) by yquem.inria.fr (Postfix) with ESMTP id 3E441BBC1 for ; Wed, 30 Apr 2008 00:02:41 +0200 (CEST) X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: ApoEALY3F0jAXQIm/2dsb2JhbACtEQ X-IronPort-AV: E=Sophos;i="4.25,724,1199660400"; d="scan'208";a="25672482" Received: from discorde.inria.fr ([192.93.2.38]) by mail4-smtp-sop.national.inria.fr with ESMTP; 30 Apr 2008 00:02:40 +0200 Received: from mail2-relais-roc.national.inria.fr (mail2-relais-roc.national.inria.fr [192.134.164.83]) by discorde.inria.fr (8.13.6/8.13.6) with ESMTP id m3TM2c8v010145 (version=TLSv1/SSLv3 cipher=RC4-SHA bits=128 verify=OK) for ; Wed, 30 Apr 2008 00:02:40 +0200 X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AkYCAC84F0iLEwECaWdsb2JhbACRTg0FCAYSBZsQ X-IronPort-AV: E=Sophos;i="4.25,724,1199660400"; d="scan'208";a="10234466" Received: from mpiat0400.mpi-sb.mpg.de (HELO francois.mpi-sb.mpg.de) ([139.19.1.2]) by mail2-smtp-roc.national.inria.fr with ESMTP; 30 Apr 2008 00:02:40 +0200 Received: from loopback.mpi-sb.mpg.de ([127.0.0.1]:39035 helo=localhost ident=amavis) by francois.mpi-sb.mpg.de (envelope-from ) with esmtp (Exim 4.50) id 1JqxuI-0001gc-Pw; Wed, 30 Apr 2008 00:02:38 +0200 Received: from francois.mpi-sb.mpg.de ([127.0.0.1]) by localhost (aspirin.mpi-sb.mpg.de [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 03565-05; Wed, 30 Apr 2008 00:02:38 +0200 (CEST) Received: from newzak.mpi-sb.mpg.de ([139.19.1.28]:51441) by francois.mpi-sb.mpg.de (envelope-from ) with esmtp (Exim 4.50) id 1JqxuE-0001fk-6d; Wed, 30 Apr 2008 00:02:34 +0200 Received: from www-data by newzak.mpi-sb.mpg.de with local (Exim 4.63) (envelope-from ) id 1JqxuE-0004mG-1B; Wed, 30 Apr 2008 00:02:34 +0200 Received: from 217.247.239.231 (SquirrelMail authenticated user sofronie) by mail.mpi-inf.mpg.de with HTTP; Wed, 30 Apr 2008 00:02:34 +0200 (CEST) X-Notes-Item: NOT CHECKED; name=$DNSBLSite Message-ID: <10168.217.247.239.231.1209506554.squirrel@mail.mpi-inf.mpg.de> Date: Wed, 30 Apr 2008 00:02:34 +0200 (CEST) Subject: CFP: CEDAR'08 - Workshop on Complexity, Expressibility and Decidability in Automated Reasoning From: "Viorica Sofronie-Stokkermans" To: ccl@ps.uni-sb.de, caml-list@inria.fr, colibri@let.uu.nl, comlab@comlab.ox.ac.uk, complog@cs.nmsu.edu Cc: sofronie@mpi-inf.mpg.de User-Agent: SquirrelMail/1.4.13 MIME-Version: 1.0 Content-Type: text/plain;charset=iso-8859-15 Content-Transfer-Encoding: 8bit X-Priority: 3 (Normal) Importance: Normal X-Virus-Scanned: by amavisd-new-20030616-p10 (Debian) at mpi-sb.mpg.de X-Miltered: at discorde with ID 48179AFE.000 by Joe's j-chkmail (http://j-chkmail . ensmp . fr)! X-Spam: no; 0.00; decidability:01 decidability:01 undecidable:01 decidable:01 decidable:01 rewriting:01 algebra:01 rewriting:01 lncs:01 lncs:01 baaz:01 sava:01 mpg:98 mpg:98 cedar:98 [We apologize if you receive multiple copies of this announcement] *********************************************************************** * CALL FOR PAPERS * *********************************************************************** * Complexity, Expressibility, and Decidability in Automated Reasoning * * (CEDAR'08) * * http://www.mpi-inf.mpg.de/~sofronie/cedar08.html * * * * Affiliated with IJCAR 2008 Sydney, Australia, 10-15 August 2008 * * http://www.ijcar.org/2008/ * * * *********************************************************************** Decidability, and especially complexity and tractability of logical theories is extremely important for a large number of applications. Although general logical formalisms are undecidable, decidable theories - or fragments thereof - (sometimes even with low complexity) often occur in mathematics, in program verification, in the verification of reactive, real time or hybrid systems, as well as in databases and ontologies. It is therefore important to identify such decidable fragments and design efficient decision procedures for them. It is equally important to have uniform methods (e.g. resolution, rewriting, tableaux, sequent calculi,...) which can be tuned to provide algorithms with optimal complexity. The goal of CEDAR is to bring together researchers interested in problems at the interface between automated reasoning and computational complexity, in particular in: - identifying (fragments of) logical theories which are decidable, resp. have low complexity, and analyzing possibilities of obtaining optimal complexity results with uniform tools; - analyzing decidability in combinations of theories and possibilities of combining decision procedures; - efficient implementations for decidable fragments; - application domains where decidability resp. tractability are crucial. Topics ====== Topics of interest for CEDAR 2008 include (but are not restricted to): - Complexity: - complexity analysis for fragments of first- (or higher) order logic - complexity analysis for combinations of logical theories (including parameterized complexity results) - Expressibility - in logic, automated reasoning, algebra, ... - Decidability: - decision procedures based on logical calculi such as: resolution, rewriting, tableaux, sequent calculi, or natural deduction - decidability in combinations of logical theories - specialized decision procedures - Application domains for which complexity issues are essential (verification, security, databases, ontologies, ...) The goal of CEDAR is to bring together researchers interested in exploring the topics above, both at a theoretical level and motivated by applications, and to enhance the interaction between automated reasoning and computational complexity through invited and contributed talks. Submission and selection procedure: =================================== We plan to accept three types of papers: - Original papers (up to 15 pages, LNCS style, including bibliography); should describe original research and contain sufficient detail to assess the merits and relevance of the contribution. - Work in progress (up to 6 pages, LNCS style, without bibliography). - Presentation-only papers (please submit an abstract of up to 3 pages, LNCS style + a link to the already published paper): may describe work previously published. The abstracts of accepted presentation-only papers will appear in the informal proceedings to be distributed at the workshop (full papers in this category will not be inserted in the proceedings). Given the informal style of the workshop, the submission of papers presenting student's work and work in progress is encouraged. The purpose of the presentation-only papers is to allow researchers to communicate good ideas that the attendees may not be aware of. Submission of papers is via Easychair http://www.easychair.org/conferences/?conf=cedar2008 Publication: ============ The final versions of the selected contributions will be collected in a volume to be distributed at the workshop. These informal proceedings will also be made accessible on the web. Important Dates =============== - 19 May 2008: Submission deadline - 19 June 2008: Notification - 10 July 2008: Final version - 10 August 2008: Workshop Invited speaker - Carsten Lutz (TU Dresden) Program and Workshop Chairs - Franz Baader (TU Dresden) - Silvio Ghilardi (U. Milano) - Miki Hermann (Ecole Polytechnique, Palaiseau) - Ulrike Sattler (U. Manchester) - Viorica Sofronie-Stokkermans (MPI, Saarbruecken) Program Committee - Carlos Areces (INRIA Nancy) - Franz Baader (TU Dresden) - Matthias Baaz (TU Wien) - Maria Paola Bonacina (U. Verona) - Sebastian Brandt (U. Manchester) - Christian Fermueler (TU Wien) - Silvio Ghilardi (U. Milano) - Reiner Haehnle (Chalmers U.) - Miki Hermann (Ecole Polytechnique, Palaiseau) - Felix Klaedtke (ETH Zurich) - Sava Krstic (Intel Corporation) - Christopher Lynch (Clarkson U.) - Bijan Parsia (U. Manchester) - Silvio Ranise (LORIA/INRIA-Lorraine) - Ulrike Sattler (U. Manchester) - Renate Schmidt (U. Manchester) - Viorica Sofronie-Stokkermans (MPI,Saarbruecken) - Lidia Tendera (U. Opole) - Ashish Tiwari (SRI International) - Luca Vigano (U. Verona) - Frank Wolter (U. Liverpool) Contact ======= For further informations please send an e-mail to Viorica Sofronie-Stokkermans (sofronie [at] mpi-inf.mpg.de)