Abstract
In many applications in computer science and artificial intelligence, logical formulas are used as a formal representation to represent and/or specify various objects and relationships among them. However, transforming the informal propositional statements, e.g., declarative sentences and mathematical formulas, into logical formulas is not an easy task for most people. Moreover, when people obtain new logical formulas as results of deduction/reasoning based on logic, investigating the obtained formulas is also not an easy task for them. Although a tool to support transformation from the informal propositional statements of a target domain into logical formulas, and vice versa, is demanded, there is no such tool until now. This paper presents a bidirectional transformation method for formalization with logical formulas, and its supporting tool we are developing.
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
Bond, F., Isahara, H., Fujita, S., Uchimoto, K., Kuribayashi, T., Kanzaki, K.: Enhancing the Japanese WordNet. In: Proceedings of the 7th Workshop on Asian Language Resources, pp. 1–8 (2009)
Cheng, J., Miura, J.: Deontic Relevant Logic as the Logical Basis for Specifying, Verifying, and Reasoning about Information Security and Information Assurance. In: Proceedings of the 1st International Conference on Availability, Reliability and Security, pp. 601–608. Vienna (2006)
Fuchs, N.E., Kaljurand, K., Kuhn, T.: Attempto Controlled English for Knowledge Representation. In: Baroglio, C., Bonatti, P.A., Małuszyński, J., Marchiori, M., Polleres, A., Schaffert, S. (eds.) Reasoning Web. LNCS, vol. 5224, pp. 104–124. Springer, Heidelberg (2008)
Gao, H., Goto, Y., Cheng, J.: A Systematic Methodology for Automated Theorem Finding. Theoretical Computer Science 554, 2–21 (2014)
Kudo, T., Matsumoto, Y.: Japanese Dependency Analysis Using Cascaded Chunking. In: Proceedings of the 6th Workshop on Computational Language Learning, pp. 63–69. Taipei (2002)
Miller, G.A.: WordNet: A Lexical Database for English. Communications of the ACM 38(11), 39–41 (1995)
Nanaumi, S., Wagatsuma, K., Goto, Y., Cheng, J.: Development of a Supporting Tool for Translation between Declarative Sentences and Logical Formulas. In: Proceedings of the 12th International Conference on Machine Learning and Cybernetics, pp. 1179–1184. Tianjin (2013)
Ninomiya, T., Matsuzaki, T., Miyao, T., Tsuji, J.: A Log-linear Model with an N-gram Reference Distribution for Accurate HPSG Parsing. In: Proceedings of the 10th Conference on Parsing Technologies 2007, pp. 60–68. Prague (2007)
Schubert, L.K., Pelletier, F.J.: From English to Logic Context-free Computation of Conventional Logical Translation. Journal Computational Linguistics 8(1), 26–44 (1982)
Woodcock, J., Larsen, P.G., Bicarregui, J., Fitzgerald, J.: Formal Methods Practice and Experience. ACM Computing Surveys 41(4), 1–36 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Nanaumi, S., Wagatsuma, K., Gao, H., Goto, Y., Cheng, J. (2015). A Bidirectional Transformation Supporting Tool for Formalization with Logical Formulas. In: Nguyen, N., Trawiński, B., Kosala, R. (eds) Intelligent Information and Database Systems. ACIIDS 2015. Lecture Notes in Computer Science(), vol 9011. Springer, Cham. https://doi.org/10.1007/978-3-319-15702-3_61
Download citation
DOI: https://doi.org/10.1007/978-3-319-15702-3_61
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15701-6
Online ISBN: 978-3-319-15702-3
eBook Packages: Computer ScienceComputer Science (R0)