High-stakes tabular pipelines rely on scattered, static quality checks that are hard to evolve and audit against policy intent. Regulated domains particularly suffer as the LLM-era automation raises expectations for traceability and accountability. We propose a vision for an ontology-grounded, repository-native data quality layer in which rules are first-class artifacts: versioned, provenance-linked to governance texts, and re-playable through immutable execution traces. As a first step toward validating this vision, we present a concrete implementation of its agentic rule-discovery core with two rule acquisition modes (Full-Agentic and Guided) and a human-in-the-loop (HITL) review interface. We define an evaluation framework and run experiments addressing whether our fully autonomous, divide-and-conquer agentic rule discovery produces rules of the same quality and diversity as those specified by a human expert, reporting preliminary results on two real world industry datasets in the finance and retail domains.
Figures & tables
Requirement
What it enforces / example
Syntactic validity
Types, ranges, formats across flat files and joins; referential integrity via keys/views.
Semantic correctness
Ontology-grounded invariants; e.g., notional >0 consistent with product type in finance via trade → instrument → client, or a medication dose within an age-adjusted safe range in healthcare.
Temporal consistency
No future-dated events relative to ingestion; consistent time-series snapshots across grains.
Cross-table reconciliation
Aggregates align with primaries; e.g., ledger totals vs. front-office trades, or risk vs. accounting views.
Table 1: Core data-quality requirements for analytics-aware rules.
Figure 1: Implemented system overview.
Dataset
Mode
p^good
Berka
Full agentic
0.890
Guided
0.880
H&M
Full agentic
0.922
Guided
0.850
Overall
Full agentic
0.906
Guided
0.865
Table 2: Mean good-rule rate across runs per dataset and mode.
Comparison
HL
90% CI
r
Power
Berka
+0.004
[−0.112,+0.135]
0
<1%
H&M
+0.064
[+0.029,+0.129]
−1
36.5%
Overall
+0.037
[−0.008,+0.089]
−0.50
27.8%
Matched-scope control
Overall
+0.037
[−0.027,+0.094]
−0.38
3.5
Table 3: Non-parametric TOST equivalence analysis for RQ1 good-rule rate (Full Agentic − Guided); equivalence margin Δ=0.0556 . HL: Hodges–Lehmann shift with exact CI from the inverted Mann-Whitney statistic; r : rank-biserial effect size (negative favor Full Agentic mode); Power: achieved TOST power. Runs required for 80% power: 28 (Berka), 6 (H&M), 16 (Overall). The matched-scope: rules with column scope shared by all Guided runs.
Subset
n
Exact
α [95% CI]
AC2 [95% CI]
Overall
541
77.3
0.174 [.074,.279]
0.812 [.770,.851]
Berka
317
76.0
0.165 [.035,.292]
0.810 [.754,.858]
H&M
224
79.0
0.189 [.021,.350]
0.815 [.747,.872]
Agentic
340
76.8
0.061 [ − .056,.187]
0.816 [.764,.864]
Guided
201
78.1
0.326 [.150,.484]
0.805 [.730,.868]
Table 4: Inter-rater agreement over doubly-rated rules. Exact : % rules where both reviewers gave same verdict. α : ordinal Krippendorff’s α ; AC2: Gwet’s AC2; both with 95% bootstrap intervals. α is deflated relative to AC2 because accept accounts for 84.8% of all ratings.
Weight config
IDSA
IDSG
Equal
0.732
0.729
Sem.-heavy
0.648
0.648
Syn.-heavy
0.749
0.750
Scope-heavy
0.798
0.788
Table 5: Mean IDS across datasets ( nA=nG=8 runs per mode).
Weights
HL
90% CI
r
Power
Equal
−0.003
[−0.010,+0.012]
+0.16
57%
Semantic
−0.005
[−0.015,+0.008]
+0.22
44%
Syntax
−0.005
[−0.016,+0.010]
+0.25
71%
Scope
+0.003
[−0.004,+0.019]
−0.28
53%
Table 6: Non-parametric TOST equivalence analysis for RQ2 IDS (Full Agentic − Guided); equivalence margin Δ=0.0202 . HL: Hodges–Lehmann shift with exact CI from the inverted Mann-Whitney statistic; r : rank-biserial effect size. Runs required for 80% power: 11 (Equal), 13 (Semantic), 9 (Syntax), 11 (Scope).
Appendix figures & tables10 assets
Supplementary material from the paper’s appendix.
Appendix
Rule type
Finance example
Grounding
Calendar and market hours
No equity trades on Sunday. Trades outside market hours must be flagged or explained.
Market calendar, policy
Temporal consistency
Settlement date must be after trade date. For many products it follows a fixed lag such as T plus 2, with exceptions.
Policy, product spec
Cross field meaning
Notional should match quantity times price within tolerance and currency scaling.
Domain math, evidence
Entity state
Counterparty must be active on trade date. Trades for blocked accounts must be rejected.
Reference data, policy
Cross table reconciliation
Trade totals must reconcile with positions and ledger aggregates at the portfolio level.
Reporting definition
Appendix
Table 7: Examples of policy grounded semantic rules that go beyond traditional checks.
Agent
Descriptive
Diagnostic
Predictive
Prescriptive
Ontology Gen.
Grounds columns into entities, measures, and units.
Adds semantic context for anomaly explanation.
Marks forecastable measures and derived metrics.
Enables domain-aware imputation and unit normalization.
Rule Discovery
Drafts checks with clear summaries and coverage metrics.
Encodes conditional/composite rules for diagnosis.
Proposes drift-sensitive and stability-aware rules.
Suggests adaptive thresholds and remediation-aware rules.
Table 11: Profiler modules and their evidence outputs.
Figure 2: Full envisioned system overview: all components sharing a central Artifacts Repository across the full DQ lifecycle.
Category
Applied to
Share
Range / statistical
numeric bounds, thresholds, sign, outlier bounds
24.2%
Key / uniqueness
primary-key or unique-column assertions
23.2%
Categorical domain / vocabulary
enumerated valid-value list
22.1%
Syntactic format
regex, length, type, encoding, calendar-validity of a date string
10.5%
Completeness / NOT NULL
presence assertions
9.5%
Functional dependency
X→Y within a table
6.3%
Appendix
Table 12: Taxonomy of AI-mined rule types, tagged on a random 25% sample ( n=85 ) of all AI-mined rules.
Figure 3: Good-rule rate p^good per mode and dataset (dots = individual runs, bar = mean, error bars = 95% CI -interval on mean).
Figure 4: IDS distributions per mode across weight configurations ( n1=n2=8 runs per mode, pre-review rules).
Dataset
Mode
Nrules
Nratings
Accept
Modify
Reject
Berka
Full agentic
216
432
363 (84.0%)
42 (9.7%)
27 (6.2%)
Guided
101
202
168 (83.2%)
18 (8.9%)
16 (7.9%)
H&M
Full agentic
124
248
222 (89.5%)
13 (5.2%)
13 (5.2%)
Guided
100
200
164 (82.0%)
12 (6.0%)
24 (12.0%)
Overall
Full agentic
340
680
585 (86.0%)
55 (8.1%)
40 (5.9%)
Guided
201
402
332 (82.6%)
30 (7.5%)
40 (10.0%)
Appendix
Table 13: HITL review outcomes per mode and dataset (pooled across 8 runs). Nrules : rules proposed; Nratings=2Nrules , since the blinded block design has every rule rated by exactly two reviewers who did not author it (§ C ). Accept/Modify/Reject are counts over ratings, with row percentages. Good-rule rates are reported in Table 2 as the mean across good rule rates of reviewer runs. The Full Agentic mode proposes more rules than Guided because the orchestrator enforces a per-column coverage criterion, whereas a human expert might target a narrower set of constraints. The matched-scope control in § 5.4 re-runs the RQ1 analysis with this volume asymmetry removed.
The validation of data, such as customer and employee data, is an important task in many organizations. Errors in data can have severe consequences. For example, a wrong drug unit in a patient record can lead to life-threatening medication errors, and a missing street number in an address to failed deliveries. Companies often employ rule-based enterprise data quality (DQ) tools, which allow domain experts to specify rules to validate the data over time. While rule-based DQ tools are computationally efficient and provide explainable reports, maintaining a comprehensive rule set manually is challenging, as domain experts often overlook essential rules, especially in complex domains and large data volumes. Hence, closing these gaps remains an open problem in practice. In this paper, we address the challenge of automated DQ rule generation. For this, we formalize a generalizable generate-filter framework and introduce LeDQeR, an LLM-based DQ rule generation approach. First, a large language model (LLM) generates candidates rules from an observed dirty data tuple for a given rule-based DQ tool syntax. Second, we apply four filter techniques that ensure the (i) executability, (ii) correctness, and (iii) generalizability, and avoid (iv) redundancy of the generated rules. An extensive experimental evaluation suggests that LeDQeR is able to produce effective and compact rule sets for various datasets and error types.
Anna-Christina Glock, Thomas Hütter, Johannes Fürnkranz +3
Software Competence Center Hagenberg, Austria · Johannes Kepler University Linz, Austria · Austrian Post Vienna, Austria +1
LLM-generated records increasingly populate production information systems where they are treated as data assets subject to the same quality expectations as records from operational databases. A single such record can simultaneously satisfy and violate a quality rule: a grounded fact adjacent to a hallucination, a useful answer adjacent to a stereotype. Classical data cleaning cannot resolve this because the two judgments are incompatible over the same span; a single LLM judge cannot either, since it shares the training biases that produced the conflict. Existing interventions such as prompt engineering, chain-of-thought, and RLHF reduce surface error rates but provide no audit trail and cannot distinguish genuine remediation from blanket suppression. The question is whether a deterministic check over structured inter-agent records can catch the defects that referential checks alone miss. We present BiasGuard-D: two adversarial roles drawn from distinct model families exchange typed claim documents, a three-model quorum adjudicates by majority vote, and a combined referential-plus-semantic invariant validates the verdict. The semantic component fires on verdicts referential checks miss; removing the iterative loop drops invariant satisfaction sharply. The deliberation layer transfers from stereotype to hallucination remediation on HaluEval QA with only role-framing changes, raising right-answer recovery by 49 percentage points; the triage gate required a cross-family second auditor to maintain recall on objective hallucination. Every claim, vote, and instruction is stored as a typed record giving operators a provenance trail auditable under emerging AI regulations.
Data quality assessment is a critical prerequisite for effective data analytics and data-driven decision-making, yet it remains a challenging task due to the inherently context-dependent nature of data quality. Existing approaches often rely on static rules or manual assessment strategies, limiting their adaptability to diverse usage scenarios and constraining automation at scale. Recent advances in artificial intelligence, particularly large language models, offer new opportunities for automating data quality assessment, but raise concerns related to reliability, grounding, and execution safety. In this paper, we propose a unified agentic-retrieval framework for autonomous context-aware data quality assessment. The framework interprets natural-language descriptions of intended data usage, derives context-aware assessment strategies, and generates executable validation logic through a multi-agent workflow. To ensure operational reliability, the framework introduces a feasibility validation stage that evaluates the realism and executability of generated assessment specifications before execution, enabling iterative refinement when necessary. Accepted validation logic is executed deterministically to guarantee reproducible and auditable results. We implement the proposed framework as an end-to-end prototype and evaluate it across multiple usage scenarios applied to the same dataset. The results demonstrate that assessment outcomes adapt meaningfully to different intended uses, while feasibility-gated execution reduces unrealistic or non-executable rule generation. The proposed approach provides a practical foundation for deploying autonomous yet controlled data quality assessment in modern data-driven environments.
Hadi Fadlallah, Ibrahim Dhaini, Fatima Mubarak +1
University of Sciences and Arts in Lebanon, Beirut, Lebanon · Saint-Joseph University of Beirut2026, Beirut, Lebanon