Showing cs.AIShow all
2 papers · 1 filter
cs.AI2025
Diminution: On Reducing the Size of Grounding ASP Programs
HuanYu Yang, Fengming Zhu, YangFan Wu +1
Answer Set Programming (ASP) is often hindered by the grounding bottleneck: large Herbrand universes generate ground programs so large that solving becomes difficult. Many methods…
cs.AI2024
CLMASP: Coupling Large Language Models with Answer Set Programming for Robotic Task Planning
Xinrui Lin, Yangfan Wu, Huanyu Yang +3
Large Language Models (LLMs) possess extensive foundational knowledge and moderate reasoning abilities, making them suitable for general task planning in open-world scenarios. Howe…