A Global Workspace Framework for Combining Reasoning Systems

  • John Charnley
  • Simon Colton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5144)


Stand-alone Artificial Intelligence systems for performing specific types of reasoning - such as automated theorem proving and symbolic manipulation in computer algebra systems - are numerous, highly capable and constantly improving. Moreover, systems which combine various forms of reasoning have repeatedly been shown to be more effective than stand-alone systems. For example, the ICARUS system for reformulating constraint satisfaction problems [1] and the HOMER system for conjecture making in number theory [2]. However, in general, such combinations have been ad-hoc in nature and designedwith a specific task in mind. With little general design consideration or a suitable framework for combining reasoning, in general every new combination has to be built from scratch and the resulting system is often inflexible and difficult to manage. We believe it is imperative that generic frameworks are developed if the field of combining reasoning systems is to progress. Such generic frameworkswould provide standardised rule sets and toolkits to simplify the development of combined systems.


Combine System Computer Algebra System Reasoning Task Symbolic Manipulation Automate Theorem Prove 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Charnley, J., Colton, S., Miguel, I.: Automatic generation of implied constraints. In: Proceedings of ECAI (2006)Google Scholar
  2. 2.
    Colton, S.: Automated conjecture making in number theory using HR, Otter and Maple. Journal of Symbolic Computation 39(5), 593–615 (2004)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Baars, B.: A cognitive theory of consciousness. Cambridge University Press, Cambridge (1988)Google Scholar
  4. 4.
  5. 5.
    Waterloo Maple. Maple Manual,
  6. 6.
    Colton, S.: Automated Theory Formation in Pure Mathematics. Springer, Heidelberg (2002)Google Scholar
  7. 7.
    Colton, S., Pease, A.: The TM system for repairing non-theorems. In: Proceedings of the IJCAR 2004 Disproving workshop (2004)Google Scholar
  8. 8.
    Colton, S., Meier, A., Sorge, V., McCasland, R.: Automatic generation of classification theorems for finite algebras. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 400–414. Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • John Charnley
    • 1
  • Simon Colton
    • 1
  1. 1.Combined Reasoning Group, Department of ComputingImperial CollegeLondon

Personalised recommendations