Fei Du
2026
SCAIR: Schema-Conditioned Agentic Iterative Reasoning for Enterprise Knowledge Graphs
Prateek Chaturvedi | Yuqicheng Zhu | Hongkuan Zhou | Dongzhuoran Zhou | Yunjie He | Steffen Staab | Fei Du | Jie Tang | Evgeny Kharlamov
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026)
Prateek Chaturvedi | Yuqicheng Zhu | Hongkuan Zhou | Dongzhuoran Zhou | Yunjie He | Steffen Staab | Fei Du | Jie Tang | Evgeny Kharlamov
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026)
Knowledge Graph–based Retrieval-Augmented Generation (KG-RAG) enables natural language interaction with structured enterprise knowledge, yet existing agentic approaches that perform well on public benchmarks often fail to generalize to real-world enterprise Knowledge Graphs (KGs), which are dense, schema-driven, and operationally constrained. To address these limitations, we propose SCAIR (Schema-Conditioned Agentic Iterative Reasoning), a training-free framework that integrates structured planning with controlled iterative reasoning by injecting schema-conditioned structural priors and enforcing schema-aware traversal during multi-hop reasoning. Experiments on an enterprise-oriented benchmark constructed from a real-world Configuration Management DataBase (CMDB) demonstrate that SCAIR substantially improves performance over existing KG-RAG methods. Crucially, our study highlights that reliable enterprise graph reasoning cannot rely on generic agentic designs; instead, it must explicitly incorporate the target domain’s structural and operational constraints into the reasoning process. We demonstrate that by aligning agent design with business logic, substantial performance gains can be achieved without the need for costly model retraining.
2025
Over-Generation and Compaction: A Prompting Strategy for Procedural Text Adaptation with Large Language Models
Hyeongsik Kim | Yanheng Xu | Chaoqun Dong | Fei Du
Findings of the Association for Computational Linguistics: EMNLP 2025
Hyeongsik Kim | Yanheng Xu | Chaoqun Dong | Fei Du
Findings of the Association for Computational Linguistics: EMNLP 2025
Procedural text adaptation—such as modifying recipes or revising instructional guides—has traditionally relied on specialized models extensively fine‐tuned for specific domains. To address the scalability limitations of such approaches, recent research has increasingly turned to general‐purpose large language models (LLMs). However, existing prompting strategies for LLMs often yield superficial or erroneous adaptations due to alignment‐induced biases and the inherent complexity of procedural editing. To overcome these challenges, we propose the Over‐generation‐and‐Compaction (OC) prompting strategy, which first elicits an exhaustive set of procedural details to leverage the model’s latent knowledge, and subsequently compacts them into concise, coherent adaptations. We further introduce Recipe Consistency & Feasibility (RCF), a novel metric for systematically assessing procedural validity and practicality in cooking recipe adaptations. Experiments on public datasets demonstrate that OC significantly improves adaptation consistency and feasibility compared to baseline prompting methods, without the need for additional fine-tuning or curated training resources.