Constructing end-to-end service solutions is a key challenge in service computing. Traditional methods (service recommendation, composition, discovery) each address only a partial workflow, and none provide a complete pipeline from user requirement to executable solution. Recent breakthroughs in large language models (LLMs) offer new opportunities. This paper presents DHGL, an LLM-guided dual-channel heuristic greedy framework for end-to-end service solution construction, comprising three phases: Decompose, Recall, and Construct. In Decompose, an LLM breaks an ambiguous user query into primary subtasks. Recall uses a hierarchical dynamic switching mechanism to iteratively refine the subtask sequence via reward-guided regeneration and counterexample learning. Construct employs dual-channel agents (completeness and accuracy agents) with a greedy strategy to build executable directed acyclic graphs (DAGs) of services that covers both core and special requirements. DHGL integrates LLM’s task planning and natural language understanding into solution construction. Experiments on two real-world datasets show it outperforms state-of-the-art methods in accuracy, executability, and conciseness (The code is available at git@github.com:Felicity155/DHGL.git.).

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

DHGL: A Dual-Channel Heuristic Greedy Framework for End-to-End Service Solution Construction Under LLM Guidance

  • Ying Sun,
  • Xiao Wang,
  • Hanchuan Xu,
  • Zhongjie Wang

摘要

Constructing end-to-end service solutions is a key challenge in service computing. Traditional methods (service recommendation, composition, discovery) each address only a partial workflow, and none provide a complete pipeline from user requirement to executable solution. Recent breakthroughs in large language models (LLMs) offer new opportunities. This paper presents DHGL, an LLM-guided dual-channel heuristic greedy framework for end-to-end service solution construction, comprising three phases: Decompose, Recall, and Construct. In Decompose, an LLM breaks an ambiguous user query into primary subtasks. Recall uses a hierarchical dynamic switching mechanism to iteratively refine the subtask sequence via reward-guided regeneration and counterexample learning. Construct employs dual-channel agents (completeness and accuracy agents) with a greedy strategy to build executable directed acyclic graphs (DAGs) of services that covers both core and special requirements. DHGL integrates LLM’s task planning and natural language understanding into solution construction. Experiments on two real-world datasets show it outperforms state-of-the-art methods in accuracy, executability, and conciseness (The code is available at git@github.com:Felicity155/DHGL.git.).