Citation
Lotfi Zadeh. "Stratification, target set reachability and incremental enlargement principle". Talk or presentation, 8, February, 2016.

Abstract
This paper presents a brief exposition of a version the concept of stratification, call it CST for short. In our approach to stratification, CST is a computational system in which the objects of computation are strata of data. Usually, the strata are nested or stacked with nested strata centering on a target set, T. CST has a potential for significant applications in planning, robotics, optimal control, pursuit, multiobjective optimization, exploration, search and other fields. Very simple, familiar examples of stratification are dictionaries, directories and catalogues. A multi-layer perceptron may be viewed as a system with a stratified structure. In spirit, CST has similarity to dynamic programing (DP), but it is much easier to understand and much easier to implement. An interesting question which relates to neuroscience is: Does the human brain employ stratification to store information? It would be natural to represent a concept such as chair, as a collection of strata with one or more strata representing a type of chair. Underlining our approach is a model, call it FSM. FSM is a discrete-time, discrete-state dynamical system which has a finite number of states. The importance of FSM as a model derives from the fact that through the use of granulation and/or quantization almost any kind of system can be approximated to by a finite state system. A concept which plays an important role in our approach is that of target set reachability. Reachability involves moving (transitioning) FSM from a state w to a state in target state, T, in a minimum number of steps. To this end, the state space, W, is stratified through the use of what is refer as the incremental enlargement principle. It should also be noted that the concept reachability is related to the concept of accessibility in modal logic.

Electronic downloads

• seminar.2016-02-08.Lotfi_Zadeh.pdf · application/pdf · 5433 kbytes

• HTML

  Lotfi Zadeh. <a
  href="http://chess.eecs.berkeley.edu/pubs/1163.html"
  ><i>Stratification, target set reachability and
  incremental enlargement principle</i></a>, Talk
  or presentation,  8, February, 2016.

• Plain text

  Lotfi Zadeh. "Stratification, target set reachability
  and incremental enlargement principle". Talk or
  presentation,  8, February, 2016.

• BibTeX

  @presentation{Zadeh16_StratificationTargetSetReachabilityIncrementalEnlargement,
      author = {Lotfi Zadeh},
      title = {Stratification, target set reachability and
                incremental enlargement principle},
      day = {8},
      month = {February},
      year = {2016},
      abstract = {This paper presents a brief exposition of a
                version the concept of stratification, call it CST
                for short. In our approach to stratification, CST
                is a computational system in which the objects of
                computation are strata of data. Usually, the
                strata are nested or stacked with nested strata
                centering on a target set, T. CST has a potential
                for significant applications in planning,
                robotics, optimal control, pursuit, multiobjective
                optimization, exploration, search and other
                fields. Very simple, familiar examples of
                stratification are dictionaries, directories and
                catalogues. A multi-layer perceptron may be viewed
                as a system with a stratified structure. In
                spirit, CST has similarity to dynamic programing
                (DP), but it is much easier to understand and much
                easier to implement. An interesting question which
                relates to neuroscience is: Does the human brain
                employ stratification to store information? It
                would be natural to represent a concept such as
                chair, as a collection of strata with one or more
                strata representing a type of chair. Underlining
                our approach is a model, call it FSM. FSM is a
                discrete-time, discrete-state dynamical system
                which has a finite number of states. The
                importance of FSM as a model derives from the fact
                that through the use of granulation and/or
                quantization almost any kind of system can be
                approximated to by a finite state system. A
                concept which plays an important role in our
                approach is that of target set reachability.
                Reachability involves moving (transitioning) FSM
                from a state w to a state in target state, T, in a
                minimum number of steps. To this end, the state
                space, W, is stratified through the use of what is
                refer as the incremental enlargement principle. It
                should also be noted that the concept reachability
                is related to the concept of accessibility in
                modal logic. },
      URL = {http://chess.eecs.berkeley.edu/pubs/1163.html}
  }
  

Posted by Sadigh Dorsa on 11 Feb 2016.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.