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.9 required=5.0 tests=HTML_10_20,HTML_MESSAGE autolearn=disabled version=3.1.3 Received: from mail2-relais-roc.national.inria.fr (mail2-relais-roc.national.inria.fr [192.134.164.83]) by yquem.inria.fr (Postfix) with ESMTP id 6153FBBAF for ; Tue, 7 Apr 2009 04:47:20 +0200 (CEST) X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AikGAPtb2kmK+84jgWdsb2JhbACCVYpsAYhlAQEWIrQzhA8Ghzs X-IronPort-AV: E=Sophos;i="4.39,334,1235948400"; d="scan'208,217";a="24090725" Received: from mail.cs.st-andrews.ac.uk ([138.251.206.35]) by mail2-smtp-roc.national.inria.fr with ESMTP/TLS/DHE-RSA-AES256-SHA; 07 Apr 2009 04:47:17 +0200 Received: from [87.112.210.31] (helo=[192.168.0.4]) by mail.cs.st-andrews.ac.uk with esmtpsa (TLSv1:AES256-SHA:256) (Exim 4.43) id 1Lr1Ky-0005sV-4l; Tue, 07 Apr 2009 03:46:57 +0100 Mime-Version: 1.0 Message-Id: Date: Tue, 7 Apr 2009 03:46:36 +0100 To: event@in.tu-clausthal.de, compulognet-parimp@dia.fi.upm.es, coq-club@pauillac.inria.fr, dbworld@cs.wisc.edu, dl@dl.kr.org, eccai-individuals@uni-koblenz.de, kgs@logic.tuwien.ac.at, kr@kr.org, rewriting@ens-lyon.fr, relmics-l@McMaster.CA, acl2@cs.utexas.edu, agents@cs.umbc.edu, aiia@dis.uniroma1.it, aiia@di.unito.it, saarlor@loria.fr, logic-list@helsinki.fi, theorem-provers@ai.mit.edu, theory-logic@cs.cmu.edu, loginf@lat.inf.tu-dresden.de, vki-list@dfki.de, comlab@comlab.ox.ac.uk, complog@cs.nmsu.edu, fg214@informatik.uni-kiel.de, finite-model-theory@lists.rwth-aachen.de, fmics@inrialpes.fr, isabelle-users@cl.cam.ac.uk, lfcs-interest@dcs.ed.ac.uk, lfg@lists.stanford.edu, ccl@ps.uni-sb.de, clean-list@cs.kun.nl, caml-list@inria.fr, colibri@let.uu.nl, meta-announce@cwi.nl From: Roy Dyckhoff Subject: PRNCL 2009 - Workshop on Proofs and Refutations in Non-Classical Logics Content-Type: multipart/alternative; boundary="============_-973050080==_ma============" X-Spam: no; 0.00; dyckhoff:01 logics:01 logics:01 dyckhoff:01 pfenning:01 pfenning:01 st-andrews:98 2009:98 2009:98 norway:98 norway:98 abstract:01 abstract:01 proofs:01 proofs:01 --============_-973050080==_ma============ Content-Type: text/plain; charset="us-ascii" ; format="flowed" PRNCL 2009 - Workshop on Proofs and Refutations in Non-Classical Logics (affiliated with Tableaux 2009) Call for Papers July 6, 2009, Oslo, Norway http://www.loria.fr/~galmiche/PRNCL09.html * There are various ways to design a refutation-based deduction system. Deduction systems where refutations completely replace proofs as first-class citizens, with a set of rules inductively defining refutation trees; systems combining proof-rules and refutation mechanisms (or criteria) which can occur at various levels of the proof-search process; systems where provability and refutability play dual roles, i.e., proofs and refutations are both first-class citizens; systems where refutations are understood as mechanisms that build counter-models: for example, semantic information is collected and may converge to a counter-model as the search process evolves. Such approaches are applicable to a wide range of logics like sub-structural logics, intermediate logics and their extensions, modal or temporal logics, even to type theory. The deduction systems can be based on various structures/methods: sequents, tableaux, natural deduction, connections, proof-nets, games, etc. The aim of the workshop is to provide a forum of discussion between researchers interested in non-classical logics in the perspective of proof and refutation systems. * Detailed information about topics and submission can be found on the web page. * Program Committee : R. Dyckhoff (Univ. St Andrews, Scotland); C. Fermueller (T.U. Wien, Austria); D. Galmiche (LORIA - UHP, France); D. Larchey-Wendling (LORIA - CNRS, France); F. Pfenning (CMU Pittsburgh, USA); A. Waaler (Univ. Oslo, Norway) * Important dates: extended abstract submission: May 15, 2009; Notification: June 2, 2009. --============_-973050080==_ma============ Content-Type: text/html; charset="us-ascii" PRNCL 2009 - Workshop on Proofs and Refutations in Non-Cla
PRNCL 2009 - Workshop on Proofs and Refutations in Non-Classical Logics
(affiliated with Tableaux 2009)
Call for Papers
July 6, 2009, Oslo, Norway
http://www.loria.fr/~galmiche/PRNCL09.html

* There are various ways to design a refutation-based deduction system. Deduction systems where refutations completely replace proofs as first-class citizens, with a set of rules inductively defining refutation trees; systems combining proof-rules and refutation mechanisms (or criteria) which can occur at various levels of the proof-search process; systems where provability and refutability play dual roles, i.e., proofs and refutations are both first-class citizens; systems where refutations are understood as mechanisms that build counter-models:  for example, semantic information is collected and may converge to a counter-model as the search process evolves.

Such approaches are applicable to a wide range of logics like sub-structural logics, intermediate logics and their extensions, modal or temporal logics, even to type theory. The deduction systems can be based on various structures/methods: sequents, tableaux, natural deduction, connections, proof-nets, games, etc.
The aim of the workshop is to provide a forum of discussion between researchers interested in non-classical logics in the perspective of proof and refutation systems.
* Detailed information about topics and submission can be found on the web page.

* Program Committee : R. Dyckhoff (Univ. St Andrews, Scotland);
C. Fermueller (T.U. Wien, Austria); D. Galmiche (LORIA - UHP, France);
D. Larchey-Wendling (LORIA - CNRS, France); F. Pfenning (CMU
Pittsburgh, USA); A. Waaler (Univ. Oslo, Norway)

* Important dates: extended abstract submission: May 15, 2009; Notification: June 2, 2009.

--============_-973050080==_ma============--