ADVENT: LLM-Driven Automatic Predicate Invention for ILP
Summary
ADVENT is an LLM-driven predicate invention (PI) mechanism designed to address a critical bottleneck in Inductive Logic Programming (ILP): the creation of new, semantically meaningful predicates. Traditional PI methods often require extensive domain expertise and generate opaque predicates, limiting their adaptability and reuse. ADVENT integrates Large Language Model abductive generation with Prolog deductive verification in an iterative loop, allowing concrete execution results to guide the LLM in refining candidate predicates. This mechanism identifies implicit patterns in structured relational data to invent auxiliary predicates with clear names and definitions. Invented predicates and learned rules are stored in a knowledge pool for cross-task reuse. Experiments on nine poker-hand concepts across seven LLMs demonstrated that LLM-driven PI achieved a 58% success rate where ILP alone failed, which increased to 80% with formal verification. The knowledge pool further yielded gains up to +31 percentage points, producing human-interpretable rules.
Key takeaway
For AI Scientists and NLP Engineers developing Inductive Logic Programming systems, ADVENT offers a path to overcome the predicate invention bottleneck. You should consider integrating LLM-driven abductive generation with formal deductive verification to create more interpretable and reusable predicates. This approach can significantly improve success rates in complex domains and build a valuable knowledge pool for future tasks, reducing reliance on manual domain expertise.
Key insights
ADVENT combines LLM abduction and Prolog deduction to automate predicate invention for ILP, enhancing interpretability and reuse.
Principles
- Iterative refinement improves LLM-generated predicates.
- Knowledge pools enable cross-task reuse.
- Formal verification boosts LLM output reliability.
Method
ADVENT employs an iterative loop where LLM abductive generation proposes predicates, and Prolog deductive verification refines them using concrete execution results, accumulating knowledge for reuse.
In practice
- Apply LLMs for pattern identification in relational data.
- Integrate deductive verification for AI-generated logic.
- Build knowledge pools for predicate reuse.
Topics
- Inductive Logic Programming
- Large Language Models
- Predicate Invention
- Abductive Reasoning
- Deductive Verification
- Knowledge Reuse
Best for: AI Scientist, NLP Engineer, Research Scientist
Related on AIssential
Editorial summary, takeaway, and curation by AIssential. Original article published by Artificial Intelligence.