Abstract
Typically it is considered a strength of a language that the same situation can be described in different ways. However, when a human or a program is to check whether two representations are essentially the same it is much easier to deal with normal forms. For instance, (infinitely many) different sets of formulae may normalize to the same clause set. In the case of propositional logic formulae with a fixed number of boolean variables, the class of all clause sets is finite. Since it grows doubly exponentially, it is not feasible to construct the complete class even for small numbers of boolean variables. Hence further normalizations are necessary and will be studied. Furthermore some potential applications will be discussed.
I would like to thank Riccardo Poli for stimulating discussions which inspired this work.
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
Chang, C.-L., Lee, R.C.-T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York (1973)
Frisch, A.M., Jefferson, C., Hernandez, B.M., Miguel, I.: The rules of constraint modelling. In: Proceedings of the 19th IJCAI, pp. 109–116 (2005), www.cs.york.ac.uk/aig/constraints/AutoModel/conjure-ijcai05.pdf
Frisch, A.M., Jefferson, C., Hernandez, B.M., Miguel, I.: Symmetry in the generation of constraint models. In: Proceedings of the International Symmetry Conference (2007), www.cs.york.ac.uk/aig/constraints/AutoModel/ISC07Conjure.pdf
Kovacs, T., Kerber, M.: A study of structural and parametric learning in XCS. Evolutionary Computation Journal 14(1), 1–19 (2006)
Robinson, J.A.: A machine oriented logic based on the resolution principle. Journal of the ACM 12, 23–41 (1965)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kerber, M. (2008). Normalization Issues in Mathematical Representations. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds) Intelligent Computer Mathematics. CICM 2008. Lecture Notes in Computer Science(), vol 5144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85110-3_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-85110-3_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85109-7
Online ISBN: 978-3-540-85110-3
eBook Packages: Computer ScienceComputer Science (R0)