From - Sun Feb 23 03:53:37 1997 Path: Radon.Stanford.EDU!news.Stanford.EDU!su-news-hub1.bbnplanet.com!cam-news-hub1.bbnplanet.com!news.bbnplanet.com!news.maxwell.syr.edu!news.apfel.de!fu-berlin.de!news.coli.uni-sb.de!news.phil.uni-sb.de!news.dfki.uni-sb.de!news.uni-kl.de!rz.uni-karlsruhe.de!brzoska From: brzoska@ira.uka.de (Christoph Brzoska) Newsgroups: comp.theory,comp.constraints,comp.lang.prolog Subject: 2nd CFP: IJCAI'97 WS on Programming in Temporal and Non Classical Logics Date: 21 Feb 1997 17:17:47 GMT Organization: University of Karlsruhe, Germany Lines: 213 Message-ID: <5eklbr$j9$1@nz12.rz.uni-karlsruhe.de> NNTP-Posting-Host: i10s16.ira.uka.de Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Xref: Radon.Stanford.EDU comp.theory:11269 comp.constraints:1579 comp.lang.prolog:9723 We apologize if you receive this message more than once. Below you will find the Call for Papers of the IJCAI'97 Workshop on "Programming in Temporal and Non Classical Logics". Please post and/or forward to all interested colleagues. ------------------------------------------------------------------------------ Second Call for Papers and Participation Workshop on Programming in Temporal and Non Classical Logics to be held as part of 15th International Joint Conference on Artificial Intelligence (IJCAI-97) Nagoya, Japan, 25 August 1997 Temporal logics originating in philosophy and formal linguistics have been intensively investigated within both AI and traditional Computer Science. A variety of different approaches and formalisms have been developed, some of them admitting and supporting automated reasoning techniques and having strong similarities to those which have evolved in the context of classical logic. Executable fragments of these logics have been proposed in order to provide more appropriate logical techniques for dealing with change in time. Basically, two different approaches to execution of the temporal logic formalism have evolved. The first, which is compatible with the classical logic programming paradigm, is aimed towards a logical basis for temporal databases and knowledge based systems for reasoning about time and, to be more general, a robust basis for the development of advanced AI systems. Its execution is based on deduction in tractable fragments of suitable temporal logics. The second approach is more motivated by a classical computer science problem, namely to define and develop a uniform framework for programming and verification of computer programs, especially those relying on imperative and reactive behavior. Execution within this second approach corresponds to model construction of the formulae in question and is based on the so called imperative future approach. A renewed interest on programming paradigms based on non classical logics has also been stimulated recently by new issues in the context of concurrent constraint logic programming, (temporal) deductive databases, programming of reactive systems, embedded AI systems and multi-agent systems. WORKSHOPS AIMS -------------- The aim of this workshop is to provide a forum both for the exchange of ideas and for the identification of the potential roles and nature of the emerging paradigm of Executable Temporal and Non Classical Logics. Our intention is to bring together researchers in this area, to identify common ground, relevant experiences, applications, open problems and possible future developments. In particular, we wish to encourage cross-fertilization between different approaches and to improve the understanding of (tractable) execution of temporal logics. Special emphasis will be given to the study of computation models in the context of Artificial Intelligence, and to new approaches to programming in the context of programming of reactive and embedded AI systems. AREAS OF INTEREST ----------------- This workshop will build upon the 1993 Workshop on Executable Modal and Temporal Logics that was organized as part of IJCAI-93, and the 1995 Workshop on Executable Temporal Logics organized as part of IJCAI-95. Topics of interest include, but are not limited to, * theoretical issues in executable temporal logics * relationship between execution and temporal theorem-proving * relationship of executable temporal logics to (temporal) databases * design of executable temporal logics * operational models and implementation techniques * programming support and environments * comparative studies of languages * applications and case studies WORKSHOP PARTICIPATION ---------------------- To encourage informal interaction and the exchange of ideas, attendance will be limited to approximately 30 invited participants. Those wishing to attend are encouraged to submit either (a) an extended abstract (of no more than 5000 words) describing relevant preliminary or completed work to be presented at the workshop by March 1st, 1997, or, (b) a statement of interest consisting of a single page description of research interests and current work, to be used to demonstrate the ability of the non-presenting participants to contribute to the discussions by April 25th 1997. Selected participants will be asked to provide complete papers to be distributed as preprints to the workshop participants. SUBMISSION DETAILS ------------------ All submissions should include: author's name(s), affiliation, (complete) mailing address, phone and fax number, and e-mail address. Preferably, the submission should be sent in Postscript format (uuencoded, gzipped/compressed) by email to either of the programme chairs below. The deadline for receipt of submissions is March 1st 1997. Christoph Brzoska Email: brzoska@ira.uka.de Department of Computer Science Tel: (+49) 721 608 35 64 University of Karlsruhe Fax: (+49) 721 60 77 21 P.O. Box 69 80 D-76128 Karlsruhe, Germany Michael Fisher Email: M.Fisher@doc.mmu.ac.uk Department of Computing Tel: (+44) 161 247 1488 Manchester Metropolitan University Fax: (+44) 161 247 1483 Chester Street Manchester M1 5GD, United Kingdom Alternatively, five (5) paper copies of all submitted materials may be sent to either of the programme chairs. WORKSHOP PROGRAMME COMMITTE --------------------------- Marianne Baudinet (Free University of Brussels, Belgium) Christoph Brzoska [co-chair] (Karlsruhe University, Germany) Thom Fruehwirth (Ludwig Maximilians University, Germany) Michael Fisher [co-chair] (Manchester Metropolitan University, UK) Rajeev Gore (Australian National University, Australia) Vineet Gupta (Xerox Palo Alto Research Center, USA) Shinji Kono (University of the Ryukyus, Japan) Stephan Merz (Ludwig Maximilians University, Germany) Ben Moszkowski (Newcastle University, UK) Vijay Saraswat (AT & T Research Labs, USA) Karl Sch\"afer (Karlsruhe University, Germany) Mehmet Orgun (Macquarie University, Australia) Papers will be refereed and notification of acceptance will be given by March 21th 1997. Authors of accepted papers will then be given the opportunity to revise their papers prior to the final submission (due April 15th, 1997). IMPORTANT DATES -------------- Deadline for paper Submissions: March 1st, 1997 Author notification by: March 21st, 1997 Camera ready version of the paper due: April 15th, 1997 Deadline for statements of interest: April 25th, 1997 Workshop: during August 23-25, 1997 Copies of accepted papers will be provided as a pre-proceedings by the IJCAI organizers at the workshop itself. PUBLICATION ----------- The proceedings of the 1993 IJCAI workshop on Executable Modal and Temporal Logics were published by Springer-Verlag as a volume in the Lecture Notes in Artificial Intelligence series, while revised contributions from the 1995 IJCAI workshop on Executable Temporal Logics are appearing in a special issue of the Journal of Symbolic Computation. Our intention is again to publish polished versions of the papers from the workshop proceedings. Selected contributions of the 1997 workshop may be considered for publication by Springer-Verlag as a special volume in the LNAI series. COSTS ----- All workshop participants will be required to be registered to the main IJCAI'97 conference. An additional fee of $US 50 will be charged to cover costs of the workshop. ADDITIONAL INFORMATION ---------------------- Information about IJCAI'97 can be accessed via the IJCAI home page: http://www.ijcai.org/ijcai-97/ Information about the workshop will be available via http://iseran.ira.uka.de/~brzoska/ijcai97tlp.html. -- ------------------------------------------------------------------------------- Christoph Brzoska Institute for logic, complexity, and deductive systems University of Karlsruhe Phone: + 49 721 608 35 64 P.O.Box 69 80 Fax: + 49 721 60 77 21 D - 76128 Karlsruhe, Germany E-mail: brzoska@ira.uka.de URL: iseran.ira.uka.de/~brzoska -------------------------------------------------------------------------------