Vladimir Yakhnis

Learn More
We extend Gurevich-Harrington’s Restricted Memory Determinacy Theorem (i.e. Theorem 5 from Gurevich and Harrington (1982)), which served in their paper as a tool to give their celebrated “short proof’ of Rabin’s decision method for S2S. We generalize the determinacy problem by attaching to the game two opposing strategies called restraints, and by asking(More)
This paper reports new results of research, which started in 1972 in Moscow, USSR. For 16 years Boris Stilman was involved in the advanced research project PIONEER led by a formed World Chess champion, Professor Mikhail Botvinnik. The goal of the project was, at first, to discover and mathematically formalize methodologies utilized by the most advanced(More)
The Linguistic Geometry (LG) approach to discrete systems was introduced by B. Stilman in early 80s. It employed competing/cooperating agents for modeling and controlling of discrete systems. The approach was applied to a variety of problems with huge state spaces including control of aircraft, battlefield robots, and chess. One of the key innovations of LG(More)
This paper describes LG-PACKAGE, a set of the Linguistic Geometry (LG) tools. LG is a type of game theory that is scalable to the level of the real world defense systems. The LG applications generate best strategies for all sides in a conflict in real time. We consider the main advanced features of the versions of LG-PACKAGE released gradually from 2004(More)
As our society becomes technologically more complex, computers are being used in greater and greater numbers of high consequence systems. Giving a machine control over the lives of humans can be disturbing, especially if the software that is run on such a machine has bugs. Formal reasoning is one of the most powerful techniques available to demonstrate the(More)