Credo: Declarative Control of LLM Pipelines via Beliefs and Policies

• URL: http://arxiv.org/abs/2604.14401v1
• Date: Wed, 15 Apr 2026 20:31:48 GMT
• Title: Credo: Declarative Control of LLM Pipelines via Beliefs and Policies
• Abstract summary: This paper introduces Credo, which represents semantic state as beliefs and regulates behavior using declarative policies defined over these beliefs.<n>This design supports adaptive, auditable, and composable execution through a database-backed semantic control plane.<n>We showcase these concepts in a decision-control scenario, where beliefs and policies declaratively guide critical execution choices.
• Score: 1.0851051226732167
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Agentic AI systems are becoming commonplace in domains that require long-lived, stateful decision-making in continuously evolving conditions. As such, correctness depends not only on the output of individual model calls, but also on how to best adapt when incorporating new evidence or revising prior conclusions. However, existing frameworks rely on imperative control loops, ephemeral memory, and prompt-embedded logic, making agent behavior opaque, brittle, and difficult to verify. This paper introduces Credo, which represents semantic state as beliefs and regulates behavior using declarative policies defined over these beliefs. This design supports adaptive, auditable, and composable execution through a database-backed semantic control plane. We showcase these concepts in a decision-control scenario, where beliefs and policies declaratively guide critical execution choices (e.g., model selection, retrieval, corrective re-execution), enabling dynamic behavior without requiring any changes to the underlying pipeline code.

Related papers

• Formal Verification of Agentic Systems over Operational Data [59.98246281888422]
  Agentic systems driven by large language models (LLMs) are increasingly deployed in real-world where they act on persistent operational data.<n>Existing approaches do not provide such system-level guarantees.<n>We study here the verification of agentic systems comprising a single LLM and a tool orchestration harness over relational operational data.
  arXiv  Detail & Related papers  (2026-08-04T13:01:30Z)
• FAVA: Formal Authorization for Verified Agents with Evidence-Backed Permission Graphs [11.447078130049512]
  FAVA is a permission-carrying authorization framework for agent execution.<n>We evaluate FAVA across OpenAgentSafety, OctoBench, and ActPlane scenarios.
  arXiv  Detail & Related papers  (2026-07-29T09:41:07Z)
• CAVA: Canonical Action Verification and Attestation for Runtime Governance of Agentic AI Systems [0.6526824510982799]
  This paper presents a runtime-semantics layer for converting heterogeneous agent activity into canonical runtime objects.<n>The contribution is a systems formulation of action-level canonicalization and policy-addressable semantic patterns as a necessary substrate for deployer-side AI governance.
  arXiv  Detail & Related papers  (2026-07-15T11:34:34Z)
• OLIVIA: Online Learning via Inference-time Action Adaptation for Decision Making in LLM ReAct Agents [74.20327254615854]
  Large language model agents interleave reasoning, action selection, and observation to solve sequential decision-making tasks.<n>Existing inference-time adaptation methods for LLM agents mainly rely on prompting or retrieval.<n>We propose OLIVIA, an inference-time action adaptation framework for ReAct-style agents.
  arXiv  Detail & Related papers  (2026-05-11T19:28:20Z)
• PolicyBank: Evolving Policy Understanding for LLM Agents [51.86716874651299]
  PolicyBank maintains structured, tool-level policy insights and iteratively refines them.<n>PolicyBank closes up to 82% of the gap toward a human oracle.
  arXiv  Detail & Related papers  (2026-04-16T20:29:30Z)
• Verification of Robust Properties for Access Control Policies [51.736723807086385]
  Existing methods for verifying access control policies require the policy to be complete and fully determined before verification can proceed.<n>We introduce robust property verification: the problem of determining what a policy's structure commits it to regardless of how pending decisions are resolved and regardless of subsequent extension.<n>We show that despite quantifying universally over all possible policy extensions the judgment reduces to proof search in a second-order logic programming language.
  arXiv  Detail & Related papers  (2026-03-13T17:14:38Z)
• Faramesh: A Protocol-Agnostic Execution Control Plane for Autonomous Agent Systems [0.0]
  Faramesh is a protocol-agnostic execution control plane that enforces execution-time authorization for agent-driven actions.<n>We show how these primitives yield enforceable, predictable governance for autonomous execution.
  arXiv  Detail & Related papers  (2026-01-25T08:27:27Z)
• Deriving Character Logic from Storyline as Codified Decision Trees [67.01182739162142]
  Role-playing (RP) agents rely on behavioral profiles to act consistently across diverse narrative contexts.<n>We propose Codified Decision Trees (CDT), a data-driven framework that induces an executable and interpretable decision structure from large-scale narrative data.
  arXiv  Detail & Related papers  (2026-01-15T05:12:43Z)
• Executable Ontologies in Game Development: From Algorithmic Control to Semantic World Modeling [51.56484100374058]
  We argue that Executable Ontologies (EO) represent a transition from algorithmic behavior programming to semantic world modeling.<n>We show how EO achieves prioritybased task interruption through dataflow conditions rather than explicit preemption logic.
  arXiv  Detail & Related papers  (2026-01-12T19:57:35Z)
• ACT: Agentic Classification Tree [33.65390081055222]
  We present the Agentic Classification Tree (ACT), which extends decision-tree methodology to unstructured inputs by formulating each split as a natural-language question.<n> Experiments on text benchmarks show that ACT matches or surpasses prompting-based baselines while producing transparent and interpretable decision paths.
  arXiv  Detail & Related papers  (2025-09-30T15:54:08Z)
• Making Prompts First-Class Citizens for Adaptive LLM Pipelines [46.59482681672941]
  We describe our vision and an initial design for SPEAR, a language and runtime that fills the prompt management gap.<n> SPEAR defines a prompt algebra that governs how prompts are constructed and adapted within a pipeline.<n>By treating prompt logic as structured data, SPEAR enables optimizations such as operator fusion, prefix caching, and view reuse.
  arXiv  Detail & Related papers  (2025-08-07T03:49:56Z)
• Few-shot Policy (de)composition in Conversational Question Answering [54.259440408606515]
  We propose a neuro-symbolic framework to detect policy compliance using large language models (LLMs) in a few-shot setting.<n>We show that our approach soundly reasons about policy compliance conversations by extracting sub-questions to be answered, assigning truth values from contextual information, and explicitly producing a set of logic statements from the given policies.<n>We apply this approach to the popular PCD and conversational machine reading benchmark, ShARC, and show competitive performance with no task-specific finetuning.
  arXiv  Detail & Related papers  (2025-01-20T08:40:15Z)
• Dichotomy of Control: Separating What You Can Control from What You Cannot [129.62135987416164]
  We propose a future-conditioned supervised learning framework that separates mechanisms within a policy's control (actions) from those beyond a policy's control (environmentity) We show that DoC yields policies that are consistent with their conditioning inputs, ensuring that conditioning a learned policy on a desired high-return future outcome will correctly induce high-return behavior.
  arXiv  Detail & Related papers  (2022-10-24T17:49:56Z)
• Towards Dynamic Consistency Checking in Goal-directed Predicate Answer Set Programming [2.3204178451683264]
  We present a variation of the top-down evaluation strategy, termed Dynamic Consistency checking. This makes it possible to determine when a literal is not compatible with the denials associated to the global constraints in the program. We have experimentally observed speedups of up to 90x w.r.t. the standard versions of s(CASP)
  arXiv  Detail & Related papers  (2021-10-22T20:38:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.