Integrating Discrete Mathematics in artificial intelligence: A computational perspective with a vision for future technologies

Shalini Mishra¹ , Garima Singh² , Manju Prabhakar³

Section:Research Paper, Product Type: Journal-Paper
Vol.11 , Issue.3 , pp.69-74, Jun-2024

Online published on Jun 30, 2024

Copyright © Shalini Mishra, Garima Singh, Manju Prabhakar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
This paper present a comprehensive examination of the fundamental role that discrete mathematics plays in the development and future evolution of artificial intelligence(AI) by dissective the core components of AI systems through the lens of discrete mathematics, including areas such as graph theory, combinatoris, logic, and set theory, we identify pivotal connection and propose innovative pathways for future research. The goal is to illuminate how discrete mathematics concept can fuel advancements in AI, enhancing its efficiency, reliability and capability to solve complex problems this paper explores the application of discrete mathematics in the development and optimization of artificial intelligence algorithm and systems Through a series of calculative examples, we aim to illustrate the practical utility of discrete mathematical principles in enhancing the efficiency, accuracy and functionality of AI technologies.

Key-Words / Index Term :
Artificial Intelligence; Discrete Mathematics; Graph Theory; Combinatorics in AI

References :
[1] Chen, L., & Gupta, S.Discrete Mathematics in Artificial Intelligence: A Comprehensive Review Journal Artificial Intelligence and Discrete Mathematics, Vol.7,Issue.2, pp112-130, 2023.
[2] F. Glover, Future Paths for Integer Programming and Links to Artificial Intelligence, Computers and Operations Research, Vol.13, Issue.5, pp.533-549, 1986.
[3] Gendreau, M., Hertz, A., & Laporte, G. A review of heuristics for the vehicle routing problem. Operations Research, Vol.44, Issue.3, pp378-400, 1996.
[4] Hopfield, J. J. Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences, Vol.79, Issue.8, pp2554-2558, 1982.
[5] Hopfield JJ., Tank DW., “Neural” computation of decisions in optimization problems Biological Cybernetics, Vol.52, Issue.3, pp141-152, 1985.
[6] Kennedy, M. P., & Chua, L. O. Neural networks for nonlinear programming. IEEE Transactions on Circuits and Systems, Vol.35, Issue.5, pp554-562, 1988.
[7] Laporte, G. The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research, Vol.59, Issue.2, pp231-247, 1992.
[8] Patel, R., & Wang, Graph-Theoretic Approaches to Machine Learning: A Survey , Journal of Artificial Intelligence and Discrete Mathematics Vol.5, Issue.3, pp201-220, 2022.
[9] Smith, K., & Lee, T. H. Continuous-time neural networks for combinatorial optimization. IEEE Transactions on Circuits and Systems I: Regular Papers, Vol.55, Issue.8, pp2451-2461, 2008.
[10] Yang, S., et al. On the convergence of a class of continuous time stochastic processes. IEEE Transactions on Automatic Control, Vol.62, Issue.12, pp6534-6549, 2017.