[isabelle] PRNCL 2009 - Workshop on Proofs and Refutations in Non-Classical Logics
- To: event at in.tu-clausthal.de, compulognet-parimp at dia.fi.upm.es, coq-club at pauillac.inria.fr, dbworld at cs.wisc.edu, dl at dl.kr.org, eccai-individuals at uni-koblenz.de, kgs at logic.tuwien.ac.at, kr at kr.org, rewriting at ens-lyon.fr, relmics-l at McMaster.CA, acl2 at cs.utexas.edu, agents at cs.umbc.edu, aiia at dis.uniroma1.it, aiia at di.unito.it, saarlor at loria.fr, logic-list at helsinki.fi, theorem-provers at ai.mit.edu, theory-logic at cs.cmu.edu, loginf at lat.inf.tu-dresden.de, vki-list at dfki.de, comlab at comlab.ox.ac.uk, complog at cs.nmsu.edu, fg214 at informatik.uni-kiel.de, finite-model-theory at lists.rwth-aachen.de, fmics at inrialpes.fr, isabelle-users at cl.cam.ac.uk, lfcs-interest at dcs.ed.ac.uk, lfg at lists.stanford.edu, ccl at ps.uni-sb.de, clean-list at cs.kun.nl, caml-list at inria.fr, colibri at let.uu.nl, meta-announce at cwi.nl
- Subject: [isabelle] PRNCL 2009 - Workshop on Proofs and Refutations in Non-Classical Logics
- From: Roy Dyckhoff <rd at cs.st-andrews.ac.uk>
- Date: Tue, 7 Apr 2009 03:46:36 +0100
PRNCL 2009 - Workshop on Proofs and Refutations in Non-Classical Logics
(affiliated with Tableaux 2009)
Call for Papers
July 6, 2009, Oslo, Norway
* 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.
This archive was generated by a fusion of
Pipermail (Mailman edition) and