Monday, 22 May
All accepted papers will be published on this WWW page prior to the conference, and we expect the audience to be familiar with them for time of their presentation. Each talk will be followed by a discussion, and discussion ideas will be added to the WWW Page.

The papers will be edited again, and proceedings will be published after the Symposium.

08:20 - 08:30    Opening remarks               Smith Memorial Center Cascade Room.
                Alan Mishchenko, Symposium Organizer

Session 1: Tutorial Talk                     Smith Memorial Center Cascade Room.
Chair: D. Simovici
08:30 - 09:15    Multiple-Valued Logic: Towards Unification of Efforts.
                 M. Perkowski, Portland State University, USA 
09:15 - 09:30    Refreshment break

Session 2a: Representation of Problems        Smith Memorial Center Cascade Room. 
Chair: S. Yanushkevich
Representation problem of functions and relations is one of the most important
in synthesis, test and verification; it is especially important in
Machine Learning applications because of the
huge amount of data. This session will present various new ideas in representation.

09:30 - 10:00   Generalized Haar Spectral Representations and their Applications,
                B. Falkowski,
                Nanyang Technical University, Singapure.
Your remarks and questions

10:00 - 10:30  Multi-Way Decision Diagrams 
               X. Song, Portland State University, USA

Session 2b: Reversible and Low Power Logic              Smith Memorial Balroom
Chair: Xunwei Wu

09:30 - 10:00 Logic Synthesis using Reversible Gates
             Pawel Kerntopf, Technical University of Warsaw
10:00 - 10:30 Design of Low Power CMOS Circuits with Energy Recovery,
              Xunwei Wu, Ningbo University, Ningbo, People Republic of China,
              Guoqiang Hang,
              Zhejiang University, Hangzhou, People Republic of China,
              and Massoud Pedram, University of Southern California, USA.
Your remarks and questions
10:30 - 11:00 Demonstration of inexpensive robots. Suite 70, Fourth Avenue Building.
               PSU ROBO-CLUB and high school interns.

               With the costs of cameras, computers and robotic 
               equipment dramatically decreasing, you can build a learning robot
               for your undergraduate students or even for high school enthusiasts.
               Use your great software ideas with our inexpensive robots.

11:00 - 11:10   Refreshment break

Session 3: Learning and Optimization       Smith Memorial Center Cascade Room. 
Chair: B. Falkowski
Optimization problems that occur in logic synthesis outside circuit design are similar
but not identical to those in classical design for CMOS.

11:10 - 11:40   New Functional Representation for the Decomposition of Machine Learning Problems.
                C. Files, Portland State University, USA

Your remarks and questions

11:40 - 12:10   Generalized Covering Problems and Algebraic Topology.
                A. Coppola,
                Cypress Semiconductor Northwest, USA.

12:10 - 13:00   Lunch

Session 4a: Architectures for              Smith Memorial Center Cascade Room.
Intelligent Humanoid Robots I
Chair: M. Jabri
The goal of this session is to present various architectures 
that are used or can be used for intelligent robots. 
The first lecture proposes a new idea of a Internet Cyber-Theatre, 
in which both the tele-present humans and automatic agents will
control robotic puppets on the stage.
This approach combines various previous robot design paradigms.
The second lecture demonstrates the longevity of basic
logic algorithms such as set covering in new areas such as
designing a robotic production line.
The third lecture presents new ideas for data mining based on
several theories developed in General Systems Theory.
Because new approach to robots designs them as data mining systems, 
any data mining theory can be useful for them.
The software package OCCAM, developed by the author and his group, 
includes the software used also for PSU robots, and in future both
packages will be integrated for robotics applications.
The next lecture of the series, (in session Robotics II),
presents a new memory model for an FPGA-based
Evolvable-Hardware Supercomputer. 
This model will be used to control robotic animals connected to it.
Finally, the last lecture
presents a new evolutionary approach to Logic Synthesis and Learning, 
which tries to combine heuristic search, voting approaches,
and evolutionary computation.

13:30 - 14:00   The OREGON CYBER THEATRE:
                Invitation to Collaboration.
                M. Perkowski, Portland State University, USA


Your remarks and questions

14:00 - 14:30   Genetic Algorithms in Computer-Aided Design of
                Robotic Manufacturing Cells
                A. Pashkevich, State University, Minsk, Belarus

Microsoft Word
Your remarks and questions

14:30 - 15:00   Reconstructurability Analysis Approach to Data Mining, 
                M. Zwick, Portland State University, USA

Session 4b: Information Theory Approaches               Smith Memorial Balroom
to Logic Synthesis   
Chair: Martin Zwick
Information Theory has been not used much in classical logic
synthesis but was popular in logic approaches to Data Mining, such as
decision trees. This session investigates new approaches based on 
information theory to various problems in logic synthesis, all having direct 
link to robotics and data mining.

13:00 - 13:30   Information Theoretic Approach to Minimization
                of Arithmetic Expressions,
                D. Popel, S. Yanushkevich, 
                Technical University of Szczecin, Poland,
                M. Perkowski, Portland State University, USA.
                P. Dziurzanski, V. Shmerko,
                Technical University of Szczecin, Poland,

Power Point
Your remarks and questions
13:30 - 14:00  Application of Information Relationships and Measures
               to Decomposition and Encoding of Incompletely Specified 
               Sequential Machines
               Lech Jozwiak, Aleksander Slusarczyk, Technical University of Eindhoven,
               The Netherlands.

Your remarks and questions
15:00 - 15:10   Refreshment break

Session 5: Tutorial Talk                   Smith Memorial Center Cascade Room
Chair: T. Sasao

15:10 - 16:00   A Breakthrough in Problem Representation:
                Implicit Methods for Logic Synthesis, Test and Verification 
                A. Mishchenko,
                Portland State University, USA

16:00 - 16:10  Refreshment break

Session 6a: Robotics II              Smith Memorial Cascade Room
Chair: M. Perkowski

16:10 - 16:40     Dynamic Fuzzy Sets
                  Andrzej Buller,
                  Technical University of Gdansk, Gdansk, Poland.

Your remarks and questions
16:40 - 17:10   Creation of a Cybernetic (Multi-Strategic Learning) Problem-Solver:
                Automatically Designed Algorithms for Logic Synthesis and Minimization
                Karen M. Dill and Marek A. Perkowski,
                Portland State University, USA
PDF text.

PDF slides.

slides PPT.

text .doc

Your remarks and questions
Session 6b: Academia and Real Life:    Smith Memorial Center Cascade Room
Challenges and Open Problems.    
Chair: Dan Hammerstrom

What are the real challenges of researchers
that work in industry? This session should help the academician to look out
from the Ivory tower to broad and challenging perspectives.
Hopefully, some new research will result from it.

16:10 - 16:40  Hard Problems in Formal Verification.
               Slawomir Pilarski, Synopsys Inc., Oregon.
16:40 - 17:10  Practical Challenges in Test Generation.
               Chris Tsai, Mentor Graphics Inc., Wilsonville, Oregon.

17:10 - 17:40  Academia versus Industry: Challenges in Design.
               Timothy Kam, 
               Intel Research, Hillsboro, Oregon.
18:10          ISMVL 2000 Welcome Reception, wine and cheese.