From: Sophie Tourret <firstname.lastname@example.org>
CADE-28: Call for Papers, Workshops, Tutorials and Competitions
The 28th International Conference on Automated Deduction (CADE-28)
Carnegie Mellon University, Pittsburgh, USA. 11-16th July 2021.
CADE will carefully monitor the development of the COVID-19 pandemic,
guidance from the health authorities, to determine whether CADE-28 will be
physical or online or hybrid.
CALL FOR PAPERS
CADE is the major international forum for presenting research on all
automated deduction. High-quality submissions on the general topic of
deduction, including logical foundations, theory and principles,
in and beyond STEM, implementations, and the use/contribution of automated
deduction in AI, are solicited. CADE-28 aims to present research that
the broad range of interesting and relevant topics in automated deduction.
Submissions can be made in two categories:
Regular papers. Up to 15 pages in LNCS style. Proofs of theoretical
that do not fit in the page limit may be provided in an appendix.
may consider additional material in appendices, but submissions must
contained within the page limit.
Short papers (including system descriptions, user experiences, domain
etc.) Up to 10 pages in LNCS style.
Submissions must be unpublished and not submitted for publication elsewhere.
They will be judged on relevance, originality, significance,
readability. If software or data is relevant to a paper, a link that
access to the software/data must be provided to enable reproduction of
The review process will include a feedback/rebuttal period where authors
have the option to respond to reviewer comments. The PC chairs may solicit
further reviews after the rebuttal period.
The proceedings of the conference will be published in the Springer
series. Formatting instructions and the LNCS style files can be obtained at
Papers must be submitted to the CADE-28 track via
CALL FOR WORKSHOPS
Workshop proposals for CADE-28 are solicited. The workshops will take place
before (11th July) and after (16th July) the conference. Both
workshops and newer ones are encouraged. Similarly, proposals for workshops
with a tight focus on a core automated reasoning specialization, as well as
those with a broader, more applied focus, are welcome. Please provide the
following information in your application:
Proposed workshop duration (from half a day to two days) and preferred
Brief description of the goals and the scope of the workshop. Why is the
workshop relevant to CADE?
Is the workshop new or has it met previously? In the latter case
on previous meetings should be given (e.g., links to the program,
submissions, number of participants).
What are the plans for publication?
CALL FOR TUTORIALS
Tutorial proposals for CADE-28 are solicited. The tutorials will take place
before (11th July) and after (16th July) the conference. Tutorials are
to be either half-day or full-day events, with a theoretical or applied
on a topic of interest to CADE-28. Please provide the following
Whether or not a version of the tutorial has been given previously, and
if/how the intended presentation differs.
Short statement regarding plans in case of an online conference.
Within reason, CADE will take care of printing and distributing notes for
tutorials that would like this service.
CALL FOR COMPETITIONS
The CADE ATP System Competition (CASC), which evaluates automated theorem
proving systems for classical logics, has become an integral part of the
conferences. Further competition proposals are solicited. The goal is to
the development of automated reasoning systems and applications, in all
relevant to automated deduction in a broad sense. Please provide the
information in your application:
Is the competition new or has it been organized before? In the latter case
information on previous competitions should be given.
What computing resources are required and how will they be provided?
Important Dates for Workshop/Tutorials/Competitions:
Proposals for workshops, tutorials, and competitions must be submitted
CADE-28-WTC track via
Last updated: Sep 28 2021 at 20:18 UTC