PIE-APT introduces a unified framework for abductive planning over Temporal Dynamic Knowledge Graphs (TDKGs) using two modules: PIE-Abducer, which performs incremental direct-derivation abduction, and PIE-APT, which interleaves backward‑chaining A* search with PIE-Abducer to generate action sequences and abductive assumptions. The approach operates natively on the expressive SROIQ Description Logic, leveraging an incremental reasoner to maintain decidability and bypass the Ramification Problem. Evaluation on four OWL benchmarks demonstrates qualitative superiority over classical planners and shows that the direct‑derivation method outperforms a Minimal Hitting Set baseline in abductive enrichment.
By Amir Hossein Sharafi, Alireza Shahbazi
The paper investigates how multiple pre‑action controls—authority, resource, and evidence gates—interact in agentic AI systems. It formalizes remediation‑induced control coupling, showing that remediation can invalidate earlier judgments and that the order of remediation matters. The authors propose a remediate‑and‑regate protocol to restore soundness, analyze non‑commuting remediation operators, and demonstrate the approach on a deterministic open‑data artifact with three published engines.
By Gaston Besanson
arXiv:2606. 12320v1 Announce Type: new Abstract: Enterprise security was built to govern data boundaries: the protected surface was data at rest and in transit, and the controls -- access control, data-loss prevention, perimeter inspection -- governed crossings of that boundary.
By Krti Tallam
The paper introduces complete cyclic subtask graphs for large language model agents, enabling a workflow controller where all subtasks are fully connected and a unified agent selects transitions based on natural‑language criteria. It evaluates task‑specific and benchmark‑generic cyclic graphs on TextCraft, ALFWorld, and Finance‑Agent, comparing them to ReAct and dependency‑directed workflows, and identifies three distinct workflow signatures that influence the effectiveness of cyclic routing. The study also provides a workflow‑signature matrix, robustness analysis, token‑cost accounting, and failure‑mode structure, concluding that cyclic subtask graphs serve as a diagnostic tool to determine when flexible backtracking is worthwhile versus when simpler controllers suffice.
By Luay Gharzeddine, Samer Saab Jr
arXiv:2606. 23938v1 Announce Type: new Abstract: Driving VLA models incorporating Chain-of-Thought (CoT) reasoning are attractive because they leverage pretrained VLM representations and expose intermediate decisions in natural language, yet current rationales often lack the step-by-step decision semantics needed to keep the rationale causally connected to the planned motion.
By Xiangbo Gao, Xiukun Huang, Boyu Lu, Junge Zhang, Mengjie Mao, Jiachen Li, Wei Xiong, Zhengzhong Tu
arXiv:2608.30250v1 Announce Type: new
Abstract: This paper addresses the problem of translating natural-language routing rules written by business administrators into executable workflow graphs for e...
By Anand Iyer, Bhanu Khetharpal, Srinivas Upadhya, Ramkumar Rajagopal
SCOPE compiles natural‑language policies into neurosymbolic predicate programs that combine small neural models, deterministic extractors, and logical composition. The system is jointly optimized with adversarially generated counterexamples, achieving higher accuracy than prompt‑optimization, task‑decomposition, and workflow‑generation baselines on real‑world policy benchmarks. Programs trained with the weakest executor transfer to other models, enabling deployment on inexpensive models with stable, interpretable predictions.
By Arnon Mazza, Elad Levi
arXiv:2608. 16224v1 Announce Type: cross Abstract: By leveraging large-scale pretraining, LLMs can interpret diverse temporal expressions and question formulations without task-specific training.
By Xinlong Dai, Jinchuan Zhang, Lei Gao, Xinzhe Hu, Yuefeng He, Hui Gao
arXiv:2508. 02721v2 Announce Type: replace-cross Abstract: While powerful, the inherent non-determinism of large language model (LLM) agents limits their application in structured operational environments where procedural fidelity and predictable execution are strict requirements.
By Libin Qiu, Yuhang Ye, Zhirong Gao, Xide Zou, Junfu Chen, Ziming Gui, Weizhi Huang, Xiaobo Xue, Wenkai Qiu, Kun Zhao
The paper introduces the Belief-State Engine (BSE), an inference module that supplies a large language model (LLM) with a Bayesian posterior over hidden states in a partially observable Markov decision process (POMDP). By keeping the raw action‑observation log hidden from the LLM, the BSE ensures the agent behaves as a sound Markov policy on the belief MDP, thereby inheriting classical POMDP optimality guarantees. Experiments on the Tiger POMDP and a red‑team attack‑graph task show that BSE‑augmented agents outperform six baselines in task return, belief calibration, and decision consistency.
By Arnab Chattopadhayay, Debdipta Halder
The paper introduces the concept of Compositional Policy Violations (CPVs), where each step in an agentic AI workflow passes its individual compliance check, yet the overall execution violates higher‑level policies such as referral thresholds or authority limits. It categorizes CPVs into four types—Authority Creep, Threshold Laundering, Cumulative Sum Violation, and Context Collapse—and argues that the appropriate remedy depends on where the guarded quantity changes. To address this, the authors propose a provenance‑aware runtime architecture that evaluates policies over complete execution traces, recomputing guarded quantities from raw provenance rather than relying on step‑level outputs.
By Ashwini Kurady, Sri Sai Charith Grandhi, Rajesh Gupta, Sumit Mamoria
arXiv:2607. 18100v1 Announce Type: new Abstract: Extended reasoning has become standard for frontier Large Language Models (LLMs), yet the trajectories these models produce remain largely uncontrollable.
By Sheldon Yu, Tong Yu, Xunyi Jiang, Rohan Surana, Gagan Mundada, Sungchul Kim, Lina Yao, Julian McAuley, Junda Wu