Final CFP - JSC Special Issue on Executable Temporal Logics 
Author Message
 Final CFP - JSC Special Issue on Executable Temporal Logics

     [ NOTE: Deadline for submissions has been extended to 31 Oct. ]

                The Journal of Symbolic Computation
                [Editor-in-Chief: Bruno Buchberger]

            Special Issue on Executable Temp{*filter*}Logics

      Guest Editors: Michael Fisher, Shinji Kono, Mehmet Orgun

                        Call For Papers

BACKGROUND: Logical representations have been widely used in Computer
Science and Artificial Intelligence. In recent years, particularly
with the advent of languages such as Prolog, the direct execution of
such representations has been shown to be both feasible and useful.
Logic-based languages have been used, not only for applications such
as the animation of logical specifications, the characterisation of
database queries and knowledge representation, but also as high-level
programming languages in their own right. However, as the problems
tackled have become more complex, the requirement for more powerful
logical representations has been growing. In particular, since the
concept of time is of central importance to an increasingly wide range
of applications, including the representation of time-dependent data
and the specification and verification of concurrent and distributed
systems, many logics incorporating temp{*filter*}notions are being
developed and applied.

It is not surprising, therefore, that executable temp{*filter*}logics have
been proposed in order to provide system developers with access to
these, more powerful, logical techniques. Just as the development of
sophisticated, and relatively efficient, theorem-proving techniques
for first-order logic led to executable forms, such as Prolog, so the
development of executable methods for temp{*filter*}logics has often been
based on temp{*filter*}theorem-proving techniques. However, each particular
executable temp{*filter*}logic combines not only a logical perspective, but
also an operational model, drawn from its intended application areas.
Thus a wide range of languages have appeared, exhibiting a variety of
characteristics and execution mechanisms. Consequently, such languages
have a variety of application areas, such as temp{*filter*}databases,
temp{*filter*}planning, animation of temp{*filter*}specifications, hardware
simulation, and distributed AI.

OBJECTIVES: The Journal of Symbolic Computation is planning a special
issue on Executable Temp{*filter*}Logics, scheduled to appear in 1996.
High quality original research papers are solicited on all aspects
relating to the foundations, implementation techniques and
applications of languages based upon temp{*filter*}logic. The research
described must not only incorporate an adequate level of technical
detail, but must also provide a clear indication of both the utility
and the applicability of the results.

Topics of interest include, but are not limited to,

   * theoretical issues in executable temp{*filter*}logics
   * design of executable temp{*filter*}logics
   * relationship between execution and temp{*filter*}theorem-proving
   * operational models and implementation techniques
   * programming support and environments
   * comparative studies of languages
   * relationship of executable temp{*filter*}logics to (temporal) databases  
   * applications and case studies

Because of the nature of the journal, it is particularly important
that submissions, even purely theoretical ones, indicate the
algorithmic relevance and applicability of the approach.

Papers must be original and must not have been previously published or
simultaneously submitted for publication elsewhere. The papers will be
reviewed based on their originality and technical quality, relevance
to the special issue theme, and the extent to which they will advance
the frontiers of knowledge in this area.

In addition to longer papers, we would welcome short papers (5 to 10
pages) describing specific features or novel applications of
executable temp{*filter*}logic.

Submissions should follow the JSC style guide available from

LaTeX users are encouraged to use the jsc.sty file.

Electronic submission is strongly encouraged (either as self-contained
LaTeX, or postscript). Submissions, either electronic or a paper copy
of the full paper, should arrive no later than October 31st 1995, and
should be sent to  the principal guest editor:

        Michael Fisher
        Department of Computing
        Manchester Metropolitan University
        Manchester M1 5GD
        United Kingdom

        Tel:    +44 161 247 1488
        Fax:    +44 161 247 1483


        Michael Fisher
          (details as above)

        Shinji Kono
        Sony Computer Science Laboratory, Inc.
        3-14-13, Higashi-gotanda
        Tokyo 141

        Mehmet Orgun
        Department of Computing
        Macquarie University
        Sydney  NSW 2109


Submissions of full papers due:          October 31st, 1995
Notification of acceptance/rejection:    January 15th, 1996
Revised final manuscripts due:             April 15th, 1996

Queries concerning this special issue are welcome and should be
forwarded to the email addresses above.

Information about the special issue will be available via the WWW page:




Mehmet A Orgun                  Tel: +61 (0)2 850 9570
Department of Computing         Fax: +61 (0)2 850 9551

Sydney, NSW 2109, Australia     URL: http://www.*-*-*.com/ ~mehmet

Tue, 24 Mar 1998 03:00:00 GMT  
 [ 1 post ] 

 Relevant Pages 

1. Final CFP - JSC Special Issue on Executable Temporal Logics

2. Final CFP - JSC Special Issue on Executable Temporal Logics

3. Reminder: JSC Special Issue on Executable Temporal Logics

4. Reminder: JSC Special Issue on Executable Temporal Logics

5. CFP: Challenges for Executable Temporal Logics (JICSLP'98 workshop)

6. CFP: Challenges for Executable Temporal Logics (JICSLP'98 workshop)

7. CFP: Special Issue of JSC on First-Order Theorem Proving

8. 2nd Call for Papers: Challenges for Executable Temporal Logics (workshop)

9. 2nd CFP: IJCAI'97 WS on Programming in Temporal and Non Classical Logics

10. CFP: The AI Pride Issue (IEEE intelligent systems special issue)

11. Call for Papers for a Special Issue of Computer on Executable Content

12. Final call for papers for VLDB Special Issue


Powered by phpBB® Forum Software