The full version of this Call for Papers is available.
The direct execution of logical statements, through languages such as Prolog, has been influential in both Computer Science and Artificial Intelligence. Executable forms of temporal logics have been proposed in order to provide system developers with access to more appropriate logical techniques. A wide range of executable languages have appeared to fill this need, exhibiting a number of characteristics and execution mechanisms. Therefore, these languages have a wide range of application areas, including temporal databases, temporal planning, animation of temporal specifications, hardware simulation, and distributed AI.
Topics of interest include, but are not limited to: theoretical issues in executable temporal logics; design of executable temporal logics; relationship between execution and temporal theorem- proving; operational models and implementation techniques; programming support and environments; comparative studies of languages; relationship of executable temporal logics to (temporal) databases; applications and case studies.
Submissions should include: author's name(s), affiliation, complete mailing address, phone and fax number, e-mail address and an abstract of max. 300 words. Electronic submission is strongly encouraged (either as self-contained LaTeX, or postscript) and this, or five copies of submitted papers should be sent, by March 1st 1995, to:
Michael Fisher, Department of Computing Manchester
Metropolitan University, Chester Street, Manchester M1 5GD, UK
Email: M.Fisher@doc.mmu.ac.uk
Telephone: + 44 61 247 1488. Fax: + 44 61 247 1483
Dates: subm: Mar. 1, 95; notif: Apr. 1, 95; revised: May 1, 95.
Information about the workshop, together with abstracts of accepted papers, will be available via the WWW page .
If you are interested in attending this workshop please refer to the full version of this announcement referred to above.