Journal of Symbolic Computation

Special Issue on


Guest Editors: Pierre Flener, Kung-Kiu Lau and Wolfgang Bibel


Schemas play an important and versatile role in symbolic computation. For general problem solving, schemas can be used to capture and codify knowledge that represents recognised successful processes and solutions, which can be repeatedly used for constructing sub-processes with smaller search spaces for sub-solutions, and so on. In particular, they have made significant contributions to areas like theorem proving and program synthesis by formulating more efficient proof or synthesis strategies that are amenable to automation, and by producing better-engineered solutions overall.  Nowadays, the most successful approaches to automation in these areas are schema-guided, and we believe that such approaches have the potential to be equally successful for automated reasoning and software engineering in general.

The aim of this special issue of the Journal of Symbolic Computation is to furnish a collection of seminal work on schemas in diverse areas of symbolic computation, with a view to encouraging future work and at the same time providing a sound starting point for it.

(The original Call for Papers can be found here.)

List of Accepted Papers

Expected Date of Publication

Currently this issue is expected to be published around May 2000.

Guest Editors' Addresses

Pierre Flener Kung-Kiu Lau
Department of Information Science Department of Computer Science
Uppsala University University of Manchester
Box 513, S-751 20 Uppsala Manchester M13 9PL
Sweden United Kingdom
Email: Email:
Phone: +46 18 471 1028 Phone: +44 161 275 5716
Fax: +46 18 52 12 70 Fax: +44 161 275 6204

Wolfgang Bibel
FG Intellektik
Technische Universität Darmstadt
D-64283 Darmstadt
Phone: +49 6151 16 2100
Fax: +49 6151 16 5326