For further informations please send
an e-mail to Viorica Sofronie-Stokkermans
Decidability, and especially complexity and tractability of logical theories
is extremely important for a large number of applications.
Although general logical formalisms (such as predicate logic or number
theory) are undecidable,
decidable theories or decidable fragments thereof (sometimes even with low complexity) often
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 (such as 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 that are in the interface between
automated reasoning and computational complexity, in particular in:
Topics of interest for CEDAR 2008 include (but are not restricted to):
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
The ultimate aim is to
expand the horizons of this area of
research, deepen the interactions, sensibilize other people from the
automated reasoning community to the complexity problems, and last but
not least, offer persons working in research and development centers
of software companies the possibility to get an overview of the
Submission and selection procedure:
We plan to accept three types of papers:
Given the informal style of the workshop, the submission of papers
presenting student's work and work in progress is encouraged.
Submission of papers is via Easychair http://www.easychair.org/conferences/?conf=cedar2008
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.
A special journal issue is planned.