1. Jacky Baltes. The Transputer Development System. Computing Reviews, 32(7), July 1991.
   

   @article{baltes-1991a,
   key = {TDS review},
   author = {Jacky Baltes},
   title = {The Transputer Development System},
   journal = {Computing Reviews},
   year = {1991},
   month = {July},
   volume = {32},
   number = {7} 
   }
   

1. John Anderson and Mark Evans. An Architecture for Reactive and Strategic Planning. In Proceedings of the Fourth UNB AI Symposium, Fredericton, NB, pages 195-207, September 1991.
   

   @inproceedings{nb,
   author = {John Anderson and Mark Evans},
   title = {An Architecture for Reactive and Strategic Planning},
   booktitle = {Proceedings of the Fourth UNB AI Symposium},
   year = {1991},
   pages = {195-207},
   address = {Fredericton, NB},
   month = {September} 
   }
   




2. Jacky Baltes. A symmetric version space algorithm for learning disjunctive string concepts. In Proceedings of the fourth University of New Brunswick Artificial Intelligence Symposium, pages 55-65, September 1991. Abstract:

   The symmetric version space algorithm (SVS) learns disjunctions of string patterns by example. The learnable string concepts are a subset of regular expressions. The running time of the algorithm is {\em reduced}, because the system learns a top--down description of the string concepts. Different parts of the algorithm learn descriptions at different levels of the concept independently. This technique is similar to factoring the version space, in order to restrict the search space. The problem of {\em fragmentation} of the $G$--set is overcome by using a symmetric version space approach.

   
   

   @inproceedings{baltes91,
   author = {Jacky Baltes},
   title = {A symmetric version space algorithm for learning disjunctive string concepts},
   booktitle = {Proceedings of the fourth University of New Brunswick Artificial Intelligence Symposium},
   year = 1991,
   pages = {55-65},
   month = {September},
   pdf = {http://aalab.cs.umanitoba.ca/%7ejacky/Publications/pdf/baltes-1991.pdf},
   abstract = {The symmetric version space algorithm (SVS) learns disjunctions of string patterns by example. The learnable string concepts are a subset of regular expressions. The running time of the algorithm is {\em reduced}, because the system learns a top--down description of the string concepts. Different parts of the algorithm learn descriptions at different levels of the concept independently. This technique is similar to factoring the version space, in order to restrict the search space. The problem of {\em fragmentation} of the $G$--set is overcome by using a symmetric version space approach.} 
   }
   




3. Mark Evans and John Anderson. Flexible Task Allocation in Heterogeneous Cooperative Systems. In Proceedings of the AAAI Cooperation Among Heterogeneous Intelligent Systems Workshop, Anaheim, CA, pages 20, July 1991.
   

   @inproceedings{taskallocwksp,
   author = {Mark Evans and John Anderson},
   title = {Flexible Task Allocation in Heterogeneous Cooperative Systems},
   booktitle = {Proceedings of the AAAI Cooperation Among Heterogeneous Intelligent Systems Workshop},
   year = {1991},
   pages = {20},
   address = {Anaheim, CA},
   month = {July} 
   }
   

1. Jacky Baltes and Bruce MacDonald. An Integrated Planning Representation using Macros, Abstractions, and Cases. Technical report, University of Calgary, December 1991.
   

   @techreport{baltes91:_integ_plann_repres_macros_abstr_cases,
   author = {Jacky Baltes and Bruce MacDonald},
   title = {An Integrated Planning Representation using Macros, Abstractions, and Cases},
   year = 1991,
   month = {December},
   institution = {University of Calgary} 
   }
   

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons accessing this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.