Jump to content

Generative Problem Solving

From Wikipedia, the free encyclopedia

Generative Problem Solving (GPS) is an area of artificial intelligence that is concerned with the generation, representation, verification, and solution of computational problems. It was introduced by Phillip C.-Y. Sheu and his students in a 2025 conference paper.[1]

While Generative Artificial Intelligence (GenAI), another subfield of artificial intelligence (AI), uses generative models to generate text, images, videos, audio, software code or other forms of data, Generative Problem Solving uses computational methods to generate the spaces of problems, data, use cases, scenarios and solve complex problems where the process and solutions are verifiable.

Background and development

[edit]

GPS can be viewed as an instrument for discovering the unknown in the problem space. Most problem-solving methods start with a problem that has already been defined. Generative Problem Solving also looks at how new problems can be created. It examines which problems can be generated, whether this process can be carried out systematically, and how the resulting problems can be solved and used to develop further knowledge.[1][2]

GPS connects problem generation with formal representations, verification procedures, and computational methods for finding solutions. Its current development has included work on logical reasoning, relational databases, and graph-based optimization.[2][3][4]

In 2025, Hsiang-Shun Shih's doctoral research examined the generation of logical puzzles and the construction of networks based on specified influence relationships. The work investigated how new tasks could be generated and checked for logical consistency.[2]

In 2026, Goli Vaisi and Sheu presented GPS-Relational, a framework for generating and verifying problems involving relational databases. The work examined how natural-language questions could be translated into executable SQL queries and how generated problems could be used to evaluate AI systems.[3]

Other work has applied GPS to shortest-path optimization. The GPS-SP framework generates problems with different combinations of constraints and uses specialized algorithms to solve them.[5] Chengheng Lyu's doctoral research has also examined logical reasoning, shortest-path problems, and association rules.[6]

[edit]

Generative Problem Solving draws on established methods in artificial intelligence, including symbolic reasoning, formal problem representation, and computational optimization.[1][2] Related work in semantic computing has also examined the use of semantic information to connect data and computational processes with the problems they are intended to address.[7]

Research on AI-assisted creative problem-solving has explored how generative AI systems can contribute to the development of creative solutions to open-ended problems. This broader field is related to GPS with a scope narrower than GPS.[8]

References

[edit]
  1. 1 2 3 Shih, Hsiang-Shun; Lyu, Chengheng; Vaisi, Goli; Sheu, Phillip C.-Y. (2025). "Generative Problem Solving: Bridging Classic and Modern AI". Proceedings of the 19th IEEE International Conference on Semantic Computing. pp. 251–252. doi:10.1109/ICSC64641.2025.00043.
  2. 1 2 3 4 Shih, Hsiang-Shun (2025). Toward Generative Problem Solving: Logical Puzzle Generation and Influence-Aware Network Synthesis (Doctoral dissertation). University of California, Irvine.
  3. 1 2 Vaisi, Goli; Sheu, Phillip C.-Y. (2026). "GPS–Relational: Generative Problem Solving with Relational Databases". International Journal of Semantic Computing. 20 (3): 395–419. doi:10.1142/S1793351X26430051.
  4. ↑ Schnieder, Maren; Schimanke, Florian; Sert, Mustafa; Persia, Fabio; Lyu, Chengheng; Glesener, Gary B. (2026). "Semantic Routing: Fusing LLMs and Combinatorial Optimization Problems within the Generative Problem Solving (GPS) Domain". International Journal of Semantic Computing. 20 (3): 351–370. doi:10.1142/S1793351X26430038.
  5. ↑ Lyu, Chengheng; Shih, Hsiang-Shun; Sheu, Phillip C.-Y. (2026). "GPS-SP: Generative Problem Solver for the Shortest Path Problem". International Journal of Semantic Computing. 20 (3): 371–394. doi:10.1142/S1793351X2643004X.
  6. ↑ Lyu, Chengheng (2026). Generative Problem Solving: Reasoning, Shortest Path, and Association Rules (Doctoral dissertation). University of California, Irvine.
  7. ↑ Wang, N.; Sheu, Phillip C.-Y.; Tsai, Jeffrey J. P. (2015). "Towards Semantic Biomedical Problem Solving". International Journal of Semantic Computing. 9 (4): 415–432. doi:10.1142/S1793351X15500075.
  8. ↑ Boussioux, Léonard; Lane, Jacqueline N.; Zhang, Miaomiao; Jacimovic, Vladimir; Lakhani, Karim R. (2024). "The Crowdless Future? Generative AI and Creative Problem-Solving". Organization Science. 35 (5): 1589–1607. doi:10.1287/orsc.2023.18430.