320 Copyright © 2018, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. Chapter 14 DOI: 10.4018/978-1-5225-5261-1.ch014 ABSTRACT The event bush method being an eﬃcient tool for representation and engineering of dynamic knowledge still lacks a strict mathematical foundation. Many of the syntactic properties of event bushes, however, seem compliant with directed graphs and can be described by typed graphs (i.e., by homomorphisms between directed graphs). This chapter explores an opportunity to formalize the syntactic structure of event bushes by means of typed graphs and shows useful implications of this approach for knowledge engineering and representation. INTRODUCTION Problem Area Traditional knowledge representation tools (e.g., ontologies and conceptual graphs) operate with objects considered either as classes (i.e., types: concept types or relation types) or as individuals (Martin, 2002). This has proven to be efficient for a wide range of tasks like building data models and search algorithms or description of those domains of knowledge in which things, their properties and relations are con- The Event Bush Method in the Light of Typed Graphs Illustrated by Common Sense Reasoning Uwe Wolter University of Bergen, Norway Olga Korableva Saint Petersburg State University, Russia Nikita Solovyov ITMO University, Russia