Skip to main content

Deductive mathematical databases — A case study

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 420))

Abstract

The application of Prolog and the associated technology of deductive databases to modern algebra is a novel concept. A relatively small, yet diverse, collection of information was chosen for a feasibility study. The character tables of the 56 non-abelian simple groups of order less than one million have been studied in depth, so the information is readily available. The information is very heterogeneous in nature, involving formulae, tables, lists, arbitrary precision integers, character strings, irrational numbers, and rules for deducing information from the given facts. Issues involved in the setting up of this database are presented. An experiment on the construction of all fusion maps among the groups was performed and the results analysed.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • G. Butler and J.J. Cannon Cayley, version 4: the user language, to appear in Proceedings of 1988 International Symposium on Symbolic and Algebraic Computation, Rome, July 4–8.

    Google Scholar 

  • G. Butler and S. Sridhar, Towards a deductive database for the simple groups G, |G| <106. Technical Report 333, Basser Department of Computer Science, University of Sydney, December 1988.

    Google Scholar 

  • G. Butler and S.S. Iyer, On a deductive database for small simple groups, Technical Report 344, Basser Department of Computer Science, University of Sydney, April 1989.

    Google Scholar 

  • John J. Cannon, An introduction to the group theory language, Cayley, Computational Group Theory (Proceedings of the London Mathematical Society Symposium on Computational Group Theory, Durham, England, July 30–August 9, 1982), M. D. Atkinson, editor, Academic Press, London, 1984, 145–183.

    Google Scholar 

  • W.F. Clocksin and C.S. Mellish, Programming in Prolog, Springer-Verlag, Berlin, 1981.

    Google Scholar 

  • J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, R.A. Wilson, Atlas of Finite Groups, Clarendon Press, Oxford, 1985.

    Google Scholar 

  • M. Hall, Jr and J.K. Senior, The Groups of Order 2 n, (n≤6), Macmillan, New York, 1964.

    Google Scholar 

  • Victor E. Hill, Groups, Representations and Characters, Hafner Press, New York, 1975.

    Google Scholar 

  • R. James, M.F. Newman and E.A. O'Brien, The groups of order 128. Research Report 27-1988, Department of Mathematics, Institute of Advanced Studies, Australian National University, 1988.

    Google Scholar 

  • S.H. Ley, TWOGPS: A Deductive Database for Groups of Order 2 n. Honours Thesis, University of Sydney, 1988.

    Google Scholar 

  • J.W. Lloyd, An introduction to deductive database systems, Australian Computer Journal 15, 2 (1983) 52–57.

    Google Scholar 

  • W. Ludwig and C. Falter, Symmetries in Physics: Group Theory Applied to Physical Problems, Springer, Berlin, 1988.

    Google Scholar 

  • J. McKay, The non-abelian simple groups G, |G| <10 6 — character tables, Communications in Algebra 7, 13 (1979) 1407–1445.

    Google Scholar 

  • J. Neubüser, H. Pahlings and W. Plesken, CAS; Design and Use of a System for the Handling of Characters of Finite Groups, Computational Group Theory (Proceedings of the London Mathematical Society Symposium on Computational Group Theory, Durham, England, July 30–August 9, 1982), M. D. Atkinson, editor, Academic Press, London, 1984, 195–247.

    Google Scholar 

  • M.F. Newman and E.A. O'Brien, A Cayley library for the groups of order dividing 128, submitted to Proceedings of the Singapore Group Theory Conference, June 1987.

    Google Scholar 

  • E.A. O'Brien, A computer based description of 2-groups, to appear in Gazette of Australian Mathematics Society, 1987.

    Google Scholar 

  • E.A. O'Brien, The Groups of Order Dividing 256. Ph.D. Thesis, Australian National University, 1988.

    Google Scholar 

  • K. Ramamohanarao and J. Shepherd, A superimposed codeword indexing scheme for very large Prolog databases, Proceedings of the Third International Conference on Logic Programming, London, 1986, pp. 569–576.

    Google Scholar 

  • J.A. Thom and L. Naish, The MU-Prolog deductive database, TR 83/10, Department of Computer Science, University of Melbourne, 1983.

    Google Scholar 

  • J.A. Thom and J. Zobels (eds), NU-Prolog Reference Manual ver 1.1, TR 86/10, Department of Computer Science, University of Melbourne, 1987.

    Google Scholar 

  • R.W. Topor, T. Keddis and D.W. Wright, Deductive database tools, Australian Computer Journal 17, 4 (1985) 163–173.

    Google Scholar 

  • David H.D. Warren, Applied Logic-Its Use and Implementation as a Programming Tool, Technical Note 290, Artificial Intelligence Center, Computer Science and Technology Division, SRI International, June 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zbigniew Michalewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Butler, G., Iyer, S.S. (1990). Deductive mathematical databases — A case study. In: Michalewicz, Z. (eds) Statistical and Scientific Database Management. SSDBM 1990. Lecture Notes in Computer Science, vol 420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52342-1_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-52342-1_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52342-0

  • Online ISBN: 978-3-540-46968-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics