Professor Boris Stilman (Ph.D. in Computer Science and Ph.D. in Electrical Engineering, National Research Institute for Electrical Engineering, Moscow, 1984; M.S. in Mathematics, Moscow State University, 1972) is the company's Chairman & CEO and a Founder of Stilman Advanced Strategies, Since 1991. Boris has been a Professor at the University of Colorado at Denver (UCD). Dr. Stilman is the originator of Linguistic Geometry (LG), a new type of game theory, which resulted from his research over the last 30 years. He is an internationally known scientist in the field of Artificial Intelligence. He made fundamental contributions in the areas of higher-dimensional multi-agent concurrent games, game constructors, and software development environments. He has published several books and contributions to books, over 160 journal and conference papers. The first scholarly book on LG, "Linguistic Geometry: From Search to Construction", by Dr. Stilman was published in February of 2000. Boris has given numerous invited presentations and tutorials on LG all around the world and organized major national and international research meetings. Dr. Stilman has been a recipient of numerous research awards. In the 70s and 80s, he received substantial grants from the former USSR Academy of Sciences, Control Data Corp. (USA), Universities of Mannheim and Dortmund (West Germany). Dr. Stilman is a recipient of all the top research awards at UCD, the 1998 Researcher of the Year, the 1997 Chancellor's Lecturership Award, and the 1997 Research Fellowship Award. His research on LG was supported by substantial grants from the Air Force Office of Scientific Research (AFOSR, through Phillips Laboratory), Department of Energy (DOE, through Sandia National Laboratories), Defense Advanced Research Projects Agency (DARPA) through Rockwell Science Center (RSC). His role as the world leader in LG was the key to getting US contracts for STILMAN from DARPA, Joint Forces Command (JFCOM), Missile Defense Agency (MDA), Air Force, Army, Navy, Boeing, Rockwell, as well as international contracts from Ministry of Defence (UK), BAe SYSTEMS (UK) and Fujitsu (Japan). Dr. Stilman has led a number of national projects in the former Soviet Union, government-funded projects at UCD in the USA, and all the government and commercial projects developed by STILMAN.
Linguistic Geometry (LG) is a type of game theory that permits solving a class of opposing games by constructing (not searching) the solution and this way avoid combinatorial explosion. LG serves as a foundation for the development of multiple intelligent defense systems in the USA and abroad. The tutorial consists of two parts:
● The first part includes brief introduction to the LG Game Construction for solving real world defense problems (with a short movie). I will introduce participants to the construction of the Abstract Board Games and LG Hypergames including construction of the abstract board, abstract pieces, and relations of reachability.
● The second part includes theoretical account into the LG Game Solving. I will introduce participants to the so-called No-Search Approach in LG. It will include step-by-step explanation of the major result in LG, which shows that LG generates optimal solutions for a class of opposing games without search and demonstrates construction of those solutions. I will initiate the Terminal Set Expansion, i.e., expansion of the subsets of terminal states into “bubbles,” the larger sets of states. For each of the states from those bubbles I will determine a strategy leading to the respective terminal states. Then, we will realize that the bubbles of states permit to decompose the whole game state space into subspaces. This decomposition will be implemented via constructing a visual model called a State Space Chart. This Chart will serve as a strategic “geographical map” of the state space by providing guidelines for “travel” from state to state. Then I will utilize this Chart for constructing classes of potential strategies for all the opposing sides and for pruning those classes that cannot be implemented for a given problem. Subsequent application of the non-pruned potential strategies will lead to construction of the optimal solution – the only real strategy existing in this problem.
