Abstract
Constructing hypotheses is a principal work for academic researchers to constitute knowledge. Hypotheses often contain uncertainty, might conflict with each others, and might be revised by discovery of new witnesses. Therefore researchers are heavily loaded with the management of hypotheses. In order to support such activities we propose a graphical model for representing hypotheses, under the recent situation that materials for academic researches are distributed in digital manners, e.g. digital libraries and WWW. We also propose how to construct and manage hypothesis graphs based on our model. It is well-known that graphs are suitable to represent knowledge and many works treating knowledge as graphs have been presented. Previous researches proposed methods how to construct and manage hypotheses automatically, while our present work is aimed at supporting researchers so that they can construct and manage graphs based on semantics with uncertainty. In this paper, we define the syntax and the semantics of hypothesis graphs in our model and present methods to support researchers in the construction and management of hypothesis graphs with a system implemented the methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Doyle, J.: A Truth Maintenance System. Artificial Intelligence 12(3), 251–272 (1979)
Ikeda, M., Doi, K., Yamamoto, A., Hayashi, S.: Reformalization of Reasoning Web Model for Graphical Representation of Hypotheses. In: SIG-FPAI-A804-13, JSAI, pp. 69–76 (2009) (in Japanese)
Nishino, M., Yamamoto, A. and Hayashi, S.: Graphical Representation of Valid Conjectures and a System for Supperting Construction of Hypotheses. Technical Report of IEICE 107(523), AI2007-44; IEICE, pp. 1–6 (2008) (in Japanese)
Pearl, J.: Bayesian Networks: A Model of Self-Activated Memory for Evidential Reasoning. Proceedings, Cognitive Science Society (UCLA Computer Science Department Technical Report 850021 (R-43)), UC Irvine, CA, pp. 329–334, (1985)
Satoh, K., Uno, T.: Enumerating Maximal Frequent Sets using Irredundant Dualization. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 256–268. Springer, Heidelberg (2003)
Uno, T.: A Practical Fast Algorithm for Enumerating Minimal Set Coverings. In: SIGAL 83, IPSJ, pp. 9–16 (2002) (in Japanese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ikeda, M., Nishino, M., Doi, K., Yamamoto, A., Hayashi, S. (2011). Semantics of a Graphical Model for Representing Hypotheses and a System Supporting the Management of Hypotheses. In: Theeramunkong, T., Kunifuji, S., Sornlertlamvanich, V., Nattee, C. (eds) Knowledge, Information, and Creativity Support Systems. Lecture Notes in Computer Science(), vol 6746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24788-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-24788-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24787-3
Online ISBN: 978-3-642-24788-0
eBook Packages: Computer ScienceComputer Science (R0)