Skip to content
Preprint

Reifying Research Logic: AI-Assisted Workflow Construction and Incremental Refinement for Quantitative Syntax

Aug 2026 · 0 citations · 25 references
Computer Science

TL;DR

QLWF is a visual workflow platform that turns natural-language research descriptions into executable workflows through an AI assisted five-stage pipeline that supports incremental refinement, so saved workflows can be revised by changing only the parts that need to change rather than being rebuilt from scratch.

Abstract

Quantitative language research often depends on long chains of computational steps, yet the logic connecting those steps usually remains buried in scripts. This makes analyses harder to inspect, share, and revise than they need to be. Focusing on quantitative syntax, we present QLWF, a visual workflow platform that turns natural-language research descriptions into executable workflows through an AI assisted five-stage pipeline. In this setting, reification makes the research logic visible as a workflow, while formalization gives that workflow deterministic execution semantics. The language model is used only during construction. Execution is handled by a fixed node library and engine, which keeps the resulting workflows reproducible. QLWF also supports incremental refinement, so saved workflows can be revised by changing only the parts that need to change rather than being rebuilt from scratch. To evaluate the approach, we build a 64-task benchmark called QL-Bench from the quantitative-syntax literature. Across three runs, QLWF produces structurally valid and executable workflows for every task and reaches a mean output-plausibility rate of 98.4%, well above the prompt-based baselines. On a separate 12-task lifecycle benchmark, this refinement process succeeds in every case and uses roughly one-third of the tokens required by full regeneration. The paper also releases the node library, benchmark, workflow templates, and platform as reusable resources for quantitative-syntax research.

View source

Similar papers

#software testing Preprint Aug 2026

Natural-Language Workflows Are Not Software Yet: Artifact-Driven Compilation for Reliable Agent Execution

Artic is proposed, an artifact-driven workflow compiler that transforms a natural-language workflow into an artifact-driven workflow in which each step declares the artifacts it reads and writes, constraints gate produced artifacts, and explicit control transfers route execution.

Xiangzhe Xu, Hanxi Guo, Guangyu Shen et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Generating Workflow DAGs from Natural Language with Non-Reasoning LLMs

This paper addresses the problem of translating natural-language routing rules written by business administrators into executable workflow graphs for enterprise contact centers. Each target is a directed acyclic graph (DAG) of conditional actions with parallel branches, hit-first fallback chains, and per-branch Boolean predicates, encoded in the JSON dialect of a commercial routing platform. We show that neuro-symbolic decomposition enables lower-cost, non-reasoning large language models to generate complex workflow DAGs at production-relevant quality without expensive extended-reasoning models. Our central diagnostic is an emission-density bottleneck: on a 635-rule benchmark of manufactured synthetic data, models select the correct graph nodes with high accuracy but increasingly misconfigure attributes and Boolean grouping as the number of interdependent nodes emitted in one pass grows. We therefore move combinatorial graph construction from the model into a deterministic compiler driven by a compact intermediate representation, with a learned registry-selection front end that focuses generation on relevant vocabulary. Across four models, the full system reaches approximately 89% LLM-judge validity, approximately 90% exact-match condition accuracy, and 99-100% valid JSON while using roughly half the per-rule prompt tokens of a monolithic prompt. On GPT-5.3-chat, the method improves judge validity by 24 percentage points and achieves statistical equivalence to a reasoning model's out-of-the-box quality, although an approximately 8-point frontier gap remains. We also present a deployment path and transferable lessons for structured-generation applications.

Anand Iyer, Bhanu Khetharpal, Srinivas Upadhya et al. · 0 citations
Jul 2026

Execution-First Synthetic Tool-Use Trace Generation for LLM Agents

SyntheticAgentTraceQA is proposed, an execution- first framework for generating scalable supervision data for tool- augmented agents and shows that execution-grounded supervision improves tool execution behavior, reference-trace agreement, and answer-generation performance on the evaluated tasks.

Hafsa Ouajdi, Francesco Giannuzzo, Alaa Boukhary et al. · 1 citation · ⚡1
Jul 2026

COVENANT: Natural-Language Workflow Compilation for Aligned Agent Execution

COVENANT is proposed, a compiler-and-interpreter architecture for workflow-aligned agent execution that substantially mitigates workflow misalignment, moving LLM-agent alignment beyond isolated prompt following toward reliable execution of complex and multi-step workflows.

Jincheng Wang, Mingkai Zheng, Tao Wei · 1 citation
Open access Jul 2026

LLM-Based Formalization of Engineering Requirements into Ontology-Constrained Knowledge Graphs

Results indicate that ontology-constrained LLM pipelines can support the formalization of engineering requirements into semantically explicit graph representations that are suitable for downstream querying, validation, and analysis.

A. Stefanone, M. Rossoni, Giorgio Colombo · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.