CFS-C 1.0 is a domain independent collection of CLASSIFIER SYSTEM routines written by Rick L. Riolo as part of his PhD dissertation. A completely rewritten CFS-C is planned for 1994/95; this may include the features of CFS-C 2.0 mentioned in [SAB90] (e.g. "latent learning") or they may be included in a separate package released in 1995. An ANSIfied version of CFS-C 1.0 (CFS-C 1.98j) is available by FTP.
CFS-C is available from ENCORE (See Q15.3) in file: CFS/src/cfsc-1.98j.tar.gz and includes the original 1.02 CFS-C in its "cfsc/orig" folder after unpacking. On the "SyS" FTP server its: ftp://lumpi.informatik.uni-dortmund.de/pub/LCS/src/cfsc-1.98j.tar.gz with documentation in /pub/LCS/docs/cfsc.ps.gz
Another version of CFS-C (version XV 0.1) by Jens Engel <engel@asterix.irb.uni- hannover.de> is also available. This includes bug fixes of earlier versions, allowing it to run on a wider range of machines (e.g. Linux and nCUBE). It also has an XView front end that makes it easier to control, and some extensions to the algorithms. It is available from Encore in file: CFS/src/cfscxv-0.1.tar.gz with documentation in CFS/docs/cfscxv-0.1.readme.gz
References
Rick L. Riolo (1988) "CFS-C: A package of domain independent subroutines for implementing classifier systems in arbitrary, user-defined environments", Logic of computers group, Division of computer science and engineering, University of Michigan.
Rick L. Riolo (1988) "LETSEQ: An implementation of the CFS-C classifier-system in a task-domain that involves learning to predict letter sequences", Logic of computers group, Division of computer science and engineering, University of Michigan.
Rick L. Riolo (1988) "CFS-C/FSW1: An implementation of the CFS-C classifier system in a task domain that involves learning to traverse a finite state world", Logic of computers group, Division of computer science and engineering, University of Michigan.
Mistakes in this page?
Hitch Hiker's Guide to Evolutionary Computation,
Issue 6.4, released 21 December 1998
Copyright © 1993-1998 by J. Heitkötter and
D. Beasley, all rights reserved.