Abstract
Visualization is an important component of modern computing. By animating the course of an algorithm’s temporal execution, many key features can be elucidated. We have developed a general framework, termed Call-Graph Caching (CGC), for automating the construction of many complex AI algorithms. By incorporating visualization into CGC interpreters, principled animations can be automatically displayed as AI computations unfold. (1) Systems that support the automatic animation of AI algorithms must address these three design issues: (2) How to represent AI data structures in a general, uniform way that leads to perspicuous animation and efficient redisplay. (3) How to coordinate the succession of graphical events. (4) How to partition AI graphs to provide for separate, uncluttered displays. CGC provides a natural and effective solution to all these concerns. (5) We describe the CGC method, including detailed examples, and motivate why CGC works well for animation. We discuss the CACHE system, our CGC environment for AI algorithm animation. We demonstrate the animation of several AI algorithms – RETE match, linear unification, arc consistency, chart parsing, and truth maintenance – all of which have been implemented in CACHE. Finally, we discuss the application of these methods to interactive interfaces for intelligent systems, using molecular genetics as an example domain.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
