Abstract
Constructing arguments and understanding them is not easy. Visualization of argument structure has been shown to help understanding and improve critical thinking. We describe a visualization tool for understanding arguments. It utilizes a novel hi-tree based representation of the argument’s structure and provides focus based interaction techniques for visualization. We give efficient algorithms for computing these layouts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
van Gelder, T.J.: Argument mapping with reason!able. The American Philosophical Association Newsletter on Philosophy and Computers, 85–90 (2002)
van Gelder, T.J.: Visualizing Argumentation: software tools for collaborative and educational sense-making. Springer, Heidelberg (2002)
Twardy, C.: Argument maps improve critical thinking. Teaching Philosophy (2004)
Athena (2002), http://www.athenasoft.org/
Compendium (2007), compendium.open.ac.uk/institute/
Araucaria (2006), http://araucaria.computing.dundee.ac.uk/
Argunet (2008), http://www.argunet.org
Harel, D.: On visual formalisms. In: Glasgow, J., Narayanan, N.H., Chandrasekaran, B. (eds.) Diagrammatic Reasoning, pp. 235–271. MIT Press, Cambridge (1995)
Brüggermann-Klein, A., Wood, D.: Drawing trees nicely with tex. Electronic Publishing 2(2), 101–115 (1989)
Kennedy, A.J.: Drawing trees. Functional Programming 6(3), 527–534 (1996)
Plaisant, C., Grosjean, J., Bederson, B.B.: Spacetree: Supporting exploration in large node link tree, design evolution and empirical evaluation. In: Proceedings of the IEEE Symposium on Information Visualization, Washington, DC, USA, p. 57. IEEE Computer Society, Los Alamitos (2002)
Kumar, H., Plaisant, C., Shneiderman, B.: Browsing hierarchical data with multi-level dynamic queries and pruning. Technical Report UMCP-CSD CS-TR-3474, College Park, Maryland 20742, U.S.A (1995)
Huang, M.L., Eades, P., Cohen, R.F.: Webofdav navigating and visualizing the web on-line with animated context swapping. Comput. Netw. ISDN Syst. 30(1-7), 638–642 (1998)
Wetherell, C., Shannon, A.: Tidy drawings of trees. IEEE Transactions on Software Engineering 5(5), 514–520 (1979)
Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Transactions on Software Engineering 7(2), 223–228 (1981)
Walker, J.Q.: A node-positioning algorithm for general trees. Software Practice and Experience 20(7), 685–705 (1990)
Christoph Buchheim, M.J., Leipert, S.: Improving Walker’s algorithm to run in linear time. In: Graph Drawing, pp. 344–353 (2002)
Marriott, K., Moulder, P., Hope, L., Twardy, C.: Layout of Bayesian networks. In: Australasian Computer Science Conference, vol. 38 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sbarski, P., van Gelder, T., Marriott, K., Prager, D., Bulka, A. (2008). Visualizing Argument Structure. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2008. Lecture Notes in Computer Science, vol 5358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89639-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-89639-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89638-8
Online ISBN: 978-3-540-89639-5
eBook Packages: Computer ScienceComputer Science (R0)