🚀 go-pugleaf

                      Advance Program AI-94
 Canadian Society for Computational Studies in Intelligence
                        Banff Alberta
                       May 16-20 1994 

Note: This conference is held in conjunction with Graphics
Interface '94 and Vision Interface '94. For registration information
contact davis@cs.ualberta.ca. On-line registration forms are
ftp'able. contact ree@cs.ualberta.ca for details.
For information on Graphics Interface, contact barry@cs.ualberta.ca
For information on Vision Interface, contact archibald@iit.nrc.ca
*****************************************************************
Invited Speakers  (May 18-20)

 Bonnie Webber (U.Penn) Animated human agents as a testbed for
                       language understanding and planning.
 Hector Levesque (U. Toronto) Knowledge, action, and ability in the
                       situation calculus.
 Stephen Judd (Siemens) Constraint satisfaction and neural net learning.

Workshops  (May 16 -17)

  Distributed  AI    contact: dgagne@cmr.ca  (Denis Gagne)
  Machine Learning   contact: bruce@cpsc.ucalgary.ca  (Bruce MacDonald)
  Programming Paradigms
   for AI            contact: popowich@cs.sfu.ca (Fred Popowich)
 
                                 Wednesday May 18
Session: Language            

Detecting digressions using a model for interactive generation. 
	S.M. Haller, State Univ. of New York at Buffalo.
From text to horn clauses: X-Combining linguistic analysis and machine learning.
        S. Delisle; Universite du Quebec a Trois-Rivieres,  K. Barker, J-F. Delannoy,
	S. Matwin, S. Szpakowicz, Univ. of Ottawa.
A reasoned interlingua for knowlege-based machine translation.
	J.R.R. Leavitt, D.W. Lonsdale, A.M. Franz, Carnegie-Mellon Univ.	
A goal-directed multi-level stylistic analyzer.    
	C. DiMarco, P. Hoyt, Univ. of Waterloo.
On multiple-valued deductive databases.    
	V. Dahl,  E. Hagen, Simon Fraser Univ.


Session: Learning - 1     

Learning repetition in string transformations.  
	B.A. MacDonald, N.O. Schuler, Univ. of Calgary.	
A concept-based knowledge discovery approach in databases.  
	N. Cercone, X. Hu, Univ. of Regina; J. Han, Simon Fraser Univ.
Incorporating canonical discriminant attributes in classification learning.
	S.P.Yip, Swinburne Univ. of Technology; G.I. Webb, Deakin Univ.
Disjunctive structure in relational data:  Empirical evaluation.  
	E. Schwalb,  R. Dechter,  Univ. of California.

Session: Learning - 2 

Formalizing a spectrum of plan generalizations based on modal truth criteria. 
	S. Kambhampati, Arizona State Univ.
The problem of small disjuncts: its remedy in decision trees. 
	K.M. Ting, Univ. of Sydney.
Learning default concepts.  
	D. Schuurmans, Univ. of Toronto; R. Greiner, Siemens Corporate Research.
Unsupervised learning of planning knowledge. 
	 B. Pelletier, Druide Informatique; S. Matwin, Univ. of Ottawa.

                                    Thursday May 19

Session: Connectionist Learning  

Identifying the trigger features for hidden units in a PDP model of the early visual pathway.  
	M.R.W. Dawson, S.C. Kremer, T.N. Gannon;  Univ. of Alberta.	
ARTSTAR: A supervised adaptive resonance classifier.  
	T.S. Hussain, R.A. Browse,  Queen's Univ.
Using redundancy to improve the performance of  artificial neural networks.  
	D.A. Medler, M.R.W. Dawson, Univ. of Alberta	

Session:  Problem Solving       

A diagnosis method for multiple failures in a nonlinear and dynamic process. 
	T. Washio, Mitsubishi Research Institute, Inc;  M. Kitamura, Tohoku Univ..
Automated model generation and simulation.  
	K. Han,  A. Gelsey,  Rutgers Univ.
How to automatically generate an inference engine from declarative specifications.  
	B. Ginoux, Direction des Etudes et Recherches.
Case-based reasoning for the Verification and validation of complex devices' models.  
	J.I. Glasgow, M.P. Feret, Queen's Univ.


Session: Reasoning and Knowledge Representation I


A simple approach to bayesian network computations.
	N.L. Zhang, D. Poole,  Univ. of British Columbia	
A polynomial-time hypothetical reasoning employing an approximate solution 
method of 0-1 integer programming for computing near-optimal solution.  
	M. Ishizuka,  T. Okamoto, Univ. of Toyko
A logical language for natural language processing.  
	S.S. Ali, Southwest Missouri State Univ..
GOO: A database for temporal uncertainty management.  
	K. Kanazawa, Univ. of British Columbia.
The specification and implementation of a first order logic for uncertain temporal domains.  
	A. Trudel, E. Ho,  Acadia Univ.	

                                         Friday May 20

Session: Reasoning & Knowledge Representation II  

Circumscription in a paraconsistent logic.  
	Z. Lin, Shantou Univ.
Two cumulativity results on J- and PJ- default logics.  
	J-H. You, Univ. of Alberta;  L. Li, Univ. of Windsor.
A clausal form translation for propositional model logic. 
	C. Mathieu,  L.I.U.P. Universite de Provence 
A non-horn ATMS which allows flexible specification of required completeness.  
	B. Spencer, Univ. of New Brunswick; R. Cohen, Univ. of Waterloo.
Explanation in reasoning about action:  An abductive view of update.  
	C. Boutilier, Univ. of British Columbia

Session: Planning & Search I     

Can situated robots play soccer?  
	M.K. Sahota, A.K. Mackworth, Univ. of British Columbia
Will the robot do the right thing?  
	Y. Zhang,  A.K. Mackworth, Univ. of British  Columbia.
Searching with abstractions:  A unifying framework, and new high-performance algorithm.  
	R.C. Holte, C. Drummond, M.B. Perez, Univ. of Ottawa; R.M. Zimmer,  
	A.J. MacDonald, Brunel Univ.
An argument for indexical representations in temporal reasoning.  
	Y. Lesperance, H.J. Levesque, Univ. of Toronto.

Session: Planning & Search II

Evaluating the tradeoffs in partial-order planning algorithms.  
	C.A. Knoblock, Univ. of Southern California; Q. Yang, Univ. of Waterloo.
Indicative and action planning for an intelligent agent.  
	G.E. Kersten,  P. Lu, Carleton Univ.;  S. Szapakowicz, Univ. of Ottawa.
AIDA*-Asynchronous parallel  IDA.  
	A.Reinefeld, V. Schnecke, Paderborn Center for Parallel Computing.