Linguistic Geometry

From Search to Construction

  • Boris Stilman

Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 13)

Table of contents

  1. Front Matter
    Pages i-xiv
  2. Boris Stilman
    Pages 1-38
  3. Boris Stilman
    Pages 39-76
  4. Boris Stilman
    Pages 77-90
  5. Boris Stilman
    Pages 91-106
  6. Boris Stilman
    Pages 107-135
  7. Boris Stilman
    Pages 137-163
  8. Boris Stilman
    Pages 165-180
  9. Boris Stilman
    Pages 181-191
  10. Boris Stilman
    Pages 193-234
  11. Boris Stilman
    Pages 235-257
  12. Boris Stilman
    Pages 259-286
  13. Boris Stilman
    Pages 287-303
  14. Boris Stilman
    Pages 305-339
  15. Boris Stilman
    Pages 341-360
  16. Back Matter
    Pages 361-395

About this book


Linguistic Geometry: From Search to Construction is the first book of its kind. Linguistic Geometry (LG) is an approach to the construction of mathematical models for large-scale multi-agent systems. A number of such systems, including air/space combat, robotic manufacturing, software re-engineering and Internet cyberwar, can be modeled as abstract board games. These are games with moves that can be represented by the movement of abstract pieces over locations on an abstract board. The purpose of LG is to provide strategies to guide the games' participants to their goals. Traditionally, discovering such strategies required searches in giant game trees. These searches are often beyond the capacity of modern and even conceivable future computers.
LG dramatically reduces the size of the search trees, making the problems computationally tractable. LG provides a formalization and abstraction of search heuristics used by advanced experts including chess grandmasters. Essentially, these heuristics replace search with the construction of strategies. To formalize the heuristics, LG employs the theory of formal languages (i.e. formal linguistics), as well as certain geometric structures over an abstract board. The new formal strategies solve problems from different domains far beyond the areas envisioned by the experts. For a number of these domains, Linguistic Geometry yields optimal solutions.


Internet Mathematica agents complexity computer formal language geometry heuristics linguistics multi-agent system multi-agent systems robot scheduling

Authors and affiliations

  • Boris Stilman
    • 1
    • 2
  1. 1.University of Colorado at DenverDenverUSA
  2. 2.Stilman Advanced Strategies, LLCUSA

Bibliographic information

  • DOI
  • Copyright Information Springer Science+Business Media New York 2000
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-6999-8
  • Online ISBN 978-1-4615-4439-5
  • Series Print ISSN 1387-666X
  • Buy this book on publisher's site