3 papers
cs.AI2026
Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer
Janis Zenkner, Tobias Sesterhenn, Tim Grams +1
Decomposition-based Programming-by-example (PBE) scales performance by splitting tasks into subtasks that a learned synthesizer solves: a decomposer predicts intermediate subgoals,…
cs.CL2025
MCP4IFC: IFC-Based Building Design Using Large Language Models
Bharathi Kannan Nithyanantham, Tobias Sesterhenn, Ashwin Nedungadi +4
Bringing generative AI into the architecture, engineering and construction (AEC) field requires systems that can translate natural language instructions into actions on standardize…
cs.SE2025
Shedding Light in Task Decomposition in Program Synthesis: The Driving Force of the Synthesizer Model
Janis Zenkner, Tobias Sesterhenn, Christian Bartelt
Task decomposition is a fundamental mechanism in program synthesis, enabling complex problems to be broken down into manageable subtasks. ExeDec, a state-of-the-art program synthes…