DISPROVING'07, 2nd CfP



CADE 2007 Workshop on

DISPROVING
Non-Theorems, Non-Validity, Non-Provability

Bremen, Germany,
July 16, 2007

[http://www.cs.chalmers.se/~ahrendt/CADE07-ws-disproving/]

*************************************
* Submission deadline: May 11, 2007 *
*************************************

2nd Call for Papers
===================

Background

Automated Reasoning (AR) traditionally has focused on proving
theorems. Because of this, AR methods and tools in the past were
mostly applied to formulae which were already known to be true. If on
the other hand a formula is not a theorem, then most traditional AR
methods and tools cannot handle this properly (i.e. they will fail,
run out of resources, or simply not terminate). The opposite of
proving, which we call disproving, particularly aims at identifying
non-theorems, i.e. showing non-validity resp. non-provability, and
providing some kind of proof of non-validity (non-provability). The
proof for example could be a counter model, or an instantiation making
the formula false.

Scope

In the scope of the workshop is every method that is able to discover
non-theorems and, ideally, provides explanation why the formula is not
a theorem. Possible subjects are decision procedures, model generation
methods, reduction to SAT, formula simplification methods, abstraction
based methods, failed-proof analysis.

Topics of relevance to the workshop therefore include

* disproving conjectures in general,
* extending standard proving methods with disproving capabilities,
* approximate methods for identifying non-theorems,
* counterexample generation,
* counter model generation,
* finite model generation,
* decision procedures,
* failure analysis,
* reparation of non-theorems,
* heuristics that help in identifying non-theorems,
* applications and system descriptions.

Workshop Goal

This the 4th DISPROVING workshop, following the workshops at IJCAR 2004,
CADE 2005, and FLoC 2006.

The DISPROVING workshops are intended as a platform for the exchange
of ideas between researchers concerned with disproving in the broad
sense. By discussing approaches across the different communities, the
workshop can identify common problems and solutions. Another goal is to
elaborate known, and discover unknown, connections between other areas
and disproving. Also, the meeting can enable an exchange of interesting
examples for non-theorems. A long term goal is that the workshop series
contributes to forming a disproving community within AR, and gives the
work on disproving a greater visibility.

Audience

Non-theorems are an issue wherever one tries to prove statements which
are not known to be valid in advance. Therefore, we aim at researchers
from all areas of automated reasoning. The issue of the workshop is
particularly relevant for all logics, calculi, and proving paradigms
where non-validity is not covered by the (plain versions of) standard
methods. This includes (but is not restricted to) first-order logic
proving, inductive theorem proving, rewriting based reasoning,
higher-order logic proving, logical frameworks, and special purpose
logics like for instance program logics. We also target at the model
generation community.

Beside mature work, we also solicit preliminary work or work in
progress to be presented.

Programme Committee

* Wolfgang Ahrendt (Co-Chair)
* Franz Baader
* Peter Baumgartner (Co-Chair)
* Simon Colton
* Christian Fermüller
* Bernhard Gramlich
* William McCune
* Hans de Nivelle (Co-Chair)
* Michael Norrish
* Silvio Ranise
* Renate Schmidt
* Carsten Schürmann
* Graham Steel

Invited Speakers

* Koen Claessen, Chalmers University of Technology, Göteborg
* Cesare Tinelli, University of Iowa (shared with VERIFY'07)

Submission

Submissions should not exceed 10 pages.

Submission will be electronic only, using EasyChair.
The electronic submission page is www.easychair.org/DISPROVING07

The deadline for submission is 11th of May 2007.

Publication

The final versions of the selected contributions will be collected in
a volume to be distributed at the workshop and made accessible on the
web.

Together with the organisers of the VERIFY workshop at CADE, we are
planing a joint journal special issue on the topics of both
workshops. Authors of papers presented at DISPROVING and VERIFY will
be welcome to submit extended and revised versions of their
papers. However, contributions will not be limited to those based on
papers presented at either workshops; other submission are welcome as
well.

Workshop Venue

The workshop will be held on July 16, as part of
CADE 2007 (Conference on Automated Deduction),
International University Bremen,
Germany,
July 17 - 20, 2007


Workshop Organizers

Wolfgang Ahrendt
Chalmers University of Technology, Göteborg, Sweden
Email: ahrendt AT chalmers.se

Peter Baumgartner
National ICT Australia, Logic and Computation Program, Canberra, Australia
Email: Peter DOT Baumgartner AT nicta.com.au

Hans de Nivelle
Institute for Computer Science, University of Wroclaw, Poland
Email: nivelle AT ii.uni.wroc.pl

Important Dates

May 11: paper submissions deadline
June 08: notification of acceptance
June 22: final version due
Monday, July 16: workshop date

Links

* Workshop web page:
www.cs.chalmers.se/~ahrendt/CADE07-ws-disproving/
* CADE 2007 home page:
www.cadeinc.org/meetings/cade21/
* Last year's workshop web page:
www.easychair.org/FLoC-06/DISPROVING.html


For further information on the workshop, please contact any of the organisers.

.



Relevant Pages

  • DISPROVING07 - DEADLINE EXTENDED to May 25, 2007
    ... Last Call for Papers ... Automated Reasoning traditionally has focused on proving ... proving, which we call disproving, particularly aims at identifying ... CADE 2005, and FLoC 2006. ...
    (comp.specification.z)
  • Re: Review of Mueckenheims book.
    ... Enderton or Suppes or whatever), it crucial to prove that the function ... By proving or disproving that it satisfies the definition of an ... Which cannot be done without knowing the domain and codomain. ...
    (sci.math)
  • DISPROVING 06 2nd Call f. Papers
    ... The opposite of proving, which we call disproving, particularly ... aims at identifying non-theorems, i.e. showing non-validity ... logics like for instance program logics. ...
    (comp.specification.z)
  • FLoC06 WS on DISPROVING Call for Papers
    ... The opposite of proving, which we call disproving, particularly ... aims at identifying non-theorems, i.e. showing non-validity ... logics like for instance program logics. ...
    (comp.specification.z)
  • Re: *** Pete***
    ... please let me know the name and address where papers are to ... nobody who can't aford to pay damages. ... But thanks for proving what a ... coward you are. ...
    (uk.business.agriculture)

Loading