* Special issue of the Journal of Symbolic Computation on "Automated Deduction: Decidability, Complexity, Tractability''
@ 2008-03-07 11:36 Viorica Sofronie-Stokkermans
0 siblings, 0 replies; 2+ messages in thread
From: Viorica Sofronie-Stokkermans @ 2008-03-07 11:36 UTC (permalink / raw)
To: caml-list, categories, ccl, clean-list, colibri, comlab, complog,
comprox, coq-club, csd, csp, curry
Cc: sofronie
[We apologize if you receive multiple copies of this announcement]
-------------------------------------------------------------------
CALL FOR PAPERS
Journal of Symbolic Computation
Special Issue on
Automated Deduction: Decidability, Complexity, Tractability
http://www.mpi-inf.mpg.de/~sofronie/addct-special-issue.html
--------------------------------------------------------------------
This special issue is devoted to the scope of the workshop ADDCT'07:
Automated Deduction: Decidability, Complexity, Tractability, which
took place in Bremen (Germany) on July 2007. Topics of interest include
(but are not restricted to):
- Decidability:
- decision procedures based on logical calculi such as:
resolution, rewriting, tableaux, sequent calculi, or natural deduction
- decidability in combinations of logical theories
- specialized decision procedures
- Complexity:
- complexity analysis for fragments of first- (or higher) order logic
- complexity analysis for combinations of logical theories
(including parameterized complexity results)
- Tractability (in logic, automated reasoning, algebra, ...)
- Application domains for which complexity issues are essential
(verification, security, databases, ontologies, ...)
Submission procedure
====================
Submission to this special issue is completely open.
We expect original articles (typically 15-30 pages; submission of
larger papers will be evaluated depending on editorial constraints)
that present high-quality contributions that have not been previously
published in an archival venue and that must not be simultaneously
submitted for publication elsewhere.
Submissions must comply with JSC's author guidelines. They must be
written in English and should be prepared in LaTeX using the
"Elsevier Article Class (elsart.cls)" with "JSC add-on style (yjsco.sty)"
and "Harvard style references (elsart-harv.bst)". The package "JSC LaTex"
(that contains all the necessary style files and a template) can be obtained
from http://www4.ncsu.edu/~hong/jsc/JSC_LaTex_2007_Mar_12.zip
The introduction of the paper MUST explicitly address the following
questions in succinct and informal manner:
- What is the problem?
- Why is the problem important?
- What has so far been done on the problem?
- What is the contribution of the paper on the problem?
- Is the contribution original? Explain why.
- Is the contribution non-trivial? Explain why.
Submission to this special issue are hereby encouraged via the EasyChair
submission system (http://www.easychair.org/conferences/?conf=addctjsc2008)..
The deadline for submissions is April 6th, 2008.
Guest editors:
==============
Silvio Ghilardi (U. Milano)
Ulrike Sattler (U. Manchester)
Viorica Sofronie-Stokkermans (MPI,Saarbruecken)
Ashish Tiwari (Menlo Park)
Contact
=======
For further informations please send an e-mail to
Viorica Sofronie-Stokkermans (e-mail sofronie@mpi-inf.mpg.de)
^ permalink raw reply [flat|nested] 2+ messages in thread
* Special issue of the Journal of Symbolic Computation on "Automated Deduction: Decidability, Complexity, Tractability''
@ 2007-12-21 22:27 Viorica Sofronie-Stokkermans
0 siblings, 0 replies; 2+ messages in thread
From: Viorica Sofronie-Stokkermans @ 2007-12-21 22:27 UTC (permalink / raw)
To: caml-list, categories, ccl, clean-list, colibri, comlab, complog,
comprox, coq-club, csd, csp, curry
Cc: sofronie
[We apologize if you receive multiple copies of this announcement]
-------------------------------------------------------------------
CALL FOR PAPERS
Journal of Symbolic Computation
Special Issue on
Automated Deduction: Decidability, Complexity, Tractability
http://www.mpi-inf.mpg.de/~sofronie/addct-special-issue.html
--------------------------------------------------------------------
This special issue is devoted to the scope of the workshop ADDCT'07:
Automated Deduction: Decidability, Complexity, Tractability, which
took place in Bremen (Germany) on July 2007. Topics of interest include
(but are not restricted to):
- Decidability:
- decision procedures based on logical calculi such as:
resolution, rewriting, tableaux, sequent calculi, or natural deduction
- decidability in combinations of logical theories
- specialized decision procedures
- Complexity:
- complexity analysis for fragments of first- (or higher) order logic
- complexity analysis for combinations of logical theories
(including parameterized complexity results)
- Tractability (in logic, automated reasoning, algebra, ...)
- Application domains for which complexity issues are essential
(verification, security, databases, ontologies, ...)
Submission procedure
====================
Submission to this special issue is completely open.
We expect original articles (typically 15-30 pages; submission of
larger papers will be evaluated depending on editorial constraints)
that present high-quality contributions that have not been previously
published in an archival venue and that must not be simultaneously
submitted for publication elsewhere.
Submissions must comply with JSC's author guidelines. They must be
written in English and should be prepared in LaTeX using the
"Elsevier Article Class (elsart.cls)" with "JSC add-on style (yjsco.sty)"
and "Harvard style references (elsart-harv.bst)". The package "JSC LaTex"
(that contains all the necessary style files and a template) can be obtained
from http://www4.ncsu.edu/~hong/jsc/JSC_LaTex_2007_Mar_12.zip
The introduction of the paper MUST explicitly address the following
questions in succinct and informal manner:
- What is the problem?
- Why is the problem important?
- What has so far been done on the problem?
- What is the contribution of the paper on the problem?
- Is the contribution original? Explain why.
- Is the contribution non-trivial? Explain why.
Submission to this special issue are hereby encouraged via the EasyChair
submission system (http://www.easychair.org/conferences/?conf=addctjsc2008)..
The deadline for submissions is April 6th, 2008.
Guest editors:
==============
Silvio Ghilardi (U. Milano)
Ulrike Sattler (U. Manchester)
Viorica Sofronie-Stokkermans (MPI,Saarbruecken)
Ashish Tiwari (Menlo Park)
Contact
=======
For further informations please send an e-mail to
Viorica Sofronie-Stokkermans (e-mail sofronie@mpi-inf.mpg.de)
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2008-03-07 11:37 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2008-03-07 11:36 Special issue of the Journal of Symbolic Computation on "Automated Deduction: Decidability, Complexity, Tractability'' Viorica Sofronie-Stokkermans
-- strict thread matches above, loose matches on Subject: below --
2007-12-21 22:27 Viorica Sofronie-Stokkermans
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).