Skip to content
Review Open access

Literal to a Fault? How Large Language Models Handle Instructions That Break Codified Operational Rules

Oct 2026 · Digital · Vol 6, pp. 83 · 0 citations · 6 references

TL;DR

A benchmark of 75 items grounded in the International Regulations for Preventing Collisions at Sea and in paraphrased International Civil Aviation Organization procedures, spanning four conflict framings, each presented with and without the governing rule and followed by a pushback turn is released for evaluating rule-aware assistants.

Abstract

When an operator’s instruction conflicts with a codified safety rule, an assistant should recognize the conflict and defer to the rule. This is a pragmatic problem with an objective answer: the correct action follows from a published regulation, while the difficulty is linguistic. Existing evaluations do not target this case: general safety benchmarks ask whether a model emits harmful content, instruction-following suites score obedience to formatting constraints, and work on sycophancy and rule-following shows that models can be argued out of a stated rule, but none set a user’s authoritative instruction against an external, codified rule whose deferral is objectively correct. This paper introduces a benchmark of 75 items (60 rule conflicts, 15 no-conflict controls) grounded in the International Regulations for Preventing Collisions at Sea (COLREGs) and in paraphrased International Civil Aviation Organization (ICAO) procedures, spanning four conflict framings, each presented with and without the governing rule and followed by a pushback turn. Eleven instruction-tuned models were evaluated across 1649 responses and scored by an independent language model judge (second judge Cohen’s kappa = 0.84). Because the items are author-constructed and now validated by two independent domain reviewers, compliance rates are reported as measurements on a validated benchmark rather than as mere rankings, though they remain bounded by the text scenario setting, and the model-scaling results in particular are treated as exploratory. Both model size and alignment were associated with unsafe compliance: within one family compliance fell overall from 0.51 at 0.5B to near zero at 14B, though not strictly monotonically, and at a fixed 7B size a less safety-tuned model complied far more than its aligned peers. Compliance concentrated on direct orders, fell when the rule was shown, rose under multi-turn pressure, and traded off against over-refusal, with the rule-context and multi-turn effects confirmed by item-paired tests and reported with confidence intervals. The benchmark is released for evaluating rule-aware assistants, together with the expert-validated item set and the validation materials.

Read PDF

Similar papers

#artificial intelligence Preprint Sep 2026

Not What You Meant: Can LLMs Follow a Specified Negation Semantics?

NAFBench is introduced, a procedural generator of solver-certified instances spanning four semantic viewpoints: SLDNF, well-founded semantics (WFS), and credulous and skeptical reasoning under stable-model semantics, which studies which reading of negation large language models adopt by default and whether they can ove...

Qiming Bao, Agnieszka Mensfelt, Michael J. Witbrock et al. · 0 citations
Preprint Oct 2026

Pinning Decisions Before Failure: Executable Records of Underspecified Choices in AI-Assisted Code Generation

A natural-language requirement leaves questions open, and a model asked to implement it settles them silently: across 600 generated test suites from three models, 42.7% contain no test that distinguishes the competing readings. An acceptance example written before implementing is the usual remedy, but an example both r...

Takeharu Mitsui · 0 citations
#natural language process... Preprint Oct 2026

What the Specification Did Not Say: Specification-Oracle Gaps in Test-Graded Coding-Agent Benchmarks

Coding-agent benchmarks often describe a task in natural language but grade it with tests taken from the upstream project. Passing those tests can require information the description never states: a constant's name, a module path, an exact message. We call this a specification-oracle gap: where it exists, a benchmark a...

Fei Ding · 0 citations
Preprint Oct 2026

Detection Is Not Enough: Reasoning Traces as Testable Program Hypotheses

When a language model is deployed, no reference solution exists, so the reasoning trace it writes is the only evidence for judging its answer. The reference-free substitutes each fail differently: self-assessment degrades the answer it was meant to protect, sampling agreement measures stability rather than correctness,...

Vaidehi Hegde · 0 citations
Preprint Oct 2026

LGMT: A Tool for Testing the Logical Reasoning Reliability of LLMs

Large Language Models (LLMs) increasingly serve as reasoning components in modern software systems, yet a model that answers a logical query correctly can contradict itself when the same problem is restated in an equivalent form. Static benchmarks evaluate queries in isolation and therefore fail to expose such inconsis...

Zeng-Hui Zhou, Xiao-Ke Fang, Zheng Zheng · 0 citations
#artificial intelligence Preprint Oct 2026

NOMOS: Compiling Written Policies into Statically Verified Tool-Call Gates for LLM Agents

Tool-using LLM agents violate the policies they are deployed to enforce, often silently. Prior defenses hand-write rules, query an LLM verifier per action, or compile policies through heavyweight formal machinery. Naive compilation fails: extracted rules block the tool satisfying their own precondition, or read argumen...

Min-Young Yu, Tony Kim, Janghong Choi · 0 citations

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