betaFeedback

WorksComputer Science

NeSySpec: Neuro-Symbolic Technical Intelligence for Auditing Engineering Specifications with an Application to Aircraft

Abstract

Engineers who audit a declared specification of an engineered system need to know which physical constraints it respects, which it violates, which field was altered and how to correct it. NeSySpec is an integrated and interpretable neuro-symbolic audit framework, built on Logic Tensor Networks, that answers these questions in one pipeline. Its axioms encode the physical relations of the domain as differentiable graded predicates whose tolerances are learned from a fleet of real records; from the same degrees, it diagnoses the violated constraint, identifies the altered field by abduction, proposes a minimum-change correction and ties image evidence to the parts it describes, abstaining exactly where evidence is missing, and returns all of it in one verification report. We validate NeSySpec on 107 aircraft types, with 16 test aircraft of 9 families held out of training, on specification records paired with ground photographs and satellite imagery and on synthetic errors: generated corruptions, edits labeled from the edit alone and deliberate falsifications. NeSySpec combines all the assessed audit outputs in one pipeline, which no learned, rule-based, solver-based, neuro-symbolic or language-model comparator does; on the test aircraft none is ahead of it in the macro-F1 of its constraint verdicts, in naming the violated constraint and the altered field or in the repair error, and it is competitive in record and image-pair detection. Its diagnosis names the violated constraint in 94.2% of corrupted test records, against 79.5% for classical Fellegi-Holt diagnosis, and on edits labeled from the edit alone, without retraining, abduction finds the altered field in 59.3% of records, against 30.6% for minimum-cardinality localization with random tie- breaking. Only the knowledge base, the visual predicates, the corruption generator and the data are specific to the domain.

Corresponding author. Lead author, who carried out the large majority of the work.

License. This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0, https://creativecommons.org/licenses/by/4.0/). Third-party photographs reproduced in the figures are excluded from this license.

Introduction

Certification, maintenance and procurement engineers work with engineered systems they did not design and reverse-engineer them from declared specifications of masses, dimensions, ratings and performance. A record can be incomplete, inconsistent, valid for another variant or misreported, and public knowledge bases hold wrong numerical values [1]; the errors of a record propagate into the performance models it feeds [2]. Auditing such records falls within the scope of civil technical intelligence, which gathers and assesses information about technologies and technical products [3, 4]. Technical intelligence increasingly draws on open sources [5, 6]. For aircraft, photographs and satellite imagery can also help verify the visually observable attributes reported in the specifications [7, 8]. We use reverse engineering in a first-approach sense: inferring which physical relations a declared specification and, when available, its image respect or violate, which field departs from them and which value restores them. Table 1 lists the acronyms.

AcronymMeaningAcronymMeaning
AUROCarea under the receiver operating characteristic curveMLPmultilayer perceptron
BCEbinary cross-entropyMLP-SHAPgrouped SHAP attributions of the residual MLP
CADcomputer-aided designMTOWmaximum take-off mass
CAMclass activation mapNeSyneuro-symbolic artificial intelligence
CFDcomputational fluid dynamicsOEWoperating empty mass
FAAFederal Aviation AdministrationPGDprojected gradient descent
FEMfinite element methodPSLprobabilistic soft logic
FPRfalse-positive rateRRRRight for the Right Reasons
ISAInternational Standard AtmosphereSAMSegment Anything Model
LENLogic Explained NetworksSHAPShapley additive explanations
LTNLogic Tensor NetworksSMTsatisfiability modulo theories
MCARmissing completely at randomSVMsupport vector machine
MICEmultivariate imputation by chained equationsTPRtrue-positive rate

Table 1. Acronyms.

Learned methods, from anomaly detectors to tabular foundation models and language models, score each record [9, 10, 11], with field-level attributions [12]. Statistical data editing and consistency-based diagnosis identify violated constraints and the fields implicated in those violations, based on bounds set by experts [13, 14]. Neuro-Symbolic Artificial Intelligence (NeSy) integrates learning with explicit knowledge and reasoning [15, 16], also surveyed for advanced air mobility [17], and can learn such bounds from data together with the constraints they delimit. To our knowledge, no previous work provides and evaluates together the outputs that such an audit needs, from the violated constraint and the altered field to part-grounded image evidence and a report (Table 2).

WorkViolated constraintAltered fieldRepair proposalExact abstentionLearned tolerancesPart groundingRecord report
LTN and its applications [18, 19, 39, 40, 41](✓)(✓)✗(✓)(✓)(✓)✗
DeepProbLog, Scallop, NeurASP, abductive learningb [42, 43, 44, 45](✓)(✓)(✓)(✓)(✓)✗✗
DL2a, semantic loss, constraint layersa [20, 46, 47](✓)✗(✓)✗✗✗✗
KENN, LEN, PSLb [48, 49, 50](✓)(✓)(✓)(✓)(✓)✗(✓)
Statistical data editing and validationa [13, 23]✓✓✓✓(✓)✗✓
SMT diagnosisa, language model with SMT [14, 28, 51]✓✓✓(✓)✗✗(✓)
HoloClean, Deequ [25, 31](✓)✓✓✗(✓)✗(✓)
Learned and language-model data cleaning [26, 37, 38](✓)✓✓✗(✓)✗(✓)
Tabular learners and anomaly scoresa [10, 11]✗✗✗(✓)✗✗✗
Language models with rulesa [36, 52](✓)(✓)(✓)(✓)(✓)✗(✓)
Vision-language models with rulesa [53, 54](✓)✗✗(✓)✗✗(✓)
Rule checking of building designs [29, 30]✓(✓)✗✗✗✗✓
Hybrid fault diagnosis [33, 34]✓✓✗✗✓✗(✓)
Neuro-symbolic visual compliance checking [55, 56]✓✓✗✗✗(✓)(✓)
Explanation supervisiona [57, 58, 59, 60, 61]✗✗✗✗✗(✓)✗
Tabular-image fusiona [62, 63]✗✗✗(✓)✗✗✗
NeSySpec (ours)✔✔✔✔✔✔✔

Table 2. Comparison with the state of the art. ✓: provided and evaluated in a cited work; (✓): expressible or partially provided; ✗: not reported. a Benchmarked here (§ 4); constraint layers used for repair ordering (§ 4.3). b Expressible capabilities, not evaluated in the cited works or benchmarked here.

We present NeSySpec, an integrated and interpretable neuro-symbolic framework for auditing engineering specifications, built on Logic Tensor Networks (LTN) [19]: trained on fleet data, it determines through its logical axioms which physical constraints a declared record respects and which it violates, and returns a verification report (Figure 1 and Figure 5). Its graded predicates measure each physical, definitional or regulatory relation by its residual against bands learned from the training fleet, and cross-modal axioms compare the fields with what a vision module reads. Masked quantification gives NeSySpec exact abstention on missing evidence: each verdict reduces to the constraints that the available evidence makes checkable, and the report lists every undeclared field with the constraints it leaves unchecked. The audit proceeds from detection to diagnosis and repair. It first scores the record using a masked mean of constraint violation degrees. This overall verdict can then be traced back to individual constraints, with the largest violation degree identifying the most violated constraint. An abductive search over single-field changes then localizes the altered field. Finally, a minimum-change repair searches for the smallest adjustment that restores coherence. A grounding axiom encourages each visual head to place its class-activation evidence on the part its predicate describes, so that the report ties image evidence to parts.

Image not extracted

Figure 1. Overview of the NeSySpec pipeline.

Image not extracted

Figure 5. Verification report of one declared record.

We validate NeSySpec on 107 aircraft, with specification records, FGVC-Aircraft photographs [7] and RarePlanes satellite imagery [8], holding 16 test aircraft of 9 families out of training, and evaluate constraint verdicts and diagnosis, field localization and repair, record coherence, missing evidence and absent images, the grounding of the visual axioms and robustness to deliberate falsification, on errors labeled by the corruption generator and on errors labeled from the edit alone (§ 4). The constraint verdicts reach a macro-F1 of 0.795 on generator labels and, without retraining, 0.575 on intervention labels, above a network trained with the DL2 loss on the same residuals and targets, the like-for-like neuro-symbolic test, and find every labeled violation in 0.934 of generator-labeled test corruptions against 0.522 for that network, with micro precision on par on test and lower on the unseen class (§ 4.2, Appendix § 15.§ 1). The largest-violation key identifies the violated constraint in 0.942 of generator-labeled test corruptions, outperforming Fellegi–Holt, solver-based and rule-based diagnosis, DL2 applied to the declared fields, and a prompted language model. Abduction then traces the error to an individual field, correctly identifying the altered field in 0.593 of independently labeled errors. By comparison, minimum-cardinality localization reaches 0.306 with random tie-breaking and 0.453 with oracle tie-breaking; a sizing-regression residual also reaches 0.453 (Figure 6). The record verdict detects incoherent records at a test AUROC of 0.979 on generator labels, and on satellite pairs the multimodal verifier, which names the contradicted axiom, detects incoherent record-image pairs at 0.994 over all pair types, against 0.748 for a prompted vision-language model (§ 4.4). Table 5 lines these results up. No comparator returns every output of the audit, and on the test aircraft no comparator is ahead of NeSySpec in the macro-F1 of the constraint verdicts, in naming the violated constraint and the altered field or in the repair error on the altered field; in record and pair detection, learners on the residuals and late fusions are close to it and in some settings rank higher (§ 4.1).

MethodVerdicts macro-F1Violated constraintAltered fieldRepair errorExact, no imagePart pointing, PASCAL-PartRecords AUROCHalf fields hidden, unseen classSatellite pairs
Learners on the physical residuals
Residual MLP······0.9900.536·
TabPFN v2 with native missing values······0.9570.539·
LightGBM trained with masks······-0.566·
MLP-SHAP0.693/0.479{sup}a`0.942····0.990-·
LightGBM-SHAP0.595/0.418{sup}a`0.871····0.957-·
Network with the DL2 loss, one head per constraint0.661/0.426{sup}b`0.752····0.965-·
Class-standardized residual0.714/0.480{sup}b`0.9290.403/-···--·
Solvers, statistics and imputation
Fellegi-Holt0.829/0.5050.795-0.241··0.856-·
Z30.829/0.5050.825--··0.867-·
Minimum-cardinality localization (Fellegi-Holt, MaxSMT), random tie-break--0.367/0.306-··--·
Same localization, oracle tie-break--0.629/0.453-··--·
Class I sizing regressions··0.597/0.4530.160··--·
MICE at the Class I field···0.120·····
Constraint-layer ordering (PiShield style)···0.218·····
Knowledge given as a loss or in words
DL2 method on the declared fields0.425/0.2590.443····0.703-·
Language model given the constraints in words0.153/-0.128····0.620-·
Images
Auxiliary localization loss·····0.739···
RRR, GradMask, Pukdee et al.·····lower···
End-to-end fusions trained on labeled pairs········lower{sup}c`
Learned fusions and heads on satellite pairs, NeSySpec’s second head included···0 of 207····close{sup}d`
Qwen3-VL-8B prompted with the rules········0.748
NeSySpec (ours)0.795/0.5750.9420.742/0.5930.1339 of 90.7370.9790.5770.994

Table 5. The audit at a glance: NeSySpec and its comparators on each output. Test unless stated otherwise; slash: generator/intervention labels. Diagnosis: top-1 accuracy; repair: log-space error on the altered field (lower is better); detection: AUROC (Z3 score: violated-edit count). Field masking is random; satellite AUROC pools all pair types. Exactness: satellite cells (test and unseen sites) whose no-image verdict matches the record verdict bit for bit. Pointing: 3 runs per method, loss weights 1/0.3 (ours/auxiliary). Fellegi–Holt/Z3 verdicts, MICE/Class I repairs and auxiliary-loss pointing are on par with NeSySpec. ·: output not provided or no image input; -: not reported. 1Corrupted records only; corresponding NeSySpec macro-F1: 0.832/0.601. 2Validation-tuned thresholds: network 0.746/0.541; residual 0.560 on intervention labels. 3ResNet-50 for both; test and unseen sites. 4Some fusions on knowledge-base truths, trained on labeled pairs, achieve higher AUROC on test swaps, unseen sites or with 30% of images missing (Section 4.4; Appendix G.5). Comparisons and intervals: Sections 4.2 to 4.6; Appendix H.

Image not extracted

Figure 6. Constraint verdicts, diagnosis and field localization.

Among the approaches evaluated here - the DL2 method on the declared fields, the network trained with the DL2 loss on the same residuals read per constraint, a constraint-layer repair ordering, LTN ablations, solver and rule diagnosis and prompted language and vision-language models -, NeSySpec is, to our knowledge, the most suitable neuro-symbolic framework for auditing engineering specifications: it provides and evaluates together the seven outputs of Table 2, from constraint verdicts and field localization to part-grounded image evidence and a verification report. Its logic contributes more to the physical audit than to record classification. Training its knowledge base through Real Logic (the differentiable formulation of first-order fuzzy logic underlying LTN [19]) improves detection over the same knowledge base left at its initial values. Detection also improves as more knowledge is encoded, a trend shared by a residual MLP using the same constraints (§ 4.8). Only the knowledge base, visual predicates, corruption generator and data of NeSySpec are aircraft-specific, so another engineered system enters through these four parts (Appendix § 9).

The contributions of this work are:

  • An integrated and interpretable neuro-symbolic audit framework on Logic Tensor Networks whose graded residual-aware axioms, trained on fleet data, give each physical constraint of a declared engineering specification a held, violated or masked verdict and derive from these verdicts the altered field, a repair proposal, an exact accounting of missing evidence, part-grounded visual evidence and a verification report;

  • A verification protocol that re-estimates the priors from training records, refits the generator

oracle without test or out-of-distribution aircraft, labels errors independently of the generator, reads the held and violated verdicts against per-constraint labels and stress-tests the verdicts against falsification and human part annotations;

  • A comparative study of rule-based and solver-based methods, models trained with constraint losses, language and vision-language models, and residual learners, all using the same physical knowledge base (Table 5). NeSySpec identifies the violated constraint more often than classical diagnosis, DL2 applied to the declared fields, and a prompted language model. It also identifies the altered field more often than minimum-cardinality localization with random tie-breaking and produces a repair proposal from the same violation degrees (Figure 6);

  • A deployment map (Table 6) that assigns each audit question to the output of NeSySpec that answers it, including its optional rank-then-explain alarm and critical-field alert.

RegimeWhat NeSySpec providesStrongest comparator
Workflow: run NeSySpec first and read its report; on a class without training aircraft, enable its optional rank-then-explain setting, in which a residual learner raises the alarm and NeSySpec explains it; cross-check a repair value against a statistical imputer such as MICE; against omission, enable the optional critical-field alert.
Constraint verdicts and diagnosis (§ 4.2)
classical diagnosis and other encodingsthe largest-violation key, from the verdict’s own degrees, above Fellegi-Holt, Z3 and the rules (also on intervention labels), the DL2-loss network’s key, the DL2 method on the declared fields and a language model; 0.812 where the crisp edits flag nothingthe crisp edits, on par where they flag the record (generator labels)
held or violated, test and unseen familiesthe constraint verdicts, macro-F1 0.795 on generator-label test, above the DL2-loss network, with the key, the field and a repaircrisp edits, on par in macro-F1; the DL2-loss network, with fewer false violations (0.020 against 0.074)
residual rankingsthe key, above both on 81 single-violation records and above the residual on the unseen class, with a held or violated verdict, a repair and exact abstentionthe class-standardized residual and MLP-SHAP, on par in distribution; MLP-SHAP on the unseen class
Field localization and repair (§ 4.3)
fieldabduction, above random tie-breaking on every split and label family and above the Class I sizing-regression residual on the unseen class and intervention labels, with no oracle to break tiesan oracle tie-break, on par in distribution
value, in distributionthe repair proposal, with its field and violated constraint in the same report, issued for flagged records (the proposals change 0.562 of clean and control records); the solver reaches its target on 0.555 of single-field test recordsMICE at the field of the Class I sizing-regression residual, on par, the recommended value-recovery step
Record coherence (§ 4.4)
in distributionthe record verdict, which with the key flags and correctly diagnoses 0.929 of corrupted test records, with the constraint, field and repair of each flagthe residual MLP, close in detection, and TabPFN v2, on par
class without training aircraftrank-then-explain (optional): false alarms on 0.205 of controls and 0.168 of 19 pristine records, with the constraint, field and repair behind each alarmthe residual MLP and TabPFN v2, in detection
intervention labelsthe key and abduction, without retraining, naming the constraint and the fieldTabPFN v2 (statistics from the scored rows) or the MLP retrained on them, in detection
record with an imagethe multimodal verifier (satellite), above a vision-language model given the rules and end-to-end fusions, and the cross-modal stratum (photographs), each naming the contradicted axiom, with the exact reductionvision-language models given the axioms, on par on test photographs; learned fusions on image swaps and unseen-site pairs; the largest vision-language model on unseen families
Missing evidence and absent images (§ 4.5)
10% of fields hidden, test or unseen familiesthe coverage, for the audit; NeSySpec with MICE imputation enabled, to detectthe MLP trained with masks (test) and the residual MLP (unseen families), against the masked verdict; the MLP with masks and the same imputer, on par with the MICE setting (test)
half hidden, unseen classthe masked verdict, above the residual MLP and TabPFN v2, with the checked constraints and an exact verdictLightGBM trained with masks, on par; MICE imputation at scoring, close
image absent or partly missingthe fused verdict, which reduces exactly to the record verdicton labeled pairs, heads trained with modality dropout, such as CatBoost on knowledge-base truths, to rank
Grounding of the visual axioms (§ 4.6)
any backbonethe grounding axiom, which localizes the annotated parts above RRF and GradMask under one protocol, with at most one collapsed head across loss weightsan auxiliary localization loss at its validation weight, on par with 3 runs each and higher on test pseudo-masks against the axiom’s 8 seeds
Robustness to deliberate falsification (§ 4.7)
cover-ups, up to five further editsthe record verdict, which a cover-up passes less often than the residual MLP, with the altered field and a repair for each flagrules with hierarchical pooling or a Mahalanobis distance, on par
omission of up to two fields, alert-awarethe optional critical-field alert, naming the undeclared field or violated constraint of each flagthe residual MLP with the same alert, on par with all splits pooled

Table 6. Deployment map.

The remainder of this paper is organized as follows. Section 2 reviews background and related works. Section 3 presents the NeSySpec framework in full. Section 4 reports experimental results. Section 5 concludes with directions for future work. Appendix A describes how to port NeSySpec to other engineered systems.

Background and Related Works

Background

Real Logic and Logic Tensor Networks. LTN [19] implement Real Logic, a first-order language whose symbols are interpreted on data by a parametric grounding GΘG_{\Theta}: constants are mapped to tensors of real features, variables to sequences of individuals, and predicates to differentiable functions into [0,1][0,1]. Fuzzy connectives and aggregators make the truth of every formula of a knowledge base K\mathcal{K} differentiable, so that Θ\Theta is learnable from data. In NeSySpec an individual is a declared record with its availability mask and an optional image, and the predicates are graded physical predicates and visual attribute heads (§ 3.2 and § 3.3). From the product configuration [19, 21], NeSySpec uses the negation ¬a=1−a\neg a = 1-a, the product t-norm a∧b=aba \wedge b = ab and the Reichenbach implication a→b=IR(a,b)=1−a+aba \to b = I_R(a,b) = 1-a+ab. The abovementioned implication passes its consequent the gradient ∂IR/∂b=a\partial I_R/\partial b = a, where the residuated Goguen and Łukasiewicz implications pass none wherever a≤ba \le b [21], so the localization pressure of the grounding axiom Pk→Loc⁡kP_k \to\operatorname{Loc}_k on a visual head grows with the truth of its own assertion (§ 3.3). The universal quantifier is interpreted by the generalized mean error of the truth values a1,…,ana_1,\ldots,a_n that a formula takes on nn individuals [19],

pME⁡p(a1,…,an)=1−(1n∑i=1n(1−ai)p)1/p,p≥1,(1)\operatorname{pME}_{p}(a_1,\ldots,a_n) = 1 - \left(\frac{1}{n}\sum_{i=1}^{n}(1-a_i)^p\right)^{1/p}, \qquad p \ge1, \tag*{(1)}

which is the arithmetic mean for p=1p=1 and tends to the minimum as p→∞p \to\infty. Guarded quantification, ∀x [g(x):φ(x)]\forall x\,[g(x) : \varphi(x)], aggregates only over the individuals that satisfy a crisp condition gg and passes no gradient to the others [19].

Learning from a knowledge base. Learning maximizes the satisfaction of the closed formulas φ\varphi of K\mathcal{K}, aggregated by an operator such as pME⁡p\operatorname{pME}_p into SatAgg⁡\operatorname{SatAgg} [19], that is, it minimizes

L(Θ)=1−SatAgg⁡φ∈KGΘ(φ).(2)\mathcal{L}(\Theta) = 1 - \operatorname{SatAgg}_{\varphi\in\mathcal{K}} \mathcal{G}_{\Theta}(\varphi). \tag*{(2)}

Labels enter as data axioms over the positive and negative examples of a predicate [19], whose satisfaction, aggregated with the log-product that van Krieken et al. [21] recommend, is the negative binary cross-entropy (BCE) up to normalization. In NeSySpec the verdict of a record is a masked aggregation of its axiom truths that applies this guard per axiom, with availability as the guard (§ 3.5), and both objectives are BCEs of data axioms, the visual one adding the loss of Eq. (2) over the grounding axioms (§ 3.2 and § 3.3).

Real Logic for specification auditing. Our formulation of the audit in Real Logic has four properties. First, the bands and slopes of graded predicates are learned through their truth values, jointly with the record verdict. Second, guarded quantification uses evidence availability as its guard: constraints whose required evidence is missing are excluded, and the verdict reduces exactly to that of the available constraints (Proposition 1). Third, physical predicates and visual heads share a common truth scale, allowing cross-modal axioms to enter the same knowledge base. Finally, the grounding axiom uses the Reichenbach implication to scale the localization pressure with the truth of the visual predicate.

In the specification stratum, learned graded predicates are aggregated by a masked mean, with no logical connectives between them. Each axiom therefore retains its own truth value at inference, and the record verdict decomposes into constraint-level verdicts. Crisp rule validation also provides exact abstention (Table 2), and § 4.8 examines the contribution of each of the four properties.

Related Works

Specification auditing draws on several lines of research, from detecting and repairing errors in structured records to combining domain knowledge with visual evidence. We review work on data editing and diagnosis, learned anomaly detection, differentiable logic and neuro-symbolic reasoning, explanation supervision, and multimodal verification.

Reverse engineering, specification records and data editing. Physics-driven correction flags machine-learning estimates of design parameters, such as those of an aero engine, whose accumulated physical error exceeds a threshold, and corrects them by surrogate-assisted optimization against physical evaluations [22]; NeSySpec works from fleet data without a simulator and names the constraint that fails. Fellegi–Holt editing localizes errors by finding the minimum-weight set of fields whose modification satisfies every edit [13]. Data validation leaves a rule with a missing value unevaluated [23]. Data repair methods, benchmarked by Ni et al. [24], correct cells through probabilistic inference under integrity constraints in HoloClean [25] or using a few example repairs in Baran [26]. The satisfiability modulo theories (SMT) solver Z3 [27] returns conflict sets for consistency-based diagnosis [14] as unsatisfiable cores. It also supports minimum-cardinality localization through MaxSMT [28]. Rule engines and language models check building designs against codes [29, 30]. Their bounds, where present, are crisp, set by experts or mined from data [31], and they take no image evidence; NeSySpec grades every constraint against bands learned from the fleet, ranks the violated constraints by the graded degrees of its own verdict, localizes the altered field by abduction with no oracle to break ties and adds image evidence (§ 4.2 and § 4.3). A reference architecture for auditing mechanical engineering drawings checks the entities read from them against a standards knowledge graph [32]. Hybrid fault diagnosis pairs model-based residuals with anomaly classifiers [33], or residuals learned from fault-free data with consistency-based isolation [34], and a neuro-symbolic architecture lets knowledge-based and learned methods support each other in anomaly detection and fault diagnosis [35], a division of labor that NeSySpec offers as its optional rank-then-explain alarm, a residual-learner alarm explained by the violated constraint.

Anomaly detection and learned detectors. TabPFN v2 [10] and AnoLLM [11] score records by in-context learning and language-model likelihood, RegValidator checks the detection ideas of a language model with data-validation rules [36], GIDCL detects and corrects errors with a graph network and cleaning rules generated by a language model [37], and ZeroED detects erroneous values without manual labels through language-model reasoning [38]. NeSySpec returns, for each record, which constraints the record respects and which it violates, the altered field, a repair proposal and the evidence coverage, together with a score; § 4.4 compares the scores in area under the receiver operating characteristic curve - AUROC.

Differentiable logic and neuro-symbolic frameworks. Neuro-symbolic methods use explicit knowledge to guide learning and reasoning. Frameworks such as LTN, DeepProbLog [42], Scallop [43] and NeurASP [44] combine trainable models with logical reasoning. Knowledge can also enter through training objectives or mechanisms that constrain or refine predictions, as in abductive learning [45], DL2 [20], the semantic loss [46], constraint layers [47, 64] and Knowledge Enhanced Neural Networks (KENN) [48]. Probabilistic soft logic (PSL) infers truth values for open atoms under weighted rules [50]. Logic Explained Networks (LEN) extract rules from a trained network [49]. These frameworks can compute a truth, a probability or a distance to satisfaction per formula, from which a violated constraint can be read by an argmax or argmin, can carry a tolerance band as a neural or weighted predicate, and marginalize, infer or leave free what is unobserved (Table 2, note b). Encoding NeSySpec’s knowledge base in DeepProbLog, Scallop or PSL would change its axiomatic and logical structure, with probabilistic facts and proofs in place of graded truths and masked quantification, so that comparison is left to future work (§ 5). NeSySpec joins these per-constraint truths with tolerance bands learned from the fleet, abstention under missing evidence (Proposition 1), a search for the altered field with its repair through the same degrees, part-grounded image evidence and a per-record report, provided and evaluated together, which no cited work does; Sections 4.2 and 4.8 compare it with the DL2 method on the declared fields and with a network trained with the DL2 loss on the same residuals, which returns per-constraint probabilities. LTN has grounded part-of relations, fault signatures, process traces [39, 65, 66], fault-diagnosis rules for gearboxes and rotating machinery [40, 41] and medical rules with learnable thresholds [18]; an answer set program names the missing, misplaced or wrongly connected component of electrical control panels after a separately trained detector [55], and GuardEn executes compiled safety rules on scene graphs of an image [56]; NeSySpec adds graded constraints against bands learned from the fleet and visual predicates grounded in the parts they describe (§ 4.6).

Explanation supervision and part-level evidence. Explanation-guided learning adds supervision on model explanations [67]. Right for the Right Reasons (RRR) penalizes input gradients in regions annotated as irrelevant [57]. Right with GradMask penalizes them outside the annotated region [58]. RES learns from imprecise human masks [59]. The Energy loss of Rao et al. [60] increases the share of positive attribution inside annotated bounding boxes, and Pukdee et al. [61] learn from explanation constraints satisfied in expectation. NeSySpec expresses part-level supervision as an axiom on each head’s class-activation map, gated by the head’s assertion and guarded by part visibility. Section 4.6 compares this approach with RRR, GradMask and Pukdee et al. under a common protocol.

Multimodal consistency and verifiers. TIP pre-trains on images and masked tables for incomplete tabular data [62], and AutoGluon-Multimodal (AutoGluon-MM) fuses tables and images with foundation models [63]. The fused verdict of NeSySpec aggregates its strata without labels and reduces exactly to the available constraints, and § 4.4 compares it with these fusions; its cross-modal axioms read the attributes predicted by the visual heads, as concept bottleneck models predict a label from predicted concepts [68]. Open vision-language models [53, 69] can judge whether a record and an image agree and a language model [52] whether a record is coherent, and vision-language models have been benchmarked on engineering rules, computer-aided design renderings and drawings, where they still struggle [54]; NeSySpec returns with its judgment a verdict for every constraint (§ 4.4).

Table 2 compares the reviewed approaches on seven outputs needed for specification auditing: identification of the violated constraint, localization of the altered field, a repair proposal, exact abstention under missing evidence, learned tolerances, part-grounded image evidence, and a per-record verification report. To our knowledge, none of the reviewed works provides and evaluates all seven outputs together. Statistical data editing and validation come closest, with crisp bounds set by experts or fitted to data and no image evidence. The neuro-symbolic formulation of NeSySpec uses graded constraint violation degrees for the largest-violation key and for abductive field localization, without an oracle to break ties (§ 4.2 and § 4.3).

Proposed Methodology

NeSySpec audits a declared record in one integrated, interpretable NeSy framework: through its logical axioms it gives a held or violated verdict on each physical relation that binds the record’s fields and, when an image is paired with it, on whether the image agrees. The framework is organized into seven modules (Figure 1), built on Real Logic (§ 2.1). Guarded quantification allows each axiom to contribute only when its required evidence is available (E1), while graded predicates express how well each constraint is satisfied (E2). A grounding axiom ties visual predictions to the relevant image parts (E3), and stratification preserves a separate verdict for each evidence source (E4). A monotone second head complements the main verdict with an additional score and diagnosis key (E5).

  • Data and Verification Instances encode records and images, then generate corrupted examples and controls;

  • Knowledge Base and Graded Predicates grade each constraint by a violation degree, with bands and slopes learned from the fleet (E2);

  • Vision Module and Grounding Axiom encourage each head to place its evidence on its part (E3);

  • Cross-Modal Axioms compare visual posteriors with declared fields;

  • Masked Stratified Aggregation guards each axiom by its availability, so the verdict reduces exactly to the available evidence (E1), with one stratum per evidence source (E4);

  • Verdict and Diagnosis Keys return the verdict and name the violated constraint, with a monotone second head (E5);

  • Verification Report and Optional Checks give the altered field, a repair proposal and the report, with three optional settings of the audit.

The verdict is the masked mean of the constraint degrees, so it decomposes into constraint-level verdicts, from which the violated constraint, the altered field, the repair, the accounting of missing evidence and the report follow; detection is one of these outputs. Algorithm E.1 in Appendix § 13 transcribes the forward pass from the code. In our framework, we used the LTNtorch library [70]. Appendix § 10 describes the organization of the implementation and gives an example of a verification report.

Domain-specific and domain-independent parts. The domain enters NeSySpec through the knowledge base, the visual predicates, the corruption generator and the data; masked aggregation, graded predicates, grounding axiom, keys, report and protocol are written to apply unchanged to engineered systems whose declared fields obey physical, definitional or regulatory relations with statable tolerances; fitted parameters and numbers concern aircraft. Appendix § 9 lists what a port to another engineered system requires.

Data and Verification Instances

Data acquisition. A specification record (Appendix § 12) for each of 107 aircraft types of 71 families in 7 classes declares 16 numeric fields in SI units: maximum take-off and operating empty mass MTOWMTOW and OEWOEW, wingspan bb, wing area SS, aspect ratio ARAR, fuselage length LfusL_{\mathrm{fus}}, cruise speed VcrV_{\mathrm{cr}} and altitude hcrh_{\mathrm{cr}}, range RR, ceiling hceilh_{\mathrm{ceil}}, total static thrust FtotF_{\mathrm{tot}} or shaft power PtotP_{\mathrm{tot}}, engine count nengn_{\mathrm{eng}}, usable fuel mass mfuelm_{\mathrm{fuel}}, stall speed VsV_{\mathrm{s}} and passenger limit npaxn_{\mathrm{pax}}, with the class cc and the engine type ee. Ground photographs of FGVC-Aircraft [7], 6,800 paired with the record of their type or family (Appendix § 12.§ 1), carry variant, family and manufacturer labels, from which per-variant attribute labels are assigned. The real release of RarePlanes [8] annotates 14,707 aircraft in satellite tiles; a diamond through nose, wingtips and tail and the attributes form a record of 9 numeric fields: wingspan bb, length LL, diamond area A⋄A_{\diamond}, nengn_{\mathrm{eng}}, vertical-stabilizer count nfinn_{\mathrm{fin}}, and codes for the airplane design group of the Federal Aviation Administration (FAA)5, canards, wing type tt and wing position, with the role rr and the propulsion π\pi.

Encoding. In an instance (x,m,I)(x,m,I), the record x∈(R∪{∅})nxx \in(\mathbb{R} \cup\{\varnothing\})^{n_x} holds nx=16n_x = 16 or 9 declared numeric fields and the categorical attributes, ∅\varnothing marking an undeclared field; mj=1[xj≠∅]m_j = 1[x_j \ne\varnothing], and I=∅I = \varnothing without an image. Axiom kk is available, αk(x,I)=1\alpha_k(x,I) = 1, when its fields are declared and the record falls within its scope. In Figure 2(a), a wide-body turbofan record, outside the scope of the propeller axiom A4P, declares no stall speed, so A6 is masked (αk=0\alpha_k = 0 for both), and an undetected landing gear masks the main-gear axiom AX3; panel (c) is the 23-field frame of the cross-dataset transfer (Appendix § 12.§ 1).

Image not extracted

Figure 2. Data and verification instances.

Corruption generator and labels. The specification benchmark splits the records by family: the business-jet families form the unseen class, six random families the unseen families, and the others fill training, validation and test at 60/20/20 (Appendix § 12.§ 1). Each clean record yields up to two instances of each of five corruption families: an impossible single value and geometric, performance and cruise inconsistencies multiply or divide one field by 1+ϵ1 + \epsilon, with ϵ=0.05\epsilon= 0.05 and 0.100.10, and a cross-class block swap (Frankenstein) copies a coherent block of fields from another class in the same split. The generator oracle, a crisp check of the same relations against class bands [0.88 min, 1.12 max] of each quantity over all 107 clean aircraft of every split, keeps an instance only when it flags the target constraint (any constraint for a swap); otherwise ϵ\epsilon doubles, for at most six attempts (Table D.1; realized instances in Figure 2(d)). The verifier is fitted on training-split instances only: the oracle’s bands reach it through their labels and per-constraint targets, which thus carry the class extremes of all 107 aircraft, and no field value of another split enters training. Two noisy-but-coherent controls per record perturb each continuous field by a Gaussian factor with relative standard deviation 0.02, with ARAR rescaled according to the induced change in b2/Sb^2/S; both controls must remain coherent. The intervention benchmark (2,582 rows, same aircraft and splits) draws the same operators once per magnitude, without escalation or oracle certification, and labels each row from the edit alone. A row is labeled incoherent when a continuous field differs from its clean source by more than three noise standard deviations or an integer field changes. These tolerances are fixed before generation, and the label applies regardless of whether a physical relation is violated. An available constraint receives a positive label when its scope includes such an altered field. Noisy copies and edits within tolerance count as unaltered. These labels evaluate the constraint verdicts, the diagnosis key, abduction and detection. The satellite and multimodal benchmarks likewise include corrupted examples and controls. In the multimodal benchmark, each image is paired with its matching record, a mismatched record, or an altered version of its matching record. Mismatches involve aircraft from another class or role, or a sister variant. Occluded and degraded photographs serve as controls.

Knowledge Base and Graded Predicates

The knowledge base K\mathcal{K} has four strata (Table 3; visual part in Table E.1): the specification axioms A\mathcal{A}, 12 relations on records; the remote-sensing axioms R\mathcal{R}, 10 relations on annotations; the grounding axioms AV\mathcal{A}\mathcal{V}, in training only; and the cross-modal axioms AX\mathcal{A}\mathcal{X}, at inference only. The tabular strata contain no neural network (Figure 3): each axiom computes an exact, differentiable quantity qq of the declared fields, with atmospheric properties from the International Standard Atmosphere (ISA)6 (Appendix C), reads it in units of the scatter of clean training records, z=(log⁡10q−mg)/σgz=(\log_{10}q-m_g)/\sigma_g for a band and z=ξ/σgz=\xi/\sigma_g for the residual ξ\xi of an identity or the mass-balance margin, and grades it with a residual-aware predicate (E2),

IDGraded predicate and quantityFields readAvailable (αk=1\alpha_k = 1) whenLearned parameters
ASpecification axioms A\mathcal{A} (records; 336 trainable scalars, 126 of them latents; wk=1w_k = 1)
A1graded identity of (AR−A^)/A^(AR - \hat{A})/\hat{A}, A^=b2/S\hat{A} = b^2/Sbb, SS, ARARall declaredtolerance (8); κ\kappa, β\beta (2)
A2graded band of CL=2MTOWg/(ρ(hcr)Vcr2S)C_L = 2MTOWg/(\rho(h_{\mathrm{cr}})V_{\mathrm{cr}}^2S)MTOWMTOW, VcrV_{\mathrm{cr}}, hcrh_{\mathrm{cr}}, SSall declaredband (16); κ\kappa, β\beta (2)
A3graded band of MTOW/SMTOW/SMTOWMTOW, SSall declaredband (16); κ\kappa, β\beta (2)
A4graded band of Ftot/(MTOWg)F_{\mathrm{tot}}/(MTOWg)FtotF_{\mathrm{tot}}, MTOWMTOWall declared; turbofanband (16); κ\kappa, β\beta (2)
A4Pgraded band of MTOW/PtotMTOW/P_{\mathrm{tot}}PtotP_{\mathrm{tot}}, MTOWMTOWall declared; propellerband (16); κ\kappa, β\beta (2)
A5graded identity of clip⁡aln⁡(R/R^)\operatorname{clip}_a \ln(R/\hat{R}), R^=VcrgcTLDln⁡MTOWW1\hat{R} = \frac{V_{\mathrm{cr}}}{gc_T}\frac{L}{D}\ln\frac{MTOW}{W_1} for a turbofan, R^=ηpgcPLDln⁡MTOWW1\hat{R} = \frac{\eta_p}{gc_P}\frac{L}{D}\ln\frac{MTOW}{W_1} for a propeller aircraft; W1=max⁡(MTOW−0.94mfuel,0.05MTOW)W_1 = \max(MTOW - 0.94m_{\mathrm{fuel}}, 0.05MTOW)RR, mfuelm_{\mathrm{fuel}}, MTOWMTOW; VcrV_{\mathrm{cr}} (turbofan)RR, VcrV_{\mathrm{cr}}, mfuelm_{\mathrm{fuel}}, MTOWMTOW and ARAR declaredtolerance (8); κ\kappa, β\beta (2); L/DL/D, cTc_T, cPc_P, ηp\eta_p per pair (84)
A6graded identity of clip⁡2ln⁡(Vs/V^s)\operatorname{clip}_2\ln(V_s/\hat{V}_s), V^s=2MTOWg/(ρ0SCLmax⁡)\hat{V}_s = \sqrt{2MTOWg/(\rho_0SCL_{\max})}VsV_s, MTOWMTOW, SSall declaredtolerance (8); κ\kappa, β\beta (2); CL,max⁡C_{L,\max} per pair (21)
A7lower hinge of the margin (MTOW−OEW−fumfuel−95npax)/MTOW(MTOW - OEW - f_u m_{\mathrm{fuel}} - 95n_{\mathrm{pax}})/MTOWOEWOEW, mfuelm_{\mathrm{fuel}}, npaxn_{\mathrm{pax}}, MTOWMTOWall declarededge offsets (7); κ\kappa (1); fuf_u per pair (21)
A8graded band of OEW/MTOWOEW/MTOWOEWOEW, MTOWMTOWall declaredband (16); κ\kappa, β\beta (2)
A9graded band of Ftot/nengF_{\mathrm{tot}}/n_{\mathrm{eng}} if FtotF_{\mathrm{tot}} is declared, else of Ptot/nengP_{\mathrm{tot}}/n_{\mathrm{eng}}nengn_{\mathrm{eng}}; FtotF_{\mathrm{tot}} or PtotP_{\mathrm{tot}}nengn_{\mathrm{eng}}, and FtotF_{\mathrm{tot}} or PtotP_{\mathrm{tot}}, declared2 bands (32); κ\kappa, β\beta (4)
A10graded band of M=Vcr/a(hcr)M = V_{\mathrm{cr}}/a(h_{\mathrm{cr}}), per engine type eeVcrV_{\mathrm{cr}}, hcrh_{\mathrm{cr}}all declaredband per ee (8); κ\kappa, β\beta (2)
A11sum of the graded bands of Lfus/bL_{\mathrm{fus}}/b and npax/Lfusn_{\mathrm{pax}}/L_{\mathrm{fus}}LfusL_{\mathrm{fus}}, bb, npaxn_{\mathrm{pax}}all declared2 bands (32); κ\kappa, β\beta (4)
RRemote-sensing axioms R\mathcal{R} (annotations; 57 trainable scalars; wk=1w_k = 1 except wR9=0.5w_{R9} = 0.5)
R1graded band of bb for the declared design group, edges fixed by regulationbb, design groupall declaredκ\kappa, β\beta (2)
R2graded band of bb per role rr; civil bands fixed by definition, military bands learnedbb, rrall declaredmilitary bands (8); κ\kappa, β\beta (4)
R3graded band of L/bL/b per rrLL, bb, rrall declaredband per rr (14); κ\kappa, β\beta (2)
R4graded band of nengn_{\mathrm{eng}} per rrnengn_{\mathrm{eng}}, rrall declaredband per rr (14); κ\kappa, β\beta (2)
R5−ln⁡-\ln of [π=unpowered]ζ+[π≠unpowered](1−ζ)[\pi= \text{unpowered}]\zeta+ [\pi\ne\text{unpowered}](1-\zeta), ζ=exp⁡(−(neng/τ)2)\zeta= \exp(-(n_{\mathrm{eng}}/\tau)^2)nengn_{\mathrm{eng}}, π\piall declaredτ\tau (1)
R6−ln⁡-\ln of prp_r, 1−pr1-p_r or 12\frac{1}{2} for a jet, propeller or unpowered π\pi; pr=σ(θr)p_r = \sigma(\theta_r)π\pi, rrall declaredθr\theta_r per rr (7)
R7−ln⁡-\ln of IR([t∈{delta,variable-swept}],[r military])I_R([t \in\{\text{delta},\text{variable-swept}\}], [r\ \text{military}])tt, rrall declarednone
R8−ln⁡-\ln of IR([canards],[r∈{bomber,fighter}])I_R([\text{canards}], [r \in\{\text{bomber},\text{fighter}\}])canards, rrall declarednone
R9−ln⁡-\ln of IR([nfin≥2],[r=fighter])I_R([n_{\mathrm{fin}} \ge2], [r = \text{fighter}])nfinn_{\mathrm{fin}}, rrall declarednone
R10graded identity of ln⁡A∘−ln⁡(bL/2)\ln A_{\circ} - \ln(bL/2)A∘A_{\circ}, bb, LLall declaredtolerance (1); κ\kappa, β\beta (2)

Table 3. Axiom catalog.

Image not extracted

Figure 3. Knowledge base and graded predicates.

ν=softplus⁡(κ(ℓg−z))+softplus⁡(κ(z−hg))+β(1+(z−cg)2−1),sat⁡=exp⁡(−ν),(3)\nu=\operatorname{softplus}\left(\kappa(\ell_g-z)\right)+\operatorname{softplus}\left(\kappa(z-h_g)\right)+\beta\left(\sqrt{1+(z-c_g)^2}-1\right),\qquad\operatorname{sat}=\exp(-\nu), \tag*{(3)}

Field symbols: Section 3.1; latents and graded predicates: Section 3.2, Eq. (3). Formulas in SI units. Graded band: two edge softplus hinges plus the in-band term; identity: same, with symmetric tolerance around zero; lower hinge: lower edge only. Degrees capped at 10410^4; logical axioms use −log⁡max⁡(t,10−6)-\log\max(t,10^{-6}), with truth tt. Specification banks: fleet value plus class offset scaled by ng/(ng+5)n_g/(n_g+5) (engine type for A10); remote-sensing banks: flat. ρ(h)\rho(h), a(h)a(h): International Standard Atmosphere density and sound speed; ρ0\rho_0: sea-level density; gg: standard gravity; pair: (class, engine type); [⋅][\cdot]: indicator; clip⁡a\operatorname{clip}_a: clipping to [−a,a][-a,a]; propeller: turboprop or piston. Initial values and bounds: Appendix C.

a violation degree vv and its truth. The mean mgm_g and scatter σg≥10−3\sigma_g \ge10^{-3} of group gg (class; engine type for A10; fleet for A1 and A2) come from its ngn_g clean training rows (132 for records: 44 clean aircraft and 88 noisy copies), shrunk toward the fleet with weight ng/(ng+5)n_g/(n_g + 5), σg\sigma_g being a root-mean-square around 0 for an identity or the margin; [ℓg,hg][\ell_g,h_g] is the band, [−tg,tg][-t_g,t_g] for an identity, with center cgc_g; each derived quantity has a slope κ\kappa and a weight β≥0\beta\ge0 of the in-band term, which grades a value inside the band by its distance from the center. The mass balance A7 keeps its lower hinge only, A9 grades thrust or power per engine as declared, A11 sums its two quantities, every degree is capped at 10410^4, and sat⁡k=exp⁡(−vk)\operatorname{sat}_k = \exp(-v_k) is never clamped. Bounded latents supply quantities that records rarely declare: cruise lift-to-drag ratio L/DL/D, thrust- and power-specific fuel consumptions cTc_T and cPc_P, propeller efficiency ηp\eta_p, maximum lift coefficient CL,max⁡C_{L,\max} and fuel utilization fuf_u, each a sigmoid of one parameter per pair of class cc and engine type ee (21 pairs), rescaled to conceptual-design ranges [71]; shared by a class and engine type, they check a record against its class.

The train prior fits every data-dependent band on the 44 clean training aircraft and widens it to [0.88 min, 1.12 max], as the oracle does. The bands start from the train prior and are learned with their slopes from the fleet and its labeled corruptions, so they act as learned tolerances: 45.7% of them keep both edges inside the training fleet range widened in the same way, and the others, all wing-loading bands among them, extend beyond it after training (Appendix § 15.9). The learned slopes act as implicit per-constraint weights. In hierarchical banks each band or tolerance parameter of a class is a fleet value plus a class offset with the same weight, so a class without training aircraft, such as the business jets, is read with fleet statistics and parameters. The remote-sensing axioms follow the same recipe: six graded slots (R1, R2 for civil and for military roles, R3, R4 and R10) read the residual in standard units of the clean training rows, and the logical axioms R5 to R9 enter as the negative logarithm of their truth. Each tabular stratum’s settings (the power pp of a masked power mean of the degrees, the in-band term, flat or hierarchical banks) are chosen on validation alone among eight candidates trained with eight seeds each; both strata select p=1p = 1, the masked mean of Eq. (9), and on generator-oracle labels the specification stratum keeps the in-band term and hierarchical banks.

Training objective. With instance labels yiy_i, y=1y = 1 for incoherence, and per-constraint targets yiky_{ik}, the generator oracle’s verdict on constraint kk for a corruption and zero otherwise, the tabular stratum T∈{A,R}\mathcal{T} \in\{\mathcal{A}, \mathcal{R}\} minimizes over a mini-batch B\mathcal{B}

Ltab=1∣B∣∑i∈BBCE⁡(e−VT(xi),1−yi)+λaux⟨BCE⁡(sat⁡k(xi),1−yik)⟩αik,⟨q⟩χ=∑jχjqjmax⁡(1,∑jχj)(4)\mathcal{L}_{\mathrm{tab}} = \frac{1}{|\mathcal{B}|} \sum_{i \in\mathcal{B}} \operatorname{BCE}\left(e^{-V_{\mathcal{T}}(x_i)}, 1-y_i\right) + \lambda_{\mathrm{aux}} \left\langle\operatorname{BCE}\left(\operatorname{sat}_k(x_i), 1-y_{ik}\right) \right\rangle_{\alpha_{ik}}, \qquad\langle q\rangle_{\chi} = \frac{\sum_j \chi_j q_j}{\max\left(1,\sum_j \chi_j\right)} \tag*{(4)}

with VTV_{\mathcal{T}} of Eq. (9), both cross-entropies computed in log space from the unclamped degrees, λaux=0.5\lambda_{\mathrm{aux}} = 0.5 and ⟨q⟩χ\langle q\rangle_{\chi} the mean of qq where χj=1\chi_j = 1. The residual learners of the comparison receive no per-constraint target. AdamW [72] trains bands, slopes and latents for at most 100 epochs, with early stopping on validation AUROC (Table F.2).

Vision Module and Grounding Axiom

For each image, the vision module predicts the attributes that the cross-modal axioms compare with the declared record. To let an analyst inspect the evidence behind these predictions, a grounding axiom encourages each head to concentrate its evidence on the part it describes, and the report displays the corresponding activation map (§ 3.4).

The module uses a backbone with one sigmoid head per class of each visual predicate: 25 heads covering eight predicates for photographs, and 25 covering seven predicates for satellite crops (Figure E.2 in Appendix § 13). On photographs a ResNet-50 [73] pretrained on ImageNet [74] is read at its third stage, a 28 × 28 grid at 448 pixels. Head kk returns Pk(I)=σ(sk(I))P_k(I) = \sigma(s_k(I)), with sks_k linear in the spatially averaged feature maps, and its class activation map (CAM) [75] normalized to unit mass,

Hk(I)=ReLU⁡(∑cwkcAc(I)),H^k(I)=Hk(I)∑u,vHk(I)[u,v]+ε,(5)H_k(I) = \operatorname{ReLU}\left(\sum_c w_{kc} A_c(I)\right), \qquad\widehat{H}_k(I) = \frac{H_k(I)}{\sum_{u,v} H_k(I)[u,v] + \varepsilon}, \tag*{(5)}

where Ac(I)A_c(I) is channel cc of the feature map, wkcw_{kc} the weight of head kk on it, [u,v][u,v] a grid cell and ε=10−6\varepsilon= 10^{-6}.

On photographs the region M~k(I)\widetilde{M}_k(I) of head kk is the union of the automatic pseudo-masks of its parts, OWLv2 [76] boxes of confidence at least 0.15 segmented by the Segment Anything Model (SAM) [77], dilated by 2 native pixels and averaged over the grid cells, none annotated or verified by hand. The head is visible, vis⁡k(I)=1\operatorname{vis}_k(I) = 1, when a part is detected with a confidence of at least 0.20 (Appendix § 13). On satellite crops every region is the annotated diamond. The in-mask share ρk\rho_k and the localization predicate Loc⁡k\operatorname{Loc}_k,

ρk(I)=∑u,vH^k(I)[u,v]M~k(I)[u,v]∑u,vH^k(I)[u,v]+ε,Loc⁡k(I)=σ(κk(ρk(I)−ℓk)),ℓk=σ(ℓ~k),κk=exp⁡(κ~k),(6)\rho_k(I) = \frac{\sum_{u,v} \widehat{H}_k(I)[u,v]\widetilde{M}_k(I)[u,v]}{\sum_{u,v} \widehat{H}_k(I)[u,v] + \varepsilon}, \qquad\operatorname{Loc}_k(I) = \sigma\left(\kappa_k(\rho_k(I)-\ell_k)\right), \qquad\ell_k = \sigma(\widetilde{\ell}_k), \qquad\kappa_k = \exp(\widetilde{\kappa}_k), \tag*{(6)}

read “at least a fraction ℓk\ell_k of the attribution lies in the region”, with a learned threshold ℓk\ell_k and slope κk\kappa_k per head. The grounding axiom of head kk (E3) is the guarded Reichenbach implication

AVk: ∀I [vis⁡k(I)]:Pk(I)→Loc⁡k(I),sat⁡AVk(I)=IR(Pk(I),Loc⁡k(I))=1−Pk(1−Loc⁡k).(7)\mathcal{A}\mathcal{V}_k : \ \forall I \ [\operatorname{vis}_k(I)] : P_k(I) \to\operatorname{Loc}_k(I), \qquad\operatorname{sat}_{\mathcal{A}\mathcal{V}_k}(I) = I_{\mathbb{R}}\left(P_k(I),\operatorname{Loc}_k(I)\right) = 1-P_k(1-\operatorname{Loc}_k). \tag*{(7)}

Its gate PkP_k asks a head that asserts its class to localize its evidence, with no label, and its guard masks a conjunct whose part is not visible.

Training objective. With per-head labels tikt_{ik}, the one-hot attribute labels, and their availability ωik\omega_{ik}, the vision module minimizes

Lvis=⟨BCE⁡(Pk(Ii),tik)⟩ωik+λAV(1−⟨sat⁡AVk(Ii)⟩vis⁡k(Ii))+λflΦ,\mathcal{L}_{\mathrm{vis}} = \left\langle\operatorname{BCE}(P_k(I_i),t_{ik})\right\rangle_{\omega_{ik}} + \lambda_{\mathrm{AV}}\left(1-\left\langle\operatorname{sat}_{\mathcal{A}\mathcal{V}_k}(I_i)\right\rangle_{\operatorname{vis}_k(I_i)}\right) + \lambda_{\mathrm{fl}}\Phi,
Φ=⟨sg⁡[Pk(Ii)]max⁡(0,1−Sk(Ii)/S0)⟩,(8)\Phi= \left\langle\operatorname{sg}\left[P_k(I_i)\right]\max\left(0,1-S_k(I_i)/S_0\right)\right\rangle, \tag*{(8)}

with λAV=1\lambda_{\mathrm{AV}} = 1 and λfl=0.1\lambda_{\mathrm{fl}} = 0.1. The floor Φ\Phi (SkS_k the total activation of HkH_k, S0=1S_0 = 1, sg a stop-gradient) stops a head from asserting its class through its bias with a negligible map; the cross-modal axioms read the frozen posteriors (Table F.2). Explanation supervision [57, 59, 61] suggests instead an auxiliary loss, the Energy loss [60], here the mean of 1−ρk1-\rho_k over the visible label-positive heads, with about 4.3 times the axiom’s localization weight per conjunct at the same loss weight (§ 4.6).

We train and compare multiple visual backbones. Satellite experiments use ResNet-50, ConvNeXt-T and ViT-B/16, while photographic grounding is also evaluated across multiple backbones (Table F.2; Appendix § 15.6).

Cross-Modal Axioms

The cross-modal axioms (Table E.1; center of Figure 2) compare declared attributes with the visual posteriors pvis(⋅∣I)p_{\mathrm{vis}}(\cdot\mid I) predicted from the image. For each predicate, the posterior is obtained by a softmax over its heads, or a sigmoid for a binary predicate. Axiom truths are computed from these posteriors, expected truths of implications, or products of such terms, without additional trainable parameters. An axiom is available when its declared value is covered by the corresponding visual head and the relevant parts are visible.

The report displays each grounded head’s activation map and in-mask share ρk\rho_k alongside the cross-modal verdicts (Figure E.1), allowing an analyst to inspect which image regions support a reported contradiction.

Masked Stratified Aggregation

A tabular stratum T∈{A,R}\mathcal{T} \in\{\mathcal{A},\mathcal{R}\} averages the degrees of its available axioms (E1), and the cross-modal stratum aggregates their truths by the masked pp-mean error,

VT(x)=∑k∈Twkαkvk∑k∈Twkαk,feas⁡AX(x,I)=1−(∑k∈AXwkαk(1−sat⁡k)4∑k∈AXwkαk)1/4,(9)V_{\mathcal{T}}(x)=\frac{\sum_{k\in\mathcal{T}}w_k\alpha_kv_k}{\sum_{k\in\mathcal{T}}w_k\alpha_k},\qquad \operatorname{feas}_{\mathcal{AX}}(x,I)=1-\left(\frac{\sum_{k\in\mathcal{AX}}w_k\alpha_k(1-\operatorname{sat}_k)^4}{\sum_{k\in\mathcal{AX}}w_k\alpha_k}\right)^{1/4}, \tag*{(9)}

each where its denominator is positive, with wk=1w_k=1 except 0.5 for R9 and the satellite AX5. The feasibility feas⁡T=exp⁡(−VT)\operatorname{feas}_{\mathcal{T}}=\exp(-V_{\mathcal{T}}) is the weighted geometric mean of the available truths, and VT=ln⁡2V_{\mathcal{T}}=\ln2 (feasibility 0.5) without available axioms; with unit weights feas⁡AX\operatorname{feas}_{\mathcal{AX}} is the masked aggregator of LT-Ntorch, and without available axioms the cross-modal stratum drops out. The strata present combine by a weighted mean (E4),

feas⁡(x,I)=λTfeas⁡T(x)+λAXγAX(x,I)feas⁡AX(x,I)λT+λAXγAX(x,I),γAX=[∑k∈AXwkαk>0],(10)\operatorname{feas}(x,I)=\frac{\lambda_{\mathcal{T}}\operatorname{feas}_{\mathcal{T}}(x)+\lambda_{\mathcal{AX}}\gamma_{\mathcal{AX}}(x,I)\operatorname{feas}_{\mathcal{AX}}(x,I)}{\lambda_{\mathcal{T}}+\lambda_{\mathcal{AX}}\gamma_{\mathcal{AX}}(x,I)},\qquad \gamma_{\mathcal{AX}}=\left[\sum_{k\in\mathcal{AX}}w_k\alpha_k>0\right], \tag*{(10)}

with λT=λAX=1\lambda_{\mathcal{T}}=\lambda_{\mathcal{AX}}=1; when γAX=0\gamma_{\mathcal{AX}}=0 the implementation returns feas⁡T\operatorname{feas}_{\mathcal{T}} itself. Photographic pairs are scored by the cross-modal stratum alone, which reads no specification truth.

Proposition 1 (Exact reduction) Let the verdict be computed with Eqs. (9) and (10). (a) For every stratum SS, instance (x,I)(x,I) and fixed availability pattern α\alpha (which, for cross-modal axioms, depends on the declared value and on visibility), let S′={k∈S:αk(x,I)=1}S'=\{k\in S:\alpha_k(x,I)=1\}. If S′S' is nonempty, the stratum verdict, VSV_S or feas⁡AX\operatorname{feas}_{\mathcal{AX}}, coincides with Eq. (9) on S′S' with every axiom available; otherwise a tabular stratum takes VS=ln⁡2V_S=\ln2 and the cross-modal stratum is absent (γAX=0\gamma_{\mathcal{AX}}=0). Either way it depends neither on the degree or truth of a masked axiom nor on a field read only by masked axioms, and has zero derivative with respect to them. (b) With a tabular stratum (λT>0\lambda_{\mathcal{T}}>0), if I=∅I=\varnothing, or every cross-modal axiom is masked, then feas⁡(x,I)=exp⁡(−VT(x))\operatorname{feas}(x,I)=\exp(-V_{\mathcal{T}}(x)) exactly; otherwise feas⁡(x,I)\operatorname{feas}(x,I) is the verdict of the knowledge base restricted to the strata present (including the tabular stratum at feasibility 1/21/2 when none of its axioms is available), with their weights renormalized.

The proof is in Appendix § 13.§ 1. The reduction holds because only available axioms enter the mean, a structural property of E1 that also holds in training, where a masked axiom receives zero gradient; its practical value is an exact abstention, which crisp rule validation shares (Table 2) and learned heads do not keep (§ 4.5); stratification (E4) keeps one verdict per evidence source (§ 4.8).

Verdict and Diagnosis Keys

NeSySpec’s verdict is V=−ln⁡feas⁡(x,I)V=-\ln\operatorname{feas}(x,I), the masked mean degree VTV_{\mathcal{T}} for a record without image. Bands and slopes are learned for each derived quantity, with no additional weights learned for aggregation. The resulting verdict serves as the record score. NeSySpec converts this score into a binary decision using the threshold t⋆t^\star that maximizes Youden’s index on the validation set [78]. A specification record with no available constraint scores V=ln⁡2V=\ln2, above the validation thresholds of the specification verifier (0.310 to 0.558 across seeds), so it is flagged for lack of evidence, with an evidence coverage of 0 in its report (§ 3.7). For a flagged specification record with at least one available constraint, constraint diagnosis identifies the constraint with the largest violation degree. This gives the largest-violation key: the argmax of the degrees entering the verdict, with no additional parameter to fit. We also retain a secondary key, identifying the constraint that contributes most to the second head’s score. The second head (E5) is a logistic regression with non-negative weights on the degrees ek=αkvke_k=\alpha_kv_k of the available axioms,

p^m(x,I)=σ(ϕ0+∑k(ϕkek+ϕkaαk)+ϕsV),ϕk, ϕs≥0,(11)\hat{p}_{\mathrm{m}}(x,I)=\sigma\left(\phi_0+\sum_k\left(\phi_k e_k+\phi_k^a\alpha_k\right)+\phi_sV\right),\qquad\phi_k,\ \phi_s\geq0, \tag*{(11)}

with availability terms ϕka\phi_k^a free in sign, fitted by L2L_2-regularized maximum likelihood with a bound-constrained quasi-Newton method [79] and selected on validation AUROC; on satellite pairs it reads VRV_{\mathcal{R}} in place of VV and also the cross-modal truths, with non-positive weights, and the cross-modal score 1−feas⁡X1 - \operatorname{feas}_{\mathcal{X}} (0 without an image), with a non-negative weight. The contribution ck=logit⁡p^m(x,I)−logit⁡p^m(x,I∣vk:=0)c_k = \operatorname{logit}\hat{p}_m(x,I) - \operatorname{logit}\hat{p}_m(x,I \mid v_k:=0), with VV (or VRV_R) recomputed, gives the secondary key, a learned second ranking of the same degrees that the report prints beside the largest-violation key (§ 4.2, Figure 6b).

Verification Report and Optional Checks

Every instance receives a verification report (Figure E.1 in Appendix § 13; example in Figure 5) whose per-constraint degrees state, by one rule, which constraints the record violates and which it respects: an available constraint is violated when its truth exp⁡(−vk)\exp(-v_k) is below 0.5, that is vk>ln⁡2v_k > \ln2, reached at the learned band edge, where a hinge of Eq. (3) alone equals ln⁡2\ln2, or inside the band where the learned in-band term adds to it (A1, A2); it is held otherwise, and a masked constraint is not evaluated. The rule has no tuned parameter: it reads at 0.5 the truths that the per-constraint term of Eq. (4) trains toward 1 on constraints the generator leaves held and toward 0 on those it violates. Its evidence coverage counts the available constraints among those whose scope contains the record, so a masked axiom is an abstention, and the report gives the class of the nearest clean training record and its fleet similarity exp⁡(−d/τ)\exp(-d/\tau), with dd the root-mean-square difference from it over the fields both records declare, in log-scaled standardized coordinates, and τ\tau the median leave-one-out nearest-neighbor dd in the clean training fleet, so that a value below e−1e^{-1} marks a record farther from the fleet than a typical clean training record.

For a flagged specification record, field localization names the altered field by abduction, a search over single-field changes for the one that restores consistency; a field whose change alone restores it is a single-fault diagnosis in the sense of consistency-based diagnosis [14]. For every field ff read by an available constraint, the verifier evaluates the verdict when ff alone moves by dd in log space,

ψf(d)=VA(x(f,d)),xf(f,d)=xfexp⁡(d),xj(f,d)=xj (j≠f),d∈{−3,−2.995,…,3},(12)\psi_f(d) = V_{\mathcal{A}}\left(x^{(f,d)}\right), \qquad x_f^{(f,d)} = x_f \exp(d), \qquad x_j^{(f,d)} = x_j\ (j \ne f), \qquad d \in\{-3,-2.995,\ldots,3\}, \tag*{(12)}

and ranks first the fields whose change alone can bring the verdict to V≤−ln⁡0.9≈0.1054V \le-\ln0.9 \approx0.1054, by the smallest such change, then the others by the lowest verdict they reach, a rule and a threshold selected on validation and independent of the diagnosis. Repair proposals then solve

d⋆=arg⁡min⁡d ∥d∥22s.t.feas⁡A(x⊙exp⁡(d))≥τr,dj=0 for j∉Fkr(x),(13)d^\star= \underset{d}{\arg\min}\ \lVert d\rVert_2^2 \quad\text{s.t.}\quad\operatorname{feas}_{\mathcal{A}}\left(x \mathbin{\odot} \exp(d)\right) \ge\tau_r,\qquad d_j = 0\ \text{for } j \notin F_{k_r}(x), \tag*{(13)}

the smallest log-space change of the krk_r top-ranked fields Fkr(x)F_{k_r}(x) that brings the verdict to the threshold, a counterfactual over the declared fields [80], by an augmented-Lagrangian method [81] with Adam [82] steps, keeping its best-effort change when the threshold is not reached; validation chose τr=0.9\tau_r = 0.9 (V≤−ln⁡0.9V \le-\ln0.9), a target stricter than the decision threshold, and kr=1k_r = 1 for the repair error (§ 4.3).

NeSySpec’s audit has three optional settings. With rank-then-explain, the residual MLP, an MLP on the 14 physical quantities of the oracle (Table F.1), raises the alarm at its validation Youden threshold and the largest-violation key explains each flagged record; the flagged-and-diagnosed rate, the share of corrupted records flagged with a violated top-ranked constraint, scores this setting. The critical-field alert flags a record that leaves undeclared a field required by an applicable axiom and declared by at least 95% of the training records of its class - or of its engine type for classes with fewer than five training records -, reading only the undeclared fields, the class, the engine type and a table of the training records; with it enabled, NeSySpec flags a record when its verdict or the alert fires. With MICE imputation of the missing fields enabled, NeSySpec scores imputed values in place of abstaining on them; § 4.5 compares this setting with learners given the same imputer.

Evaluation and Results

Experimental Setup

The vision module and the tabular verifier are fitted separately, as described in § 3 (Table F.2, Appendix § 14); where a result uses one of NeSySpec’s optional settings, rank-then-explain, the critical-field alert or MICE imputation, the text names it. The configuration was selected on validation data and held-out training classes. The reported results use a visibility threshold calibrated on a subset. including test and out-of-distribution images, and generator labels from an oracle fitted on all 107 aircraft (Appendix § 14). Sensitivity analyses at the end of this section repeat threshold selection and oracle fitting without test or out-of-distribution data.

Benchmarks and labels. Table 4 maps each benchmark to its labels and to the sections that use it; every error in this study is synthetic, an edit or a constructed mismatch of public records and images. Two label families recur. Generator labels come from the generator oracle of § 3.1, which judges the same residual quantities as the knowledge base against class bands fitted on all 107 aircraft; its single-field corruptions are escalated from 5 or 10% until the oracle flags them, mostly to 20 to 160% (geometric ones stay at 5 or 10%; Table D.1). Intervention labels cover single-field edits drawn once at 5 to 80% and cross-class block swaps: a field counts as altered beyond three noise standard deviations (0.06 in natural-log units for continuous fields, 0.134 for the aspect ratio, any change of an integer field), so edits within this tolerance, e.g., the 5% edits of continuous fields, count as unaltered, and a constraint is labeled when its scope contains an altered field. Such a constraint is involved in the edit, which need not violate it: an edit can keep the record inside the physical envelope of the fleet, and 613 of the 1,810 altered rows, about a third, break no constraint even under bands fitted on all 107 aircraft, so that no physical check can flag them (Appendix § 15.§ 4). Generator labels follow the same relations as the axioms and were NeSySpec’s per-constraint training targets; intervention labels, set from the edit alone, are independent of them. Minimum-cardinality localization (Fellegi-Holt and MaxSMT [28], all optimal solutions) breaks ties at random unless the oracle tie-break is named.

Statistics. Intervals are 95% two-level cluster-bootstrap percentile intervals [87], reported as [aircraft] · [family] for records. The ±\pm notation denotes standard deviation across seeds. Residual MLP and NeSySpec runs are paired by seed. A method is higher or lower than another, ahead or below, when both intervals of their difference exclude zero, and on par with it when both include zero; when only one excludes zero, when a bound prints 0.000 or lies within 0.003 of zero, or when the reading changes in one of 20 alternative bootstrap streams, the text gives the levels in plain words (close, comparable, slightly). The text gives levels, Tables G.1 to G.4 and Appendix § 15.§ 1 the differences and intervals, and Appendix § 15 the spread over seeds and the readings across the alternative streams; no multiplicity correction is applied.

Comparators, metrics and cost. Learners on the raw fields or on the residuals, the 14 physical quantities that the oracle checks, score records (the residual MLP, TabPFN v2 [10], LightGBM [88], a one-class support vector machine, SVM); class standardization and the grouped Shapley additive explanations (SHAP) [12] of a second model (MLP-SHAP, LightGBM-SHAP) rank the residuals; Fellegi-Holt, Z3 and rule checkers return crisp violated sets, a network trained with the DL2 loss [20] on the same residuals a probability per constraint, and language and vision-language models given the rules a judgment (Table F.1). We call VV the record verdict and the held or violated outputs per constraint the constraint verdicts. The constraint verdicts use exact-set agreement per record, macro-F1 over the constraints with at least five labeled violations and the false-violation rate on clean records. Diagnosis and localization use top-1 rates, repair the log-space error and grounding the pointing game [89]; detection scores the record verdict by AUROC and the false-positive rate (FPR) on the 32 controls at a true-positive rate (TPR) of 0.90. Experiments ran on an AMD Ryzen 9 9950X3D with 192 GB of RAM, an NVIDIA RTX 5090 and an RTX 4090. Per record, the verdict and the key take one pass through the knowledge base, abduction evaluates the verdict at 1,201 log-space steps for each field read by an available constraint, and the repair solves one augmented-Lagrangian problem; training curves are in Appendix § 15.10.

Figure 4 shows, for each test record, the violation 1−sat⁡k=1−exp⁡(−vk)1-\operatorname{sat}_k = 1-\exp(-v_k) of each constraint (mean of 8 seeds) with the rule of § 3.7 drawn as a step at 0.5: dark cells are violated constraints, gray cells masked ones, framed cells the oracle’s flags.

Image not extracted

Figure 4. Constraint-level verdicts on test records.

The audit at a glance. Table 5 lines up NeSySpec with its comparators on every output of the audit. Learners on the physical residuals return a record score and need a second model, a head per constraint or attributions, for a verdict or a diagnosis; solvers return a violated set, an edit or a repair; language and vision-language models return a judgment. NeSySpec is the only method that returns every output, and without an image its fused verdict alone returns the record verdict exactly. On the test aircraft no comparator is ahead of it in the macro-F1 of the constraint verdicts, in naming the violated constraint and the altered field or in the repair error on the altered field; the network trained with the DL2 loss keeps fewer false violations (§ 4.2). In record and pair detection, learners on the residuals and late fusions are close to NeSySpec and in some settings rank records or pairs higher (§ 4.4 to § 4.5). Learners on the residuals do so on the unseen class, after retraining on intervention labels (Table G.3) and with 10% of the fields hidden, the MLP trained with masks on test and the residual MLP on unseen families; late fusions do so on satellite pairs after learning from labeled pairs, as does Qwen3-VL-32B on photographs of unseen families. With the axiom’s 8 seeds, the auxiliary loss points higher on test pseudo-masks (§ 4.6, Appendix § 14).

Robustness to the label oracle and the visibility threshold. Two further oracles exclude test and out-of-distribution aircraft: the first is fitted on the 44 training aircraft with the paper’s tolerances, the second on the 61 training and validation aircraft with tolerances chosen by leaving one family out. On intervention labels, under both oracles, NeSySpec keeps its leads over Fellegi-Holt and Z3 in diagnosis and over minimum-cardinality localization with random tie-break on every split. It keeps its macro-F1 lead over the DL2-loss network on unseen families under both oracles, on test under the first and slightly under the second, and on the unseen class under the first only. Its narrower leads over the oracle tie-break, the crisp edits and the Class I residual become on par or lower on some splits. Its own levels on test are lower (macro-F1 0.488 and 0.537, abduction 0.532 and 0.491, key 0.732 and, slightly, 0.738, against 0.575, 0.593 and 0.786), and its false violations rise only under the paper’s tolerances, whose bands flag 38 of the 63 clean held-out aircraft and narrow the bands it learns (Appendix G.9). Re-selected on validation alone, the part detector’s visibility threshold becomes 0.25. Retrained at 0.25, the photograph module keeps its comparisons against the networks without a localization term or with permuted masks and against RRR, GradMask and Pukdee et al. on PASCAL-Part, all kept at 0.20, against the auxiliary loss also retrained at 0.25 and against the vision-language models. Its pointing is slightly lower on test pseudo-masks (0.774 against 0.780) and on PASCAL-Part human masks (0.711 against 0.737), where the auxiliary loss falls as well (0.708 against 0.739), and its cross-modal AUROC is slightly lower on unseen families and the unseen class (Appendix F).

Constraint Verdicts and Diagnosis

For every available constraint of a record, NeSySpec returns a graded degree and, by the fixed rule of Section 3.7, a held or violated constraint verdict (Figures 4 and 5); these verdicts reach a macro-F1 of 0.795 on generator-label test and, without retraining, 0.575 on intervention-label test. Against a network trained with the DL2 loss on the same residuals and per-constraint targets, which returns a probability per constraint, they reach a higher macro-F1 on every split and both label families (the network at 0.661 and 0.426 on the two tests; Figure 6a), and the same key read from the network ranks the violated constraint first less often on every generator-label split (0.752 against 0.942). They also find every labeled violation of a corrupted record more often than the network on every split and both label families (0.934 against 0.522 on generator-label test; micro recall 0.959 against 0.635), with micro precision on par on test and lower on the unseen class (0.458 against 0.577 on generator and 0.517 against 0.639 on intervention labels; Appendix § 15.§ 1). With the network’s thresholds tuned on validation the macro-F1 lead holds on generator-label test and is slight on intervention-label test (0.575 against 0.541; Table G.5). The network reports fewer false violations on clean records (0.020 against 0.074 on generator-label test, also on intervention labels), and NeSySpec also returns the altered field and a repair proposal from the same degrees.

Crisp consistency edits on validation-selected bands (Fellegi-Holt and Z3) are on par with the constraint verdicts in macro-F1 on generator labels, and on intervention labels the constraint verdicts lead them on unseen families (0.694 against 0.569; Appendix § 15.§ 1); the graded degree ranks the violations, and the largest-violation key names the violated constraint first more often than their complete violated set (below). With thresholds from the specification benchmark’s validation, the constraint verdicts are ahead of the class-standardized residual, MLP-SHAP and LightGBM-SHAP in macro-F1 on test with both label families; with the residual’s thresholds chosen on the intervention benchmark’s validation, the residual is on par with them in macro-F1 on intervention-label test (0.560 against 0.575) and below them in exact-set agreement, with more false violations (0.174 against 0.084). The DL2 method on the declared fields and a language model given the constraints in words are below the constraint verdicts in macro-F1 on every split and label family (the language model on the specification benchmark only).

On clean and control test records the constraint verdicts report a violation in 0.074 of the checks (Figure 4), mostly on A2 and A5 (0.255 and 0.208 of their checks), where A2 evaluates the cruise lift coefficient at maximum take-off mass and A5 uses class-level latents; the report shows which relation the declared values strain and by how far (Figure 5c), and the key and abduction rank the degrees without this rule.

The largest degree, the largest-violation key, names the violated constraint in 0.942 of corrupted test records (generator labels; on each of 8 seeds), above Fellegi-Holt, Z3 and rule diagnosis (0.795 to 0.857; Figure 6b); 49 to 85% of these margins come from the 16 test records that the crisp edits leave unflagged (key 0.812, chance 0.106), and on the 140 they flag it is on par with them. On the 81 test records with a single violated constraint the key reaches 0.963, above the class-standardized residual, a z-score of the same residuals, and MLP-SHAP, which are on par with it over all corrupted test records; it comes with a held or violated verdict against learned tolerances, the altered field with its repair and exact abstention under missing evidence, all read from NeSySpec’s own degrees, and the residual’s field ranking is below abduction (§ 4.3). On unseen families the key reaches 0.973 on each of 8 seeds, above Fellegi-Holt, Z3, MLP-SHAP and LightGBM-SHAP and on par with the class-standardized residual, with the rules at 0.863 (cells without an alternative-stream check; Appendix § 15.§ 2), and on the unseen class 0.897 ± 0.007, above Fellegi-Holt, Z3, the rules and the class-standardized residual and on par with LightGBM-SHAP, with MLP-SHAP, a second model on the residuals, at 0.970 (Table G.6). On intervention labels without retraining, the key ranks first a constraint whose scope contains the altered field in 0.786 ± 0.006 of corrupted test records (chance 0.232), above Fellegi-Holt, Z3 and rule diagnosis, with most of these margins from the 76 records that the crisp edits leave unflagged, and on par with LightGBM-SHAP, the strongest attribution on these labels; on unseen families NeSySpec’s second head, its secondary key, reaches 0.848 (largest-violation key 0.828; Appendix § 15.§ 2). With the optional rank-then-explain setting, NeSySpec flags and correctly diagnoses 0.901 ± 0.013 of corrupted test records and 0.849 ± 0.043 on the unseen class (5 seed pairs), above Fellegi-Holt and Z3 behind the same alarm on test and on par with MLP-SHAP, with the violated constraint, the altered field and a repair from its own degrees; with its own alarm, the record verdict and the key reach 0.929 on test (Appendix § 15.§ 2).

Figure 5 shows the report of the first single-field corruption of the test split whose altered field an available constraint reads, chosen by a fixed rule. Its total thrust is altered: the report names A4, the thrust-to-weight ratio below the band learned from the fleet, as the largest violation, abduction finds the thrust, and changing the thrust alone brings V below the decision threshold (0.181 against 0.310). A9, flagged by the oracle’s crisp band, is held, its thrust per engine inside the wider learned band; A5, which does not read the thrust, is violated as on the clean record (asterisk in panel b), so the repair, short of its stricter target, is a best-effort value to cross-check.

Field Localization and Repair

Abduction names the altered field more often than minimum-cardinality localization on every split, on generated and on independently labeled errors, and needs no oracle to break ties (Figure 6c). On single-field test corruptions (generator labels) it finds the altered field in 0.742±\pm0.011, above minimum-cardinality localization (0.367) and the Ochiai ranking of the class-standardized residuals; with the oracle tie-break, the setting most favorable to it, minimum-cardinality localization reaches 0.629, on par with abduction. On single-field records that no oracle selected or certified, abduction through the verifier fitted on generator labels, without retraining, finds the field moved beyond tolerance in 0.593 of test records, above minimum-cardinality localization (0.306) and its oracle tie-break (0.453); 78% of the margin over the oracle tie-break comes from the 70 records that the crisp edits leave unflagged, and on the 175 of 245 that they flag abduction stays above random tie-breaking and on par with the oracle tie-break. With the selected abduction rule (Appendix § 15.9), abduction is also ahead of the Class I sizing-regression residual, the field farthest from the conceptual-design (Class I) weight regressions on maximum take-off mass fitted on the training aircraft [71], on test (0.597), on the unseen class (0.119) and on intervention labels (0.453, the level of the oracle tie-break as well), and on par with it on unseen families (0.693), with the violated constraint and a repair from the same verdict.

The repair proposal of Eq. (13) comes from NeSySpec’s own abduction and verdict, with the field and the violated constraint in the same report. It cuts the log-space error on the altered field from 0.366 to 0.133 and on the whole record to 0.200, and is closer on the record than the Fellegi-Holt, MaxSMT, nearest-neighbor and regression repairs and on the altered field than a constraint-layer repair ordering in the style of PiShield [47]; at the field of the Class I residual, MICE [83] (0.120 and 0.161) and missForest are on par with it on both errors, as is the regression on the altered field (Table G.6). The solver reaches its target, a verdict V≤−ln⁡0.9≈0.1054V \le-\ln0.9 \approx0.1054 stricter than the decision threshold, on 0.555 of the single-field test records and otherwise returns its best-effort value (Figure 5c); the report issues a proposal for each flagged record, as a value to cross-check.

Record Coherence

On generator labels, with 16 test aircraft of 9 families held out of training, the record verdict tells coherent from incoherent records at a test AUROC of 0.979 ±\pm 0.002, above learners on the raw fields (0.748 to 0.792), and each of its flags arrives with the violated constraint, the altered field and a repair proposal, read from the degrees of Figure 4. In distribution TabPFN v2 is on par with it and the other learners on the residuals are close to it, the residual MLP at 0.990 ±\pm 0.003 and TabPFN v2, LightGBM and the one-class SVM at 0.957 to 0.958 (Appendix § 15.§ 4). At a TPR of 0.90 the record verdict’s false alarms on the 32 controls (0.086) are fewer than those of the Mahalanobis distance (0.656), each naming the constraint that raised it (Table G.3).

On the unseen class of business jets, the key and abduction lead classical diagnosis and minimum-cardinality localization (§ 4.2 and § 4.3). In detection there the record verdict reaches 0.934 and five learners on the residuals rank higher (residual MLP 0.978, TabPFN v2 up to 0.984), and NeSySpec’s optional rank-then-explain setting lets the residual MLP raise the alarm and NeSySpec explain it, with false alarms on 0.205 of the 38 controls and 0.168 of the 19 pristine records at validation thresholds. On intervention labels, whose altered single fields move beyond the tolerance, by up to 80%, the key and abduction lead the classical comparators without retraining (§ 4.2 and § 4.3); in detection there, the residual MLP retrained on these labels and TabPFN v2, whose statistics include the scored rows, rank test records higher (Table G.3).

Records with images. With a paired image, NeSySpec also checks the record against the image and names the cross-modal axiom that the image contradicts (§ 3.4). On satellite pairs, the multimodal verifier of Eq. (10) achieves an AUROC of 0.994±0.0020.994 \pm0.002 over all pair types with a ConvNeXt-T backbone [90] (8 seeds). Qwen3-VL-8B [53], prompted with rules R1-R10, reaches 0.748; the verifier’s advantage holds across all evaluated backbones.

With ResNet-50 used for both, the verifier also outperforms end-to-end fusions trained on labeled pairs on test and unseen sites. Some learned fusions achieve higher AUROC on image swaps and unseen-site pairs. Without an image, the verifier returns the record verdict bit for bit. Appendix § 15.§ 5 details the comparison protocols and their asymmetries. On photographs the cross-modal stratum is on par with Qwen3-VL-8B and Qwen3-VL-32B prompted with the same axioms on test (0.692 against 0.668 and 0.712) and prints the part map of its evidence beside the contradicted cross-modal axiom; on the families held out of NeSySpec’s training, most of which the 32-billion-parameter model names from the photograph alone, that model reaches 0.827 and the stratum 0.733. This advantage may partly reflect the visual and semantic priors acquired through extensive multimodal pretraining [53]. These families are held out from our task-specific training; pretraining exposure is not controlled across the compared systems. Further comparisons should distinguish prior recognition from reasoning over the supplied physical constraints.

Missing Evidence and Absent Images

By Proposition 1, masked quantification makes every verdict a function of the available evidence only, and every run keeps this property (Figure 7a): every masked record scores bit for bit as its sub-knowledge-base, random values written into withheld fields change nothing, and masked records without evidence score exactly V=ln⁡2V = \ln2; without an image, NeSySpec’s fused verdict returns the tabular verdict bit for bit in 9 of 9 satellite cells, against 0 of 207 learned method × cell rows.

Image not extracted

Figure 7. Verdicts under missing evidence.

With fields hidden completely at random (MCAR) [91], a residual with a hidden input is missing for the learners; with half the fields hidden on the unseen class, where 26.4% of the records keep no available constraint, NeSySpec reaches 0.577, above the residual MLP (0.536) and TabPFN v2 with native missing values (0.539) and on par with LightGBM trained with masks (0.566; Figure 7b), while MICE imputation at scoring yields a slightly higher AUROC (+0.033). The masked verdict reads no filled value, and its report states which constraints remain checkable. With 10% of the fields hidden in distribution it reaches 0.848 on test and 0.824 on unseen families, where the MLP trained with masks (0.891 on test), the residual MLP (0.916 on unseen families) and, with 10 to 30% hidden on unseen families, MICE imputation of every missing field at scoring rank higher; with no field hidden, the masked verdict is ahead of MICE at scoring (Appendix § 15.§ 3).

With MICE imputation enabled, NeSySpec keeps its constraint verdicts and largest-violation key and ranks records at 0.914 with 10% of the fields hidden on test, on par with the MLP trained with masks given the same imputer (0.905); at its threshold it flags 0.210 of the clean-labeled records, against 0.137 for the masked verdict, NeSySpec’s default.

With 30% of satellite images hidden, the fused verdict keeps the exact reduction that no learned head keeps and ranks test pairs at 0.947, and heads trained with modality dropout [92], such as CatBoost on knowledge-base truths (0.978), rank them higher; across sensors without labels the record verdict is the fallback (Appendix § 15.§ 5).

Grounding of the Visual Axioms

When a head asserts an attribute, the grounding axiom encourages it to place its evidence on the corresponding part. The Reichenbach gate scales this soft penalty with the strength of the head’s assertion, without using attribute labels. The report then displays the evidence map for inspection.

We compare methods using per-example penalties, keeping the batch’s normalization constants fixed and stopping gradients through those statistics. Loss weights are selected on validation using one seed per candidate value (Appendix § 16). Under this common protocol, the network trained with the grounding axiom localizes the annotated parts substantially better than RRR [57] and GradMask [58]. Every cluster-bootstrap interval of its difference from these two and from Pukdee et al. [61], run both with the calibration of the protocol, which flattened their teacher toward the uniform prediction, and with a recalibrated arm, lies above zero on the FGVC pseudo-masks and on the human part masks of PASCAL-Part, PartImageNet [85] and UDA-Part [86] (Appendix § 16). On test pseudo-masks it points to the part in 0.780±\pm0.017 of maps (8 seeds), against 0.360±\pm0.066 with permuted masks and 0.103±\pm0.017 without a localization term (3 runs each), so localization depends on anatomically correct masks, and it points to the annotated part in 0.737 ±\pm 0.015 (3 runs at weight 1) of PASCAL-Part human masks outside the FGVC domain (Figure G.1 in Appendix § 15.6).

Across loss weights 0.3, 1 and 3, the grounding axiom keeps at most one collapsed head, compared with up to 5.7 on average for the auxiliary localization loss. Its pointing accuracy rises from 0.512 at weight 0.3 to 0.790 at 1 and 0.803 at 3, with three runs per weight. Localization also holds across all evaluated backbones with per-head maps (Appendix § 15.6). At the validation-selected weights (1 for the axiom and 0.3 for the auxiliary loss), the axiom has a small accuracy advantage out of distribution (Appendix § 16). Localization is on par on test, out of distribution and on PASCAL-Part when comparing three runs per method. Including all eight axiom runs gives the auxiliary loss a higher pointing accuracy on test pseudo-masks (Appendix § 14).

Figure 8 shows maps of NeSySpec’s visual module with the grounding axiom and without a localization term: on ground photographs (a) each map prints its in-mask share ρ\rho of Eq. (6); on satellite crops (b), outlined by the annotated diamond on which the axiom trains, the maps show where the heads look. Each row names the cross-modal axiom its head feeds, and the report prints the map beside that axiom’s verdict (part maps in Figure 1; layout in Figure E.1), so the analyst sees on which part the evidence of a contradicted axiom lies.

Image not extracted

Figure 8. Evidence heatmaps.

Robustness to Deliberate Falsification

Under a black-box falsification protocol of bare lies, cover-ups that edit up to five further fields, and omissions (Table 4 and Appendix § 15.7), a lie flagged by the record verdict is covered less often than one flagged by the residual MLP: with up to five further edits 0.936 of cover-ups pass against 1.000, and 0.247 of its flagged bare lies cannot be covered, against 0.000 for the MLP; a minimal cover of its flagged bare lies takes 2.69 further edited fields on average, against 1.38, 1.37 and 1.63 for the MLP, LightGBM and TabPFN v2 on the residuals (point estimates, censored at six; Appendix § 15.7). At that budget the record verdict is also evaded less often than TabPFN v2, the one-class SVM, LightGBM on the raw fields and an isolation forest, while the share of its flagged bare lies beyond cover is 0.247, against 0.494 and 0.325 for the rules with hierarchical pooling and a Mahalanobis distance on the declared fields, whose minimal covers take more edits (3.62 and 3.45); each of its flags comes with the field found by abduction and a repair proposal. On bare lies the record verdict (evasion 0.740 ±\pm 0.038) is evaded less often than the rules with hierarchical pooling and LightGBM on the raw fields and on par with the MLP (0.754); LightGBM on the residuals (0.685) and TabPFN v2, evaded less often on bare lies, leave almost none of their flagged lies beyond cover (0.004 and 0.024, against 0.247).

BenchmarkLabelsIndependent of the oracleSectionsSize
Specification recordsgenerator labels: corruptions kept when the oracle flags them, with per-constraint labels; noisy-but-coherent controls; fields hidden at randomno4.2 to 4.5, 4.8107 aircraft of 71 families; test: 16 aircraft of 9 families, 204 rows with 32 controls
Intervention-labeled recordsfrom the edit alone, with a tolerance fixed before generationyes4.2 to 4.4, 4.82,582 rows, 1,810 altered; same aircraft and splits
Falsificationthe attacker’s edits of genuine recordsyes4.7736 attack problems on the 46 genuine held-out records
Satellite pairs (RarePlanes)generator labels; image swapsno4.4, 4.55,250 pairs; 10 test and 8 unseen sites
Photographic pairs (FGVC-Aircraft)constructed mismatches, attribute labels, automatic pseudo-masksyes4.4, 4.64,543 pairs; 800 test photographs
Human part masksPASCAL-Part [84], PartImageNet [85] and UDA-Part [86] annotations, for evaluation onlyyes4.6535 aircraft in 506 PASCAL-Part images; 40 UDA-Part items

Table 4. Benchmarks and labels.

By Proposition 1, a withheld field masks the axioms that require it, and the report lists every undeclared field with the constraints it leaves unchecked; withholding up to two fields lets 0.964 of lies pass the record verdict alone. NeSySpec’s optional critical-field alert addresses this channel, and each of its flags names the undeclared critical field or the violated constraint: against an attacker who knows the alert and withholds up to two fields, 0.729 of lies pass NeSySpec with the alert, on par with the residual MLP given the same alert (0.756) with all splits pooled. With the alert, false alarms on the 32 test controls are 0.148, below the Mahalanobis distance (0.656).

What the Logic Adds: Other Encodings of the Same Knowledge

The logical formulation provides the constraint-level verdicts used for diagnosis and repair. For record-level detection, learners on the same residuals perform similarly to NeSySpec in distribution and better on the unseen class (§ 4.4). Against the network trained with the DL2 loss on the same residuals and targets, which learns one head per constraint in place of the graded predicates and is their like-for-like test, NeSySpec’s graded predicates trained through Real Logic give constraint verdicts with a higher macro-F1 and a better key, with the field and a repair from the same degrees (§ 4.2). Of the other Real Logic properties of § 2.1, guarded quantification gives the exact abstention that none of 207 learned method and cell rows keeps without an image (§ 4.5), the shared truth scale the fused verdict (§ 4.4) and the gate grounding stable across loss weights (§ 4.6). Stratification (E4) keeps one verdict per evidence source, so the report says whether the record or the image raised the flag (Appendix § 15.8). Training the knowledge base through the differentiable truths of Real Logic improves detection over keeping it at its initial values: AUROC rises from 0.907 to 0.979 on test and from 0.845 to 0.934 on the unseen class. On generator labels, the full model outperforms the flat-bank ablation on every split. Removing in-band grading lowers detection on the unseen class and slightly on test and unseen families. The ablation using a generalized mean at p=4p = 4 is on par with the full model (Table G.8). In detection on test the record verdict (0.979) is slightly above the DL2-loss network (0.965) and a per-constraint monotone model on the same residual magnitudes without LTN (0.966), and on par with the network out of distribution; NeSySpec reads these magnitudes as graded predicates in physical units (Figure 5c), with the key, abduction and repair from the same degrees. The generator’s per-constraint targets (§ 4.2) and the graded predicates act together: the ablation trained with the binary record label only equals the generator labels in 0.081 of test records and is below the crisp edits on all three measures. Given as a constraint loss on the declared fields or as rules in words, the same knowledge detects less than NeSySpec’s verdict: the DL2 method on the declared fields reaches 0.703 ±0.030\pm0.030 and a language model prompted with the constraints A1-A11 in words (Qwen3-8B [52], anonymized records) 0.620, below the record verdict on every split (Table G.7), and both are below its key and verdicts (§ 4.2).

Figure 9 traces the training of the axioms over eight seeds per stratum. For the specification axioms, a re-run of NeSySpec’s training whose only addition is a copy of the state at each epoch reproduces every frozen checkpoint and its predictions bit for bit, together with every logged loss and validation AUROC; each state is scored at the end of its epoch on the training and validation records. From the initial state, shared by all seeds, to the restored best epoch, the mean feasibility exp⁡(−V)\exp(-V) on validation rises from 0.734 to 0.930 on clean-labeled records and falls from 0.335 to 0.151 on corrupted ones, while the verdict’s validation AUROC rises from 0.901 to 0.997. Panel b averages each axiom’s truth exp⁡(−vk)\exp(-v_k), which the constraint verdicts compare with 0.5, over the records where the axiom is available; the feasibility of Eq. (9) in panel a is the geometric mean of a record’s available truths. The satisfaction of the grounding axioms, averaged over the training batches of each epoch while the weights move, rises from 0.816 at the first epoch to 0.936 at the restored best epoch on photographs and from 0.976 to 0.999 on satellite crops. The training logs of the remote-sensing axioms hold no per-axiom truth, so panel c shows their verdict’s validation AUROC beside the photographs’ head accuracy and pointing; the cross-modal axioms have no trainable parameter, and late epochs average fewer seeds where early stopping ended a run.

Detection also improves with the knowledge the base encodes (Figure 10). Retrained with subsets of its 12 specification constraints, the record verdict’s intervention-label AUROC, averaged over the three held-out splits, rises from 0.535 with one constraint to 0.723 with all twelve (Spearman 0.93). It rises with diminishing returns in the number of constraints (panel a) and linearly with the share of edits that alter a field some of them read (R2R^2 0.88, panel b); the residual MLP on the same subsets gains as well (0.540 to 0.706), with no trend in their gap. Removing one constraint (panel c) lowers detection for A5, the Breguet range, and A2, the cruise lift coefficient, and slightly for A4, A7 and A8, the thrust-to-weight, mass-balance and empty-weight-fraction checks, and raises it for none; it also lowers abduction for 7 of the 12 constraints and slightly for 3 more (Appendix § 15.8).

Image not extracted

Figure 10. Detection and the knowledge encoded.

Deployment Map

Table 6 assigns each regime to the output of NeSySpec that serves it, with the workflow of an audit and the strongest comparator of each regime.

Limitations

Each limitation is bounded by the protocol and opens a line of future work (§ 5). Domain and use. NeSySpec is validated on aircraft, whose public civil records and relations a reader can verify; only its knowledge base, visual predicates, corruption generator and data are domain-specific (Appendix § 9), and its verdicts support a human analyst, with aircraft detection, tracking and identification outside its scope because of the dual-use risks of such capabilities [93]. Synthetic errors and scale. Every error is generated or edited, so its type, magnitude and field are known and each verdict is checked against them, and the intervention labels are independent of the generator; they mark the constraints an edit involves, about a third of the altered rows break none of them physically, and expert per-constraint physical labels will score the verdicts against violations (§ 5); the 107 aircraft and one published split hold every test family and satellite site out of training. Naturally occurring errors, expert red teams, larger fleets and a replication on a new fleet will extend this evidence. Class-level relations. A2 evaluates the cruise lift coefficient at maximum take-off mass and A5 uses latents shared by a class and engine type, estimable from 44 training aircraft; most violations reported on clean records come from these two relations (§ 4.2), which per-type latents and a cruise-weight form of A2 will refine. Classes without training aircraft. There, residual learners rank higher in record-level detection (§ 4.4); the optional rank-then-explain setting lets such a learner raise the alarm while NeSySpec names the constraint, the field and a repair, and larger fleets will reduce the classes read with fleet statistics alone. Omission. A withheld field masks the axioms that read it, the exact abstention of Proposition 1; the optional critical-field alert flags the omission, and class-level axioms will make the omission of a critical field a violation. Masks, statistics and encodings. Automatic pseudo-masks supervise the grounding axiom, so the protocol is reproducible from public data, and hand-annotated part masks will extend it; no multiplicity correction is applied, which the new-fleet replication will address; encoding the knowledge base in DeepProbLog, Scallop or PSL, with probabilistic facts and proofs, changes its axiomatic and logical structure and is left to a dedicated comparison.

Conclusion and Future Works

NeSySpec is an integrated and interpretable neuro-symbolic framework for auditing engineering specifications: its graded axioms on Logic Tensor Networks, trained on fleet data, determine which physical constraints a declared specification respects and which it violates, and from the degree behind each verdict it derives the altered field, a repair proposal, exact abstention on missing evidence, part-grounded image evidence and a verification report. Validated on 107 aircraft with generated, intervention-labeled and falsified errors, it provides and evaluates these outputs together.

Using a fixed rule to classify each constraint as held or violated, NeSySpec reaches a test macro-F1 of 0.795 with generator labels and, without retraining, 0.575 with intervention labels. On every split evaluated with generator labels, it outperforms three comparators in macro-F1: a network trained with the DL2 loss on the same residuals; DL2 applied to the declared fields; and a language model given

On intervention labels without retraining, on unseen families, NeSySpec’s second head, its secondary key, reaches 0.848 (largest-violation key 0.828). Satellite cells: comparators not retrained or retuned, and fusions on knowledge-base truths had the truths of the saturating-envelope variant of NeSySpec’s remote-sensing stratum they were fitted on; asymmetries in Appendix G.5.

the constraints in words. The largest-violation key identifies the violated constraint in 0.942 of corrupted test records with generator labels, outperforming Fellegi-Holt, solver-based diagnosis and rule-based diagnosis. On independently labeled errors, abduction identifies the altered field in 0.593 of records without retraining. Minimum-cardinality localization reaches 0.306 with random tie-breaking and 0.453 with oracle tie-breaking. The Class I sizing-regression residual also reaches 0.453. The record verdict detects incoherent records at a test AUROC of 0.979 on generator labels, and a missing field or image leaves each verdict exactly that of the available constraints.

An image lets the audit check the declared record against visible attributes and identify the axiom behind a disagreement. On satellite pairs, the multimodal verifier achieves an AUROC of 0.994 across all pair types, compared with 0.748 for a prompted vision-language model.

The report also shows where each visual head places its evidence. With the grounding axiom, these maps point to the annotated part in 0.737 of PASCAL-Part human masks. Localization is substantially better than RRR and GradMask on human masks from PASCAL-Part, PartImageNet and UDA-Part, with wider intervals on the 40 UDA-Part items (Appendix § 16).

Among the approaches evaluated here (the DL2 method on the declared fields, the network trained with the DL2 loss on the same residuals read per constraint, a constraint-layer repair ordering, LTN ablations, solver and rule diagnosis and prompted language and vision-language models), NeSySpec is, to our knowledge, the most suitable neuro-symbolic framework for auditing engineering specifications: it provides and evaluates together the outputs of Table 2, and its key and abduction lead classical diagnosis, the DL2 method, a prompted language model and minimum-cardinality localization with random tie-breaking. No comparator returns all the outputs of the audit, and on the test aircraft none is ahead of NeSySpec in the macro-F1 of the constraint verdicts, in naming the violated constraint and the altered field or in the repair error on the altered field (Table 5). With oracles fitted without test or out-of-distribution aircraft, its leads on intervention labels over Fellegi-Holt and Z3 in diagnosis and over minimum-cardinality localization with random tie-breaking hold on every split, at lower levels (§ 4.1). Its logic serves the physical audit more than record classification: in record-level detection, learners on the same residuals are close to it and in some settings rank records higher (§ 4.4). Its detection grows with the knowledge it encodes, following the share of edits that alter a field its constraints read, with diminishing returns in their number.

This study is a first approach to specification auditing, evaluated on aircraft and constructed errors. Broader physical knowledge, richer input evidence and larger, more diverse datasets may improve generalization to unseen systems, to be tested through independent replications. The logical formulation helps interpret anomalies by exposing which relations fail and which fields are implicated. Future work will extend NeSySpec along the following directions:

  • Other neuro-symbolic encodings. A version of the knowledge base in DeepProbLog, Scallop and PSL, with probabilistic facts and proofs in place of graded truths and masked quantification, will be compared with NeSySpec, together with the semantic loss and the monotone model read per constraint.

  • Aircraft-level latents and refined relations. Per-type latents in A5 and a cruise-weight formulation of A2 will refine the constraint verdicts. Per-constraint thresholds selected on validation will calibrate these verdicts, and expert physical labels for each constraint will be used to evaluate them. The report will display every learned band in physical units. A new relation involving the ceiling will cover the only declared field not currently checked by any constraint. Additional relations can improve detection by checking different physical relationships among fields already covered elsewhere, as A2 does.

  • Other engineering applications. Visual recognition of components and geometry could extend the audit to mechanical assemblies, industrial equipment and civil structures, with adapted knowledge bases, visual predicates and corruption generators.

  • Poorly characterized observations. The framework could also support the analysis of observations whose identity or physical behaviour remains uncertain. Physical constraints could help compare candidate explanations and identify the additional measurements needed to distinguish them.

  • Generative design and simulation. Exporting structured parameter vectors, units and constraints could connect the audit to agentic pipelines that generate parametric CAD models from text and images. Candidate models could then undergo finite element method (FEM) simulations, computational fluid dynamics (CFD) and other numerical analyses, feeding their results back into the audit.

  • Training and hyperparameters. Further ablations will assess how supervision, loss balancing and joint versus separate module training affect diagnosis and generalization. Hyperparameter sensitivity will be evaluated on validation data.

  • Inference efficiency. Profiling will measure the inference cost of each module. Batching, caching and adaptive search budgets will be evaluated in terms of latency, diagnostic accuracy and repair quality.

  • Naturally occurring errors. Cross-source discrepancies, variant mix-ups, with block abduction, and uncorroborated fields will bring the audit to real errors, and expert red teams will extend the falsification protocol.

  • Evidence, images and declarations. Imputation channels chosen with block-wise hiding will extend NeSySpec with MICE imputation enabled, hand-annotated FGVC-Aircraft part masks and visual strata adapted to new sensors will extend the grounding axiom, and class-level axioms will make the omission of a critical field a violation.

Declaration of Generative AI and AI-Assisted Technologies in the Manuscript Preparation Process

During the preparation of this work, the authors used AI tools to improve the language, readability, and grammar of the manuscript, as well as to assist with debugging and bug hunting.

Data Licenses

FGVC-Aircraft [7] is provided for non-commercial research only and its photographs are not redistributed, apart from the four photographs of Figure 8, reproduced for illustration with credit to their photographers (airliners.net); RarePlanes [8] is distributed under the Creative Commons Attribution-ShareAlike 4.0 International license; the two satellite crops of Figure 8 are adapted from it (cropped, resized and overlaid with activation maps) and shared under the same license, under which the tables and crop indices derived from it will be released. The human part masks used for evaluation are not redistributed.

References

Porting to Other Engineered Systems

This appendix guides the port of NeSySpec to the declared specifications of another engineered system whose fields are linked by physical, definitional or regulatory relations with statable tolerances; Table A.1 lists what the new system supplies, what is fitted again and what is reused.

The aircraft study suggests this ordered checklist.

  1. Scope. NeSySpec audits the coherence of a declaration with physics and with its evidence, and its report supports human review (§ 4.10).

  1. Fields and relations. List the fields with their units and one relation per constraint, and let every constraint that reads an undeclared field abstain: on the records as declared, filling the undeclared fields at scoring lowers detection, with global means on every split and with MICE on test and unseen families, while with fields hidden at random MICE at scoring ranks unseen-family records higher (Appendix § 15.§ 3).

  1. Priors and labels. Fit initial bands on clean training records only, and fix an intervention tolerance before generation, so that the intervention labels also reach errors that the generator oracle misses: on aircraft, the oracle flags no constraint on 613 of the 1,810 rows labeled as altered (33.9%; Appendix § 15.§ 4).

ComponentContentAircraft study
Supplied by the new system
Knowledge baseone exact, differentiable quantity per relation, each with a graded predicate, an availability condition and a scope; bounded latents for rarely declared quantities; initial bands fitted on clean training records; regulatory bands frozen12 constraints on records and 10 on satellite annotations (Table 3); 336 trainable parameters on records, 126 of them latents, and 57 on satellite annotations; no neural network
Visual predicatesone sigmoid head per class, with the parts where its evidence must lie; cross-modal axioms with the same form25 heads per dataset (Table E.1)
Generator and datacorruptions that break one relation or swap a block of fields; noisy-but-coherent controls; an oracle with per-constraint labels; an intervention tolerance fixed before generation; sourced records with units, split by family or sitefive corruption families, controls and intervention labels; 107 records of 71 families (Appendix D)
Fitted again
Bands and visual modulestolerances learned from the training fleet; visual heads specific to their sensor45.7% of the learned bands with both edges inside the widened training fleet range (Appendix G.9); with a visual stratum trained on photographs, the fused verdict reaches an AUROC of 0.724 on satellite pairs, against 0.796 for the record verdict alone (Appendix G.5)
Reused as Section 3 defines it
Verdict and reportmasked verdict with slopes and bands learned per derived quantity, and its exact reduction for any knowledge base; a diagnosis key read from its degrees and a monotone second head; abduction, repair proposals and the report; stratified aggregation; grounding axiom with gate, guard and floorSections 3.2 to 3.7; Appendix B
Protocolpriors built without held-out aircraft, intervention labels, black-box falsification within an edit budget, cluster-bootstrap intervals, comparators grouped by the knowledge they receive (Table F.1), statistical imputers among themSection 4.1; Appendix F

Table A.1. Porting to a new engineered system.

  1. Masks and sensors. Measure automatic part masks against public human masks, and train visual heads on images of the sensor in use (Sections 4.5 and 4.6; Appendix G.5).

  1. Comparators. Include learners on the same physical residuals: on aircraft records a multilayer perceptron on them serves as the alarm of the optional rank-then-explain setting (Section 4.4).

  1. Critical fields. NeSySpec abstains on every constraint that reads an undeclared field; on aircraft, NeSySpec’s optional critical-field alert brings the evasion of lies that withhold fields back to the level of bare lies, which withhold none (Section 4.7).

Implementation and Verification Report

This appendix summarizes how the implementation of NeSySpec is organized and shows an example of a verification report. The implementation follows the seven modules of § 3. Every prediction file, of NeSySpec and of each comparator, has one format (instance identifier, split and score, with per-constraint outputs where the method returns them), so a single evaluation script scores every method in the same way.

Example of a Verification Report

Figure 5 (§ 4.2) shows a report assembled from the saved outputs of NeSySpec (train prior, seed 0) for a record chosen by a rule fixed before any value was read: the first single-field corruption of the test split, in file order, whose altered field an available constraint reads. The corruption divides the total thrust of a narrow-body turbofan by 1.2, and the generator oracle flags A4 and A9. The verdict flags the record (V=1.217V = 1.217, above the validation threshold t∗=0.310t^* = 0.310 of this seed), and the report lists the degree of every available constraint, the largest being A4 (10.001), A5 (1.053), A8 (0.386) and A9 (0.384). By the rule of § 3.7, A4 and A5 exceed ln⁡2\ln2 and are violated, A5 also on the clean record, while A8 and A9 are held. The largest-violation key names A4, which the oracle flags; it ranks A4 first in every seed, followed by A5 in this seed and by A8 in 5 of the 8 seeds.

Physical Relations and Constants

The specification axioms evaluate closed-form relations of conceptual aircraft design [71] (Table 3). Table C.1 gives the constants of the relations and of the International Standard Atmosphere (ISO 2533:1975) with the initial values of the graded degrees, and Table C.2 the remote-sensing constants with the Airplane Design Groups of the Federal Aviation Administration (FAA)7. The train prior widens each per-class range of a derived quantity over the 44 clean training aircraft to [0.88 min, 1.12 max], as the oracle does; these initial bands are then learned with their slopes (§ 3.2), and business jets, absent from training, start from the band of all training classes. The learned bands act as tolerances learned from the fleet. On specification records, 45.7% of them keep both edges inside the training fleet range widened in the same way, and the others extend beyond it (Appendix § 15.9). In the remote-sensing stratum, 103 of the 144 learned group bands (the 18 bands of R2 for military roles, R3 and R4 in each of the 8 seeds) extend beyond the clean training range widened on each side by 12% of its width. The initial bands of R2 for military roles, R3 and R4 (Table C.2) were set from the annotations and from knowledge of the aircraft types to contain every clean annotation, those of test and unseen sites included, and the generator oracle of the satellite benchmark was fitted on the clean annotations of every site, so both may carry held-out information; the satellite benchmark was not regenerated, nor the remote-sensing stratum retrained, without them.

Data and Benchmark Details

This appendix describes the specification records and the benchmarks built from the records and images of § 3.1: the corruption operators with their realized magnitudes (Table D.1), the realized instances per type and split (Appendix § 12.§ 1), the frame of the cross-dataset runs and the rule that chose the examples of Figure 8. Every generator is deterministic given its seed. The 107 specification records cover seven classes: wide-body (17 aircraft of 8 families), narrow-body (18 of 6), regional jet (13 of 6), regional turboprop (11 of 8), business jet (19 of 17, the unseen class), general-aviation turboprop (12 of 11) and general-aviation piston (17 of 15). They were compiled from the type-certificate data sheets of the aviation authorities of the United States, the European Union, Canada, the United Kingdom and France and from manufacturer documents (airport-planning manuals, specification sheets and flight-manual excerpts), with other public sources used for cross-checks. The 67 jets declare thrust and the 40 propeller aircraft shaft power, and 18 records, all general-aviation aircraft, declare the stall speed; every record passed a loose screening with the verifier’s physics module, so the clean records were checked against the relations that the verifier evaluates; the intervention labels, set from the edit alone, bypass this dependence. Table D.1 lists the corruption operators. A candidate that the oracle does not flag is generated again with its magnitude doubled, for at most six attempts (§ 3.1), so the realized magnitudes reflect the oracle tolerances and extend beyond the declared grid of 5 and 10%. They extend furthest for performance corruptions, whose Breguet tolerance must absorb the largest residual among the clean records.

Benchmarks

Table D.2 gives the realized instances per type and split of four benchmarks: the specification records, the photographic mismatch pairs, the satellite annotations and the satellite multimodal pairs. Of the 100 FGVC-Aircraft variants, 68 are paired with a specification record, 39 with the record of their type and 29 with that of their family; their 6,800 photographs follow the split of the paired family (2,500 training, 1,300 validation, 800 test, 1,500 unseen-family and 700 unseen-class photographs), and the 32 unpaired variants enter no split. The satellite annotations start from 3,000 clean RarePlanes annotations, a sample stratified by role with a floor of 200 annotations per role (all annotations of a rarer role), and each operator draws one candidate from each of them, so the kept and discarded candidates of a type sum to 3,000. In the cross-dataset runs of Appendix § 15.§ 5, a knowledge base fitted on one source scores the other through a 23-field unified frame (Figure 2(c)) with only the axioms R2 to R4, which both sources can evaluate; a specification record takes its role and design group from its clean wingspan. On the records of each split, the report prints the class of the nearest clean training record (§ 3.7; example in Figure 5): this proximity names the class of a record from an unseen family and attributes each business jet, a class absent from training, to its nearest training class.

Standard atmosphereRelations and graded degrees
gg9.80665 m s−29.80665\ \mathrm{m\,s^{-2}}unitsSI, except RR (km), FtotF_{\mathrm{tot}} (kN) and PtotP_{\mathrm{tot}} (kW)
RairR_{\mathrm{air}}; γair\gamma_{\mathrm{air}}287.05287 J kg−1 K−1287.05287\ \mathrm{J\,kg^{-1}\,K^{-1}}; 1.41.4A5W1=max⁡{MTOW−0.94 mfuel,0.05 MTOW}W_1=\max\{MTOW-0.94\,m_{\mathrm{fuel}},0.05\,MTOW\}, a 6% fuel reserve; log residual clipped to [−3,3][-3,3]; available only when ARAR is also declared and, for propeller aircraft, VcrV_{\mathrm{cr}}
T0T_0; ρ0\rho_0288.15 K288.15\ \mathrm{K}; 1.225 kg m−31.225\ \mathrm{kg\,m^{-3}}A6log residual clipped to [−2,2][-2,2]; wide CL,max⁡C_{L,\max} bounds, because published stall speeds mix clean and landing configurations
Γ\Gamma6.5×10−3 K m−16.5\times10^{-3}\ \mathrm{K\,m^{-1}} (troposphere)A795 kg per passenger with baggage; fu∈[0.3,1]f_u\in[0.3,1]
htrh_{\mathrm{tr}}; TtrT_{\mathrm{tr}}11,000 m; 216.65 K, isothermal above; density continuousunusedan estimate of maximum L/DL/D from ARAR (Oswald factor 0.80, zero-lift drag coefficient 0.020) is implemented but read by no axiom; A5 takes L/DL/D from its latent
hˉ\bar{h}hcrh_{\mathrm{cr}} clamped to [0,20,000] m[0,20{,}000]\ \mathrm{m}coordinatesz=(log⁡10q−mg)/σgz=(\log_{10}q-m_g)/\sigma_g for a band, z=ξ/σgz=\xi/\sigma_g for the residual ξ\xi of A1, A5, A6 and A7; mg,σg≥10−3m_g,\sigma_g\ge10^{-3} from the clean training rows of group gg (σg\sigma_g a root-mean-square around 0 for ξ\xi), shrunk toward the fleet with weight ng/(ng+5)n_g/(n_g+5), the scatter through its square; a group without rows takes the fleet values
a(hˉ)a(\bar{h})γairRairT(hˉ)\sqrt{\gamma_{\mathrm{air}}R_{\mathrm{air}}T(\bar{h})}initial valuestolerances τ/σg\tau/\sigma_g with τ=0.05\tau=0.05 (A1), 0.250.25 (A5) and 0.150.15 (A6); slope κ=8/w~\kappa=8/\widetilde{w}, with w~\widetilde{w} the median initial band width in standard units (A7: κ=25σ\kappa=25\sigma, with σ\sigma the fleet scatter of its margin, and lower edge at 0); in-band weight 0.05
latent boundssigmoid of one parameter per pair, rescaled to these bounds and starting at their midpoint; L/DL/D: 15–21 (wide-body), 14–19 (narrow-body), 12–17 (regional jet), 11–17 (regional turboprop, business jet), 9–15 (general-aviation turboprop), 7–14 (general-aviation piston); CL,max⁡C_{L,\max}: 2.2–3.2 (wide-body, narrow-body), 2.0–3.0 (regional jet), 1.9–3.0 (regional turboprop), 1.6–2.8 (business jet), 1.4–2.4 (general-aviation turboprop), 1.2–2.2 (general-aviation piston); cTc_T (turbofan): 1.2×10−51.2\times10^{-5} to 2.3×10−5 kg N−1 s−12.3\times10^{-5}\ \mathrm{kg\,N^{-1}\,s^{-1}}; cPc_P: 7.5×10−87.5\times10^{-8} to 1.1×10−71.1\times10^{-7} (turboprop), 7.0×10−87.0\times10^{-8} to 1.0×10−71.0\times10^{-7} (piston) kg W−1 s−1\mathrm{kg\,W^{-1}\,s^{-1}}; ηp\eta_p: 0.75–0.88
degreescapped at 104^4; truth exp⁡(−v)\exp(-v) never clamped; a masked axiom contributes no value and no gradient; V=ln⁡2V=\ln2 without an available axiom
gg: standard gravity; Rair,γairR_{\mathrm{air}},\gamma_{\mathrm{air}}: gas constant and ratio of specific heats of air; T0,ρ0T_0,\rho_0: sea-level temperature and density; Γ\Gamma: temperature lapse rate; htr,Ttrh_{\mathrm{tr}},T_{\mathrm{tr}}: altitude and temperature of the tropopause; hˉ\bar{h}: altitude at which the atmosphere is evaluated; aa: speed of sound; qq: derived quantity of an axiom; ngn_g: number of clean training rows of group gg.

Table C.1. Constants of the physical relations.

Design groupWingspan (m)
Ibelow 14.9352
II14.9352–24.0792
III24.0792–35.9664
IV35.9664–52.1208
V52.1208–65.2272
VI65.2272–79.8576

Table C.2. Constants of the remote-sensing axioms.

RoleR2 span (m), initialR3 L/bL/b, initialR4 nengn_{\mathrm{eng}}, initialR6 PP (jet), initial
Civil small0–15.005 (frozen)0.55–1.700–20.25
Civil medium15.005–36.0 (frozen)0.70–1.451–40.55
Civil large36.0–90.0 (frozen)0.75–1.352–40.98
Military transport7–750.70–1.601–40.55
Military bomber7–600.60–2.202–40.90
Military fighter5–200.90–2.701–20.98
Military trainer5–150.80–2.001–20.60
Initial tolerance 0.3 (R5) and 0.10 (R10); weight of R9 0.5; frozen: R1 and civil R2 bands
Graded slots R1, R2 (civil and military), R3, R4 and R10; 57 trained parameters

Table C.2. Constants of the remote-sensing axioms.

OperatorFields alteredKept if the oracle flagsKeptDisc.5%10%20%40%80%160%320%
Single valueone of SS, FtotF_{\mathrm{tot}} or PtotP_{\mathrm{tot}}, OEWOEW, VcrV_{\mathrm{cr}}the targeted envelope (A3, A4 or A4P, A8, A10)212200531054680
Geometricone of bb, SS, ARARA1208610410400000
PerformanceRR or mfuelm_{\mathrm{fuel}}A518925121335556617
Cruiseone of VcrV_{\mathrm{cr}}, hcrh_{\mathrm{cr}}, SSA220680859854671
Frankensteinone block of a record of another classany constraint17638-
Noisy-but-coherent controlevery declared non-integer field (relative standard deviation 0.02); ARAR re-derivedno constraint (y=0y = 0)2140-

Table D.1. Corruption types and magnitudes.

Constraints violated per corrupted instance1234-6Total
Corrupted instances55325312560991

Kept: instances kept; Disc.: candidates discarded, because the operator does not apply to the record (a missing field, or for a Frankenstein swap no record of another class in the same split) or because the condition of the third column fails in all six attempts. Each operator draws two candidates per clean record, 214 in all; the 38 discarded Frankenstein swaps are those of the unseen class, a single class. Constraints violated: flagged by the generator oracle. Disc. has the same meaning in Table D.2.

Examples of Figure 8. The figure shows, for seed 0, the network trained with the grounding axiom and the network trained without a localization term. A rule fixed in advance chose its examples: each is the first candidate on which both networks give a non-degenerate map (maximum above 0) and the axiom-trained network predicts the target class with an in-mask share ρ\rho of at least 0.15. Photographs for engine count, propulsion and tail configuration are taken in identifier order from validation and test, and from unseen families only when validation and test offer no such candidate. Satellite crops of civil aircraft, for the role small civil aircraft and for an engine count of 2, are taken in identifier order from validation and test sites, the second from a site other than the first’s, with the annotated diamond as region. Both networks are drawn at their selected checkpoints; on photographs the network without a localization term is at its first epoch. Pointing is higher with the axiom in every seed pair at the selected and at the last checkpoints, and the automatic pseudo-masks include some background or off-part regions, visible in the figure. The examples illustrate the maps; pointing measures localization (§ 4.6).

TypeLabelTrainVal.TestUnseen fam.Unseen classTotal
Specification records
Cleancoherent4417161119107
Single valueincoherent8634322238212
Geometricincoherent8832322234208
Performanceincoherent8129282229189
Cruiseincoherent8632322234206
Frankensteinincoherent883432220176
Noisy-but-coherent controlcoherent8834322238214
Total5612122041431921,312
Photographic mismatch pairs
Matchedcoherent788499412250512,000
Inter-classmismatched227108701380543
Intra-familymismatched227168137680600
Attributemismatched2321581326315600
Occlusioncoherent control16111569523400
Degradationcoherent control16387885012400
Total1,7981,135908621814,543

Table D.2. Benchmarks.

TypeLabelTrainVal.TestUnseen sitesDisc.
Satellite annotations
Cleancoherent1,903262357478-
Wingspan rescalingincoherent1,9032623574780
Length rescalingincoherent1,1391492243061,182
Design-group changeincoherent1,9032623574780
Role changeincoherent1,9032623574780
Engine-count swapincoherent1,233170254415928
Propulsion changeincoherent1,89025635747819
Frankensteinincoherent1,8992623564785
Noisy-but-coherent controlcoherent1,9032623574780
Total15,6762,1472,9764,0672,134
Satellite multimodal pairsTotal
Cleancoherent9501441712351,500
Tabular corruptionincoherent9561521622301,500
Image swapincoherent9711341702251,500
Geometric corruptionincoherent4837580112750
Total3,3605055838025,250

Table 7.

Photographic pairs: matched, a photograph with its own record; inter-class, with the record of an aircraft of another class; intra-family, with the record of another variant of its family; attribute, with its own record altered in engine count, engine type or maximum take-off mass; occlusion and degradation, with its own record and a part of the photograph occluded or the photograph degraded (blur, compression or low light). Satellite multimodal pairs: clean, an annotation with its own crop; tabular corruption, the annotation altered in engine count, propulsion or role, with its own crop; image swap, the clean annotation with the crop of an aircraft of another role from the same split; geometric corruption, the annotation with its wingspan or length rescaled. Disc.: as in Table D.1; in the multimodal panel the last column gives the totals.

Method Details

This appendix completes § 3. Table E.1 adds the visual predicates and the cross-modal axioms to the catalog of Table 3; Appendix E.1 proves Proposition 1 and reports its numerical check; Figures E.1 and E.2 zoom into the verification report and the vision module; Appendix E.2 defines the localization terms of the matched grounding study; and Algorithm E.1 transcribes the forward pass for one declared record.

Proof of the Exact Reduction

Proof. (a) Fix α\alpha. A masked axiom has αk=0\alpha_k = 0, and the implementation sets its degree (for a cross-modal axiom, its truth) to 0 by selection before any sum; its term and its weight therefore vanish from the numerator and from the denominator of Eq. (9), which reduce to the sums over S′S'. If S′S' is empty, a tabular stratum takes VS=ln⁡2V_S = \ln2 by definition and the cross-modal stratum has γAx=0\gamma_A x = 0. Every degree and its derivatives are finite, because undeclared fields carry a finite placeholder and degrees are capped at 10410^4, so the selection passes no value and no gradient from the degree νk\nu_k, or the truth sks_k, of a masked axiom. The stratum verdict therefore has zero derivative with respect to them, and a field read only by masked axioms does not affect it. (b) Without an image, no cross-modal axiom is available. Then, as when every cross-modal axiom is masked, γAX=0\gamma_{\mathcal{A}\mathcal{X}}=0, and since λT>0\lambda_{\mathcal{T}}>0, Eq. (10) reduces to feasT=exp⁡(−VT)\mathrm{feas}_{\mathcal{T}}=\exp(-V_{\mathcal{T}}); the implementation returns feasT\mathrm{feas}_{\mathcal{T}} itself in this case, so the equality holds bit for bit. Otherwise, the cross-modal stratum enters both sums of Eq. (10) with weight λAXγAX\lambda_{\mathcal{A}\mathcal{X}}\gamma_{\mathcal{A}\mathcal{X}} and the tabular stratum keeps λT\lambda_{\mathcal{T}}, which is the stated renormalization over the strata present. □

PredicateClasses (one sigmoid head each)Part regionRead by
Photographs (8 predicates, 25 heads; regions from the pseudo-masks)
EngineCount1, 2, 3, 4engineAX1
EnginePlacementunderwing, rear, overwingengineAX4
Propulsionjet, turboprop, pistonpropeller and engineAX2
WingPositionhigh, mid, lowwingAX5 (not implemented)
TailConfigconventional, T-tail, cruciform, V-tailtailAX4
WingletPresencepresent (binary)none (conjuncts masked)none
MainGearWheelCount2, 4, 6 to 10, 12 or more (no attribute labels)landing gearAX3
FuselageSlendernessstubby, standard, slender (no attribute labels)none (conjuncts masked)none
Satellite crops (7 predicates, 25 heads; region of every head: the annotated diamond)
rolecivil small, medium, large; military transport, bomber, fighter, trainerdiamondAX4, AX5
wing typestraight, swept, delta, variable-sweptdiamondAX3
wing positionmid or low, highdiamondnone
propulsionjet, propeller, unpowereddiamondAX2
engine count0, 1, 2, 3, 4diamondAX1
canardsno, yesdiamondnone
tail fins1, 2diamondnone
IDPhotographs: truth (availability)Satellite crops: truth (availability)
AX1pvis(neng∣I)p_{\mathrm{vis}}(n_{\mathrm{eng}}\mid I) (declared neng∈{1,…,4}n_{\mathrm{eng}}\in\{1,\ldots,4\}; engine visible)pvis(neng∣I)p_{\mathrm{vis}}(n_{\mathrm{eng}}\mid I) (declared neng∈{0,…,4}n_{\mathrm{eng}}\in\{0,\ldots,4\})
AX2pvis(e^∣I)(1−pvis(propeller∣I)σ(25(M−0.62)))p_{\mathrm{vis}}(\hat{e}\mid I)\left(1-p_{\mathrm{vis}}(\mathrm{propeller}\mid I)\sigma(25(M-0.62))\right), each factor entering only when its declared fields are present (engine type, or VcrV_{\mathrm{cr}} and hcrh_{\mathrm{cr}}, declared; propeller or engine visible)pvis(π∣I)p_{\mathrm{vis}}(\pi\mid I) (declared π\pi)
AX3∑jpvis(j∣I) μj(log⁡10MTOW)\sum_j p_{\mathrm{vis}}(j\mid I)\,\mu_j(\log_{10}MTOW), band edges at log⁡10MTOW=4\log_{10}MTOW=4, 5.05 and 5.5, slope 16 (MTOWMTOW declared; landing gear visible)pvis(t∣I)p_{\mathrm{vis}}(t\mid I) (declared tt)
AX4I_R\left(p_{\mathrm{vis}}(\mathrm{rear}\mid I),p_{\mathrm{vis}}(\mathrm{T\mathchar`-tail}\mid I)+p_{\mathrm{vis}}(\mathrm{cruciform}\mid I)\right) (engine and tail visible; no declared field)pvis(r∣I)p_{\mathrm{vis}}(r\mid I) (declared rr)
AX5wing position against class: planned, not implemented1−∑r′pvis(r′∣I)ιr′1-\sum_{r'}p_{\mathrm{vis}}(r'\mid I)\iota_{r'}, where ιr′=1\iota_{r'}=1 when r′r' is a civil role whose wingspan band does not overlap the band of the declared design group; weight 0.5 (declared civil rr and design group)

Table E.1. Axiom catalog: visual predicates and cross-modal axioms. pvis(⋅∣I)p_{\mathrm{vis}}(\cdot\mid I): posterior of a predicate, the softmax over its heads (a sigmoid for a binary predicate); e^\hat{e}: visual class of the declared engine type (turbofan to jet); propeller: turboprop or piston; MM: cruise Mach number Vcr/a(hcr)V_{\mathrm{cr}}/a(h_{\mathrm{cr}}) of the declared fields, as in A10; μj\mu_j: soft membership of the declared mass in the wheel band jj; IRI_R: Reichenbach implication; [⋅][\cdot]: indicator. Every head of a satellite crop shares the diamond region, visible whenever it is annotated. The photographic score reads the cross-modal axioms alone; the satellite verdict combines them with R\mathcal{R} (Section 3.5). Settings: Table F.2.

In float32, the masked verdict equals the verdict of the knowledge base restricted to the available constraints bit for bit in 16 of 16 runs (Figure 7a), eight seeds under each of the two tolerance priors: the train prior and the textbook prior, which takes handbook envelopes in place of the bands fitted on the training fleet (Table G.7, note f). It agrees with a float64 recomputation up to float32 rounding, within 2.2×10−72.2\times10^{-7} relative, and the reduction without an image also holds in all 180 runs scored with newly drawn masks that hide a nominal 30% of the satellite images.

Method Components

Figure E.1 zooms into the module that assembles the verification report and the optional settings of § 3.7.

Figure E.2 zooms on the vision module and the grounding axiom of § 3.3.

Table F.2 gives the settings of the components. The matched grounding study isolates the gate of the grounding axiom: on photographs, it trains localization terms λ[gik(1−Loc⁡k(li))]vis\lambda\left[g_{ik}(1-\operatorname{Loc}_k(l_i))\right]_{\mathrm{vis}} with different gates gikg_{ik}, at the loss weights λ\lambda of 0.3, 1 and 3 used in § 4.6, with three runs per weight. With

Image not extracted

Figure E.1. Verification report and optional settings.

Image not extracted

Figure E.2. Vision module and grounding axiom.

gik=Pk(Ii)g_{ik}=P_k(I_i) the term is the grounding axiom; with gikg_{ik} equal to the positive label of a supervised head and the normalizer of the axiom, only the gate changes (gate only); with gik=1g_{ik}=1 the gate is removed (ungated term). A fourth variant gates by the label and averages over the visible label-positive heads, which changes the normalizer together with the gate. The auxiliary loss of § 3.3 is trained at the same weights as a reference; § 4.6 and Appendix § 16 report its comparison with the axiom.

On photographs, the engine-count and engine-type axioms AX1 and AX2 carry the instance-specific signal, since the gear heads read by AX3 have no attribute label and AX4 reads no declared field; a pair without an available axiom scores 0. On satellite crops, AX5 is available on 95.2% of the pairs.

Algorithm E.1 transcribes from the code the forward pass of Figure 1 for one declared record.

Protocol Details

This appendix completes the setup of § 4.1: it lists the comparators and the configuration, states how the configuration was selected and which choices used data beyond the training split, and reports how the vision results change when the part detector’s visibility threshold is re-selected on validation data alone. Table F.1 orders the comparators by the knowledge they receive; each shares the partitions, the labels and the evaluation code of NeSySpec, with settings selected on validation data within a budget fixed before its runs, and one planned arm, the language model in its thinking mode, has no result: in a pilot run too few of its answers could be parsed, below the parse rate fixed before the runs. Table F.2 gives the configuration of every module of NeSySpec, of its optional settings and of the baseline detectors; bands, slopes, latents, visual heads, read-outs, operating thresholds and checkpoints are fitted or selected on data, and every other value was set once. The class bands of the generator oracle are fitted on all 107 aircraft, test and out-of-distribution aircraft included, and reach training through the generator labels and per-constraint targets (§ 3.1); Appendix § 15.9 refits the

Algorithm E.1: NeSySpec verification of a declared record.

Input: xx, mm, optional image II, stratum T∈{A,R}T \in\{A, R\}, threshold t∗t^*

Output: verification report

  1. foreach axiom k∈Tk \in T do availability αk\alpha_k, degree vkv_k by Eq. (3) (−ln⁡-\ln of its truth for R5 to R9), truth sat⁡k=exp⁡(−vk)\operatorname{sat}_k = \exp(-v_k)

  2. VT←V_T \leftarrow Eq. (9), or ln⁡2\ln2 without available axioms; feas⁡←exp⁡(−VT)\operatorname{feas} \leftarrow\exp(-V_T)

  3. if I≠∅I \ne\varnothing then

  4.     foreach axiom j∈AXj \in\mathcal{A}X do availability αj\alpha_j, truth sat⁡j\operatorname{sat}_j

  5.     if γAX=1\gamma_{\mathcal{A}X}=1 and II is a satellite crop (T=RT=R) then feas⁡←\operatorname{feas} \leftarrow Eq. (10)         // photographs: score 1−feas⁡AX1-\operatorname{feas}_{\mathcal{A}X}, or 00 if γAX=0\gamma_{\mathcal{A}X}=0

  6. V←−ln⁡feas⁡V \leftarrow-\ln\operatorname{feas}; flagged ←[V≥t∗]\leftarrow[V \ge t^*]; ek←αkvke_k \leftarrow\alpha_kv_k; p^m\hat{p}_m and ckc_k by Eq. (11)

  7. report ←\leftarrow degrees, truths, coverage, maps and the nearest clean training record

  8. if a specification record with at least one available constraint is flagged by its verdict or by an optional setting (the residual-learner alarm of rank-then-explain or the critical-field alert) then

  9.     diagnosis arg⁡max⁡k:αk=1vk\arg\max_{k:\alpha_k=1} v_k (secondary key arg⁡max⁡kck\arg\max_k c_k); field ranking by Eq. (12); repair by Eq. (13)

  10. return report

oracle without test or out-of-distribution aircraft.

Selection of the configuration. NeSySpec’s configuration was selected on validation data and on held-out training classes; during development, earlier configurations were also evaluated on the test splits. Validation data selected the configuration of both tabular strata, the largest-violation key, the abduction and repair rules and the optional settings, and held-out training classes also selected the key and the critical-field alert (Appendix G.9). The rule that reads each constraint as held or violated has no tuned parameter. The part detector’s visibility threshold was moved from 0.25 to 0.20 on a 240-image stratified subset including test and out-of-distribution images, by an informal trade-off, with no numeric criterion and no saved tuning output. The results of this paper use 0.20.

Visibility threshold re-selected on validation. Re-selected on 240 stratified validation images alone, under a criterion declared beforehand that keeps propeller detections on jets, which have no propeller, at or below 10% of jet images, the threshold becomes 0.25, as in 197 of 200 resampled subsets: at 0.20 those detections reach 17% on validation, against 7% on the original subset. Weighing part visibility and those detections equally keeps 0.20. Without retraining, 0.25 turns 12.1% of the part flags of training, validation and test images to not visible, 2,794 flags, 1,618 of them on the wing.

Vision module retrained at 0.25. Retrained at 0.25 with the same code, configuration and 8 seeds (even seeds on the RTX 5090, which trained the original module, and odd seeds on the RTX 4090; the even seeds alone give the same accuracy and pointing readings), the photograph module keeps its macro head accuracy (0.916 on test and 0.944 on unseen families, as at 0.20) and at most one collapsed head per seed on test. It also keeps its pointing lead over the network without a localization term (+0.671) and with permuted masks (+0.414), its lead over RRR, GradMask and Pukdee et al. on PASCAL-Part (+0.568, +0.676 and +0.469, every interval above zero) and the nine overall readings of the cross-modal stratum against Qwen3-VL-8B, InternVL3.5-8B and Qwen3-VL-32B on test, unseen families and the unseen class. Of the 29 readings by pair type, 4 change by one step under each of the two bootstrap streams of that comparison, 3 of them to the disadvantage of the stratum. The networks without a localization term or with permuted masks, RRR, GradMask and Pukdee et al. were trained with the flags at 0.20 and not retrained. At 0.25 the cross-modal AUROC is 0.693 on test (0.692 at 0.20) and slightly lower on unseen families (0.716 against 0.733) and on the unseen class (0.827 against 0.844); the axiom on engine placement and tail configuration (AX4) is available on 0.784 of the test pairs scored for detection, instead of 0.956. Pointing on pseudo-masks is slightly lower on test (0.774 against 0.780) and on unseen families (0.778 against 0.784): there the seed-bootstrap and the image-and-seed bootstrap intervals include zero, while the intervals over paired seeds, [−0.010,−0.001][-0.010, -0.001] and [−0.010,−0.004][-0.010, -0.004], do not. On PASCAL-Part human masks pointing is slightly lower with 3 runs (0.711 against 0.737, −0.026-0.026 [−0.051,−0.002][-0.051, -0.002]) and lower over 8 seeds (0.708 against 0.729, −0.020-0.020 [−0.037, −0.005]. The auxiliary loss at weight 0.3, retrained at 0.25 with its 3 seeds, falls on PASCAL-Part as the axiom does (0.708 against 0.739, −0.031 [−0.055, −0.005]). With both at 0.25 the two stay on par in localization on test pseudo-masks (−0.009), out of distribution (−0.027) and on PASCAL-Part (+0.003 [−0.028, +0.032]), while the axiom keeps its out-of-distribution accuracy lead (+0.016 [+0.010, +0.021]). With all 8 seeds of the axiom, the axiom’s pointing on test pseudo-masks is slightly lower than that of the auxiliary loss at 0.25 (−0.019) and lower at 0.20 (−0.026). A first check against the auxiliary loss still at 0.20, added after the results, had shown the axiom lower on PASCAL-Part (−0.028); the like-for-like comparison attributes that difference to the threshold.

Additional Results and Figures

The evaluation at a glance. NeSySpec is tested against 14 groups of comparators (Table F.1), from knowledge-free detectors, residual learners and tabular foundation models to solvers, constraint losses and prompted language and vision-language models, on six benchmarks, four of them labeled independently of the generator oracle (Table 4). Specification records carry two label families, generator and intervention labels, and are evaluated on three splits (test, unseen families and the unseen class), satellite pairs on two (test and unseen sites); each stratum of NeSySpec is trained with eight seeds (seeds 0 to 7, Table F.2) and the satellite backbone grid with three seeds per backbone. Unless the text or a table note names another scheme, every interval on specification records rests on 5,000 cluster-bootstrap resamples at each of the two cluster levels (seed 20261002); the removals of Table G.9 use 2,000, and the curve over the number of constraints in Appendix § 15.8 resamples the subsets of each size and the seeds of each drawn subset (5,000 draws). Tables G.1 to G.4 print 168 contrasts with both intervals, and Table G.8 prints 41, of which 36 are not in Table G.3. Every primary diagnosis contrast of the largest-violation key keeps its reading in all 20 alternative bootstrap streams, except two on intervention labels, which keep it in 19 and 17 of the 20. So do 11 ablation contrasts, the unseen-class contrasts with half the fields hidden, also under each of 10 further bootstrap seeds of that analysis, and every primary localization and repair contrast except two on the record repair error.

This appendix gives the complete levels behind § 4, the audit tasks first: constraint verdicts, diagnosis, localization and repair, and missing evidence, then record coherence, records with images, grounding, falsification and the ablations; it ends with the selected components and the sensitivity analyses, including the generator oracles refitted without test or out-of-distribution aircraft (Appendix § 15.9), and with the training checkpoints (Appendix § 15.10). Tables G.1 to G.4 give, for the comparisons of § 4.2 to § 4.5 and 4.7, the difference with its intervals, written [a, b] · [c, d], [aircraft] · [family] on specification records; those of § 4.6 are in Appendices § 15.6 and § 16.

Constraint Verdicts

NeSySpec’s constraint verdicts reach a macro-F1 of 0.795 on generator-label test and, without retraining, 0.575 on intervention-label test (Table G.5), from a rule fixed by the semantics (a degree above 2) with no tuned parameter; comparator thresholds were chosen on validation rows only. Against the network trained with the DL2 loss on the same residuals and per-constraint targets, their macro-F1 is higher in all six split and label-family cells, with every interval above zero: on test by +0.134 [+0.086, +0.242] · [+0.099, +0.264] with generator and +0.149 [+0.090, +0.268] · [+0.095, +0.276] with intervention labels, on unseen families by +0.243 and +0.250 and on the unseen class by +0.164 and +0.121. In all six cells they also find every labeled violation of a corrupted record more often (on generator-label test 0.934 against 0.522, +0.413 [+0.367, +0.460] · [+0.371, +0.510]) and reach a higher micro recall (0.959 against 0.635 on generator-label test). Their micro precision is on par on test and lower on the unseen class (0.458 against 0.577 on generator and 0.517 against 0.639 on intervention labels), and their exact-set agreement is higher on unseen families (0.721 against 0.508 and 0.373 against 0.221) and on par on test and the unseen class. Over the 8 seeds, NeSySpec’s generator-label test macro-F1 spans 0.767 to 0.808 (sd 0.013) and its exact-set agreement 0.446 to 0.549, the network’s macro-F1 0.442 to 0.838; the intervals average the seeds. The network reports fewer false violations on clean-labeled and control records on test and on the unseen class (0.020 against 0.074 on generator-label test, 0.041 against 0.125 on the unseen class), and the crisp edits are on par in macro-F1 on generator-label test (exact-set agreement, macro-F1 and false-violation rate 0.5690.569, 0.8290.829 and 0.0360.036 against 0.5040.504, 0.7950.795 and 0.0740.074; macro-F1 −0.034-0.034 [−0.114-0.114, +0.075+0.075] · [−0.132-0.132, +0.064+0.064]) and below the constraint verdicts in macro-F1 on intervention-label unseen families (0.5690.569 against 0.6940.694, +0.125+0.125 [+0.053+0.053, +0.187+0.187] · +0.035+0.035, +0.186+0.186]); beyond the verdicts, NeSySpec also returns the altered field and a repair from the same degrees.

KnowledgeComparatorsInputOutputData
NoneIsolation Forest, Mahalanobis, MLP on normalized fieldsdeclared fieldserror scorerecords
LightGBM, XGBoost, CatBoost, TabPFN v2 on raw fieldsdeclared fields, availability mask, one-hot categorieserror scorerecords
Crisp rulestrain-fitted rule checker; rules with hierarchical poolingband exceedances of the residualsscore, violated rulesrecords
Classical diagnosisFellegi-Holt, first unsatisfiable core of Z3, MaxSMTcrisp constraintsviolated set, minimum-cardinality localizationrecords
Sizing statisticsClass I sizing regressions on maximum take-off mass, fitted on the training aircraftdeclared fieldslargest class-I residual, its fieldrecords
Residual learnersMLP, LightGBM, XGBoost, CatBoost, logistic regression, TabPFN v2, TabICL with its v2 checkpoint, local outlier factor, one-class SVM, autoencoder; class-standardized residual and its Ochiai ranking; SHAP attributionsphysical residuals with availabilityscore, attributionrecords
Differentiable logicDL2 method (network on declared fields, projected-gradient-descent (PGD) adversary); network with the DL2 loss and the per-constraint targets on the physical residualsdeclared fields; physical residuals with availabilityscore, per-constraint probabilitiesrecords
Knowledge in wordsQwen3-8B with the constraints A1-A11anonymized recordverdict, score, first violated constraintrecords
Localization lossesauxiliary localization loss and the matched ablations of the grounding axiomphotograph, pseudo-masks in trainingattribute heads, evidence mapsphotographs
Explanation supervisionRRR, GradMask, RES-L, Pukdee et al.photograph, part masks in trainingattribute heads, evidence mapsphotographs, human masks
Sequential pipelinecross-modal stratum (vision trained alone, axioms on its posteriors); independent concept-bottleneck model with LightGBMphotograph or crop with the recordmismatch scorephotographs, satellite pairs
Late fusionlogistic regression, LightGBM, CatBoost, TabPFN on the record alone, on the record with the visual posteriors, and on these with the image embeddings or with the knowledge-base truths; best fusion; monotone read-outrecord, visual posteriors, embeddings, knowledge-base truthspair scorephotographs, satellite pairs
End-to-end fusionAutoGluon-MM 1.6.3 (out of the box), TIP-style (re-implementation)raw crop and declared fieldspair scoresatellite pairs
Vision-language modelsQwen3-VL-8B, InternVL3.5-8B, Qwen3-VL-32B (4-bit NormalFloat, NF4); Qwen3-VL-8B with the rules R1-R10photograph with the declared specification; crop with the declared vector and the rulesverdict, scorephotographs, satellite pairs
ImputersMICE, missForest, nearest-neighbor imputationrecord with missing fieldsimputed valuesrecords
NeSySpec (ours)specification and remote-sensing axioms with graded predicates, grounding axiom, cross-modal axiomsdeclared record with availability mask; optional photograph or satellite cropverdict, per-constraint degrees (constraints respected and violated), evidence coverage and maps, largest-violation key, field localization, repair proposals, reportrecords, photographs, satellite pairs

Table F.1. Comparators.

SettingValue
Specification stratumgraded degrees in standard units of the clean training rows of each group, shrunk toward the fleet with weight ng/(ng+5)n_g/(n_g + 5); in-band grading; hierarchical banks; truth exp⁡(−vk)\exp(-v_k), degrees capped at 10410^4; masked mean verdict (p=1p = 1), V=ln⁡2V = \ln2 without available axioms; 336 trainable parameters, 126 of them bounded latents; chosen on validation among eight candidates with eight seeds each
Remote-sensing stratumsix graded slots (R1, R2 for civil and military roles, R3, R4, R10) in standard units of the clean training rows; R5 to R9 as the negative logarithm of their truth; masked weighted mean verdict (p=1p = 1); in-band grading; flat banks; 57 trained parameters; chosen on validation among eight candidates
Training of the strataAdamW [72], learning rate 5×10−35 \times10^{-3} multiplied by 5, that is 2.5×10−22.5 \times10^{-2}, for every trained parameter of a stratum (bands, tolerances, slopes, in-band weights, latents and the parameters of R5 and R6), weight decay 0, batch 256; at most 100 epochs, early stopping on validation AUROC with patience 15, best state restored; λaux=0.5\lambda_{\mathrm{aux}} = 0.5; seeds 0-7
Fusion of the strataweighted mean between strata with λR=λAX=1\lambda_R = \lambda_{AX} = 1; masked pp-mean error with p=4p = 4 inside the cross-modal stratum; Reichenbach implication (R7-R9, grounding axiom, photographic AX4, satellite AX5); axiom weight 1, except R9 and satellite AX5 (0.5)
Second headmonotone logistic regression on the degrees, the availabilities and the verdict (on satellite pairs VRV_R, the cross-modal truths and 1−feasAX1 - \mathrm{feas}_{AX}), inverse regularization in {10−4,…,103}\{10^{-4}, \ldots, 10^3\} and, on specification records, the inclusion of the verdict selected on validation AUROC; operating thresholds: maximum of Youden’s JJ [78] on validation
Abduction and repairsingle-field log changes on a grid from −3-3 to 3 in steps of 0.005; smallest-change rule; feasibility threshold 0.9 (V≤−ln⁡0.9≈0.1054V \leq-\ln0.9 \approx0.1054) for both; repair on the kr=1k_r = 1 top-ranked field by an augmented-Lagrangian method with Adam steps
Optional settingsrank-then-explain: residual MLP alarm at its validation Youden threshold; critical-field alert: undeclared fields required by an applicable axiom and declared by at least 95% of the training records of the class, or of the engine type for classes with fewer than five training records; MICE imputation: chosen among nine configurations on validation
PhotographsResNet-50 with ImageNet weights up to stage 3 (28×2828 \times28 grid at 448 pixels), 25 sigmoid heads, class-activation maps; bounding box enlarged by 10% per side, 448×448448 \times448 pixels; AdamW, learning rate 3×10−43 \times10^{-4} for heads and localization parameters and 3×10−53 \times10^{-5} for the backbone, weight decay 10−410^{-4}, gradient clipping at 5, batch 32, mixed precision; 20 fixed epochs without early stopping, checkpoint at the first epoch with the best validation macro head accuracy
GroundingλAV=1\lambda_{\mathrm{AV}} = 1; floor weight 0.1 and mass floor S0=1S_0 = 1; IoU with ℓk\ell_k initialized at 0.5 and κk\kappa_k at 10; visibility guard at 0.5 on the 0/1 visibility flag of each part (photographs: detector confidence at least 0.20, as in the pseudo-masks row; satellite crops: the annotated diamond)
Satellite cropsResNet-50, ConvNeXt-T and ViT-B/16 (token maps), ImageNet weights, last stage; grounding region: the annotated diamond; aircraft box enlarged by 15% per side, 224×224224 \times224 pixels; batch 64; at most 20 epochs, early stopping on the validation macro head AUROC with patience 6; other settings as for photographs
Pseudo-masksOWLv2 (base, patch 16, ensemble), boxes with score at least 0.15, up to 4 for engines and landing gear and 1 otherwise; SAM ViT-B on the kept boxes; visibility: detector confidence at least 0.20; dilation: maximum filter of radius 5 native pixels
Cross-modal axiomsphotographs: AX2 Mach cap 0.62 and slope 25; AX3 band edges at 10410^4, 105.0510^{5.05} and 105.510^{5.5} kg, slope 16
Baseline detectorsperceptron with two hidden layers of 64 units on the normalized fields and the mask (Adam, learning rate 10−310^{-3}, weight decay 10−510^{-5}, batch 256, at most 200 epochs, patience 20); Isolation Forest with 200 trees and Mahalanobis distance with Ledoit-Wolf covariance, both fitted on the clean training records

Table F.2. Configuration.

Diagnosis, Localization and Repair

From the same degrees, NeSySpec’s largest-violation key names the violated constraint in 0.942 of corrupted test records and in 0.897 ±\pm 0.007 on the unseen class, abduction finds the altered field in 0.742 ±\pm 0.011 of single-field test corruptions, and the repair proposal lowers the log-space error on the altered field from 0.366 to 0.133 (Table G.6, the generator-label levels behind Figure 6b and Figure 6c; Table G.5 gives the test levels of panel a). On unseen families the key, 0.973 on each seed, is above Fellegi-Holt (+0.174 [+0.051, +0.304] · [+0.074, +0.365]), Z3 (+0.174 [+0.047, +0.311] · [+0.101, +0.286]), MLP-SHAP (+0.077 [+0.020, +0.143] · [+0.018, +0.189]) and LightGBM-SHAP (+0.117 [+0.052, +0.184] · [+0.055, +0.163]) and on par with the class-standardized residual (+0.018); these unseen-family contrasts were not checked across the 20 alternative bootstrap streams. Class-I localization names the field of the largest residual of the Class I statistical sizing regressions on maximum take-off mass fitted on the training aircraft (the Class I sizing-regression residual of § 4.3). MLP-SHAP, the attribution of a second model on the residuals, ranks the violated constraint first more often on the unseen class (0.970), and MICE at the field of the class-I residual is on par with the repair on both errors (0.120 and 0.161); NeSySpec’s key, abduction and repair come with a held or violated verdict per constraint and the report. With 8 seed pairs instead of 5, the optional rank-then-explain

ComparatorDifference and intervalsComparatorDifference and intervals
Constraint diagnosis (top-1); NeSySpec returns the violated constraint from its own degrees, by the largest-violation keyDiagnosis on intervention labels (top-1), without retraining; NeSySpec returns the violated constraint by the same key
TestTest
NeSySpec’s second head+0.002 [−0.010, +0.018] ⋅ [−0.013, +0.011]+0.002\ [-0.010,\ +0.018]\ \cdot\ [-0.013,\ +0.011]Fellegi-Holt+0.180 [+0.126, +0.243] ⋅ [+0.135, +0.283]+0.180\ [+0.126,\ +0.243]\ \cdot\ [+0.135,\ +0.283]
Fellegi-Holt+0.147 [+0.068, +0.234] ⋅ [+0.079, +0.298]+0.147\ [+0.068,\ +0.234]\ \cdot\ [+0.079,\ +0.298]Z3+0.146 [+0.092, +0.214] ⋅ [+0.090, +0.231]+0.146\ [+0.092,\ +0.214]\ \cdot\ [+0.090,\ +0.231]
Z3+0.117 [+0.040, +0.209] ⋅ [+0.045, +0.256]+0.117\ [+0.040,\ +0.209]\ \cdot\ [+0.045,\ +0.256]Rule diagnosis+0.132 [+0.085, +0.181] ⋅ [+0.079, +0.182]+0.132\ [+0.085,\ +0.181]\ \cdot\ [+0.079,\ +0.182]
Rule diagnosis+0.085 [+0.027, +0.146] ⋅ [+0.023, +0.150]+0.085\ [+0.027,\ +0.146]\ \cdot\ [+0.023,\ +0.150]MLP-SHAP+0.074 [+0.022, +0.119] ⋅ [+0.005, +0.128]+0.074\ [+0.022,\ +0.119]\ \cdot\ [+0.005,\ +0.128]
LightGBM-SHAP+0.071 [+0.025, +0.118] ⋅ [+0.003, +0.098]+0.071\ [+0.025,\ +0.118]\ \cdot\ [+0.003,\ +0.098]Z3, records the crisp edits flag+0.074 [+0.001, +0.164] ⋅ [+0.004, +0.215]+0.074\ [+0.001,\ +0.164]\ \cdot\ [+0.004,\ +0.215]
DL2 method+0.499 [+0.455, +0.539] ⋅ [+0.428, +0.538]+0.499\ [+0.455,\ +0.539]\ \cdot\ [+0.428,\ +0.538]Rule diagnosis, same records+0.054 [−0.004, +0.115] ⋅ [−0.000, +0.156]+0.054\ [-0.004,\ +0.115]\ \cdot\ [-0.000,\ +0.156]
Qwen3-8Bᵃ+0.814 [+0.759, +0.868] ⋅ [+0.742, +0.875]+0.814\ [+0.759,\ +0.868]\ \cdot\ [+0.742,\ +0.875]LightGBM-SHAP+0.058 [−0.018, +0.129] ⋅ [−0.066, +0.126]+0.058\ [-0.018,\ +0.129]\ \cdot\ [-0.066,\ +0.126]
Class-standardized residual+0.013 [−0.020, +0.045] ⋅ [−0.019, +0.041]+0.013\ [-0.020,\ +0.045]\ \cdot\ [-0.019,\ +0.041]Class-standardized residual+0.096 [+0.043, +0.145] ⋅ [−0.014, +0.143]+0.096\ [+0.043,\ +0.145]\ \cdot\ [-0.014,\ +0.143]
MLP-SHAP+0.001 [−0.043, +0.043] ⋅ [−0.050, +0.028]+0.001\ [-0.043,\ +0.043]\ \cdot\ [-0.050,\ +0.028]Test, NeSySpec’s second head (its secondary key): the comparisons that the two keys read differently, a reading in plain words for either counting as different
Test, 81 records with one violated constraintMLP-SHAP+0.065 [+0.016, +0.108] ⋅ [−0.002, +0.115]+0.065\ [+0.016,\ +0.108]\ \cdot\ [-0.002,\ +0.115]
Fellegi-Holt+0.284 [+0.186, +0.387] ⋅ [+0.193, +0.476]+0.284\ [+0.186,\ +0.387]\ \cdot\ [+0.193,\ +0.476]Class-standardized residual+0.087 [+0.037, +0.131] ⋅ [−0.016, +0.128]+0.087\ [+0.037,\ +0.131]\ \cdot\ [-0.016,\ +0.128]
Z3+0.241 [+0.152, +0.335] ⋅ [+0.162, +0.398]+0.241\ [+0.152,\ +0.335]\ \cdot\ [+0.162,\ +0.398]Z3, records the crisp edits flag+0.070 [−0.003, +0.157] ⋅ [−0.001, +0.209]+0.070\ [-0.003,\ +0.157]\ \cdot\ [-0.001,\ +0.209]
Rule diagnosis+0.228 [+0.132, +0.329] ⋅ [+0.139, +0.391]+0.228\ [+0.132,\ +0.329]\ \cdot\ [+0.139,\ +0.391]Rule diagnosis, same records+0.050 [−0.008, +0.110] ⋅ [−0.006, +0.152]+0.050\ [-0.008,\ +0.110]\ \cdot\ [-0.006,\ +0.152]
LightGBM-SHAP+0.144 [+0.070, +0.220] ⋅ [+0.041, +0.195]+0.144\ [+0.070,\ +0.220]\ \cdot\ [+0.041,\ +0.195]Unseen families
Class-standardized residual+0.062 [+0.016, +0.105] ⋅ [+0.025, +0.104]+0.062\ [+0.016,\ +0.105]\ \cdot\ [+0.025,\ +0.104]NeSySpec’s second head−0.019 [−0.035, −0.006] ⋅ [−0.046, −0.006]-0.019\ [-0.035,\ -0.006]\ \cdot\ [-0.046,\ -0.006]
MLP-SHAP+0.046 [+0.005, +0.103] ⋅ [+0.009, +0.074]+0.046\ [+0.005,\ +0.103]\ \cdot\ [+0.009,\ +0.074]MLP-SHAP+0.101 [−0.057, +0.150] ⋅ [+0.057, +0.155]+0.101\ [-0.057,\ +0.150]\ \cdot\ [+0.057,\ +0.155]
Test, 140 records the crisp edits flagLightGBM-SHAP+0.024 [−0.031, +0.097] ⋅ [−0.033, +0.136]+0.024\ [-0.031,\ +0.097]\ \cdot\ [-0.033,\ +0.136]
Fellegi-Holt+0.083 [−0.019, +0.192] ⋅ [−0.016, +0.291]+0.083\ [-0.019,\ +0.192]\ \cdot\ [-0.016,\ +0.291]Class-standardized residual+0.068 [−0.0032, +0.138] ⋅ [−0.011, +0.174]+0.068\ [-0.0032,\ +0.138]\ \cdot\ [-0.011,\ +0.174]
Z3+0.050 [−0.045, +0.162] ⋅ [−0.041, +0.239]+0.050\ [-0.045,\ +0.162]\ \cdot\ [-0.041,\ +0.239]Rank-then-explain, flagged and correctly diagnosed (5 seed pairs); NeSySpec returns the violated constraint behind the residual MLP’s alarm
Rule diagnosis+0.014 [−0.057, +0.087] ⋅ [−0.053, +0.129]+0.014\ [-0.057,\ +0.087]\ \cdot\ [-0.053,\ +0.129]Test, against NeSySpec’s verdict with its own alarm and the same key (a declared sensitivity)
Unseen familiesFlagged and diagnosed−0.028 [−0.052, −0.006] ⋅ [−0.064, −0.013]-0.028\ [-0.052,\ -0.006]\ \cdot\ [-0.064,\ -0.013]
DL2 method+0.595 [+0.544, +0.643] ⋅ [+0.569, +0.656]+0.595\ [+0.544,\ +0.643]\ \cdot\ [+0.569,\ +0.656]False alarms, 32−0.094 [−0.2125, −0.0125] ⋅ [−0.256, 0.000]-0.094\ [-0.2125,\ -0.0125]\ \cdot\ [-0.256,\ 0.000]
Qwen3-8B+0.755 [+0.691, +0.827] ⋅ [+0.675, +0.817]+0.755\ [+0.691,\ +0.827]\ \cdot\ [+0.675,\ +0.817]Comparators behind the same alarm
Class-standardized residual+0.018 [−0.036, +0.073] ⋅ [−0.044, +0.100]+0.018\ [-0.036,\ +0.073]\ \cdot\ [-0.044,\ +0.100]Fellegi-Holt, test+0.132 [+0.060, +0.211] ⋅ [+0.066, +0.274]+0.132\ [+0.060,\ +0.211]\ \cdot\ [+0.066,\ +0.274]
Rule diagnosis+0.110 [+0.024, +0.190] ⋅ [0.000, +0.200]+0.110\ [+0.024,\ +0.190]\ \cdot\ [0.000,\ +0.200]Z3, test+0.101 [+0.031, +0.190] ⋅ [+0.028, +0.231]+0.101\ [+0.031,\ +0.190]\ \cdot\ [+0.028,\ +0.231]
Unseen classMLP-SHAP, test−0.009 [−0.047, +0.026] ⋅ [−0.061, +0.021]-0.009\ [-0.047,\ +0.026]\ \cdot\ [-0.061,\ +0.021]
NeSySpec’s second head+0.119 [+0.036, +0.219] ⋅ [+0.037, +0.221]+0.119\ [+0.036,\ +0.219]\ \cdot\ [+0.037,\ +0.221]MLP-SHAP, unseen class−0.041 [−0.098, +0.013] ⋅ [−0.098, +0.009]-0.041\ [-0.098,\ +0.013]\ \cdot\ [-0.098,\ +0.009]
Fellegi-Holt+0.228 [+0.152, +0.302] ⋅ [+0.154, +0.310]+0.228\ [+0.152,\ +0.302]\ \cdot\ [+0.154,\ +0.310]
Z3+0.119 [+0.083, +0.155] ⋅ [+0.085, +0.156]+0.119\ [+0.083,\ +0.155]\ \cdot\ [+0.085,\ +0.156]
Rule diagnosis+0.082 [+0.046, +0.121] ⋅ [+0.047, +0.124]+0.082\ [+0.046,\ +0.121]\ \cdot\ [+0.047,\ +0.124]
Class-standardized residual+0.231 [+0.151, +0.310] ⋅ [+0.156, +0.303]+0.231\ [+0.151,\ +0.310]\ \cdot\ [+0.156,\ +0.303]
DL2 method+0.599 [+0.529, +0.672] ⋅ [+0.529, +0.674]+0.599\ [+0.529,\ +0.672]\ \cdot\ [+0.529,\ +0.674]
Qwen3-8B+0.734 [+0.647, +0.816] ⋅ [+0.646, +0.815]+0.734\ [+0.647,\ +0.816]\ \cdot\ [+0.646,\ +0.815]
LightGBM-SHAP−0.032 [−0.081, +0.017] ⋅ [−0.081, +0.016]-0.032\ [-0.081,\ +0.017]\ \cdot\ [-0.081,\ +0.016]
MLP-SHAP−0.073 [−0.125, −0.023] ⋅ [−0.124, −0.025]-0.073\ [-0.125,\ -0.023]\ \cdot\ [-0.124,\ -0.025]
Unseen class, NeSySpec’s second head (its secondary key): the comparisons that the two keys read differently, a reading in plain words for either counting as different
Z3−0.000 [−0.085, +0.075] ⋅ [−0.084, +0.072]-0.000\ [-0.085,\ +0.075]\ \cdot\ [-0.084,\ +0.072]
Rule diagnosis−0.037 [−0.143, +0.054] ⋅ [−0.143, +0.051]-0.037\ [-0.143,\ +0.054]\ \cdot\ [-0.143,\ +0.051]
LightGBM-SHAP−0.152 [−0.283, −0.040] ⋅ [−0.285, −0.043]-0.152\ [-0.283,\ -0.040]\ \cdot\ [-0.285,\ -0.043]

Table G.1. Contrasts behind the body results: constraint diagnosis.

Difference: NeSySpec, in the setting named by the headings above the row, minus the comparator named by the row or by its heading (rank-then-explain minus the comparator in its block); for false alarms, repair errors are counted, where lower is better, a negative difference favors that setting. Intervals: 95% cluster-bootstrap percentiles at each of the two cluster levels, [aircraft] · [family] on specification records, [annotated aircraft] · [site] on satellite pairs and [image] · [variant] on photographs. Generator-oracle labels unless intervention labels are named; native NaN: TabPFN v2 with native missing values.

Qwen3-8B: the language model given the constraints in words, on anonymized records.

setting stays above Fellegi-Holt (+0.130) and Z3 (+0.100) behind the same alarm on test, on par with the class-standardized residual and below NeSySpec’s verdict with its own alarm and the same key (−0.028); strict abstention, which gives no diagnosis when no available degree exceeds ln 2, withdraws the diagnosis of 3 to 5 records per seed, none of them correctly diagnosed.

Missing Evidence

Masked quantification makes every verdict of NeSySpec a function of the available evidence alone: Figure 7 in Section 4.5 shows the exact reduction on specification records and satellite pairs and the unseen class with half the fields hidden, where the masked verdict (0.577) is ahead of the residual MLP and TabPFN v2 with native missing values and on par with LightGBM trained with masks (Table G.2). With 10% of the fields hidden in distribution, the MLP trained with masks ranks test records higher (−0.0425) and the residual MLP unseen-family records (−0.0925); both read every field, imputed or masked in training, while the masked verdict reads the declared evidence alone and states which constraints remain checkable. With no field hidden beyond those the records already leave undeclared, the masked verdict is ahead of MICE imputation of every missing field at scoring, by +0.051 [+0.031, +0.063] · [+0.031, +0.062] on test and +0.035 [+0.011, +0.062] · [+0.012, +0.064] on unseen Difference, intervals and notation as in Table G.1.

ComparatorDifference and intervals
Field localization (exact top-1); NeSySpec returns the altered field by abduction, the single-field change that restores consistency
Test
Minimum cardinality+0.375+0.375 [+0.286,+0.470]⋅[+0.293,+0.529][+0.286,+0.470] \cdot[+0.293,+0.529]
Ochiai ranking+0.339+0.339 [+0.234,+0.450]⋅[+0.246,+0.413][+0.234,+0.450] \cdot[+0.246,+0.413]
Largest class-I residual+0.145+0.145 [+0.065,+0.232]⋅[+0.071,+0.203][+0.065,+0.232] \cdot[+0.071,+0.203]
Same comparator, NeSySpec with the largest-feasibility rule a+0.095+0.095 [−0.006,+0.192]⋅[−0.020,+0.176][-0.006,+0.192] \cdot[-0.020,+0.176]
Oracle tie-break+0.113+0.113 [−0.033,+0.280]⋅[−0.028,+0.454][-0.033,+0.280] \cdot[-0.028,+0.454]
Unseen families
Minimum cardinality+0.359+0.359 [+0.241,+0.485]⋅[+0.241,+0.496][+0.241,+0.485] \cdot[+0.241,+0.496]
Ochiai ranking+0.179+0.179 [+0.041,+0.305]⋅[+0.029,+0.302][+0.041,+0.305] \cdot[+0.029,+0.302]
Oracle tie-break+0.065+0.065 [−0.125,+0.274]⋅[−0.089,+0.370][-0.125,+0.274] \cdot[-0.089,+0.370]
Largest class-I residual+0.043+0.043 [−0.041,+0.136]⋅[−0.018,+0.141][-0.041,+0.136] \cdot[-0.018,+0.141]
Unseen class
Minimum cardinality+0.360+0.360 [+0.254,+0.478]⋅[+0.257,+0.480][+0.254,+0.478] \cdot[+0.257,+0.480]
Largest class-I residual+0.526+0.526 [+0.394,+0.653]⋅[+0.380,+0.646][+0.394,+0.653] \cdot[+0.380,+0.646]
Ochiai ranking+0.344+0.344 [+0.220,+0.463]⋅[+0.225,+0.460][+0.220,+0.463] \cdot[+0.225,+0.460]
Oracle tie-break+0.163+0.163 [−0.002,+0.335]⋅[−0.003,+0.351][-0.002,+0.335] \cdot[-0.003,+0.351]
Intervention labels, without retraining, test
Minimum cardinality+0.287+0.287 [+0.220,+0.359]⋅[+0.238,+0.411][+0.220,+0.359] \cdot[+0.238,+0.411]
Same, records the crisp edits flag+0.248+0.248 [+0.153,+0.338]⋅[+0.164,+0.406][+0.153,+0.338] \cdot[+0.164,+0.406]
Oracle tie-break+0.140+0.140 [+0.041,+0.248]⋅[+0.041,+0.361][+0.041,+0.248] \cdot[+0.041,+0.361]
Largest class-I residual+0.140+0.140 [+0.073,+0.204]⋅[+0.068,+0.200][+0.073,+0.204] \cdot[+0.068,+0.200]
Repair (log-space error, test); NeSySpec returns a repair proposal from its own abduction and verdict
Error on the altered field
No repair−0.233-0.233 [−0.262,−0.204]⋅[−0.272,−0.214][-0.262,-0.204] \cdot[-0.272,-0.214]
MICE, class-I localization+0.013+0.013 [−0.022,+0.047]⋅[−0.033,+0.044][-0.022,+0.047] \cdot[-0.033,+0.044]
Regression, class-I localization−0.027-0.027 [−0.065,+0.008]⋅[−0.089,+0.004][-0.065,+0.008] \cdot[-0.089,+0.004]
missForest, class-I localization−0.028-0.028 [−0.068,+0.011]⋅[−0.085,+0.007][-0.068,+0.011] \cdot[-0.085,+0.007]
PiShield-style ordering, class-I localization−0.085-0.085 [−0.119,−0.049]⋅[−0.117,−0.049][-0.119,-0.049] \cdot[-0.117,-0.049]
Error on the whole record, class-I localization
Nearest neighbor−0.106-0.106 [−0.171,−0.046]⋅[−0.210,−0.050][-0.171,-0.046] \cdot[-0.210,-0.050]
Regression−0.082-0.082 [−0.142,−0.018]⋅[−0.186,−0.027][-0.142,-0.018] \cdot[-0.186,-0.027]
MICE+0.039+0.039 [−0.015,+0.099]⋅[−0.013,+0.112][-0.015,+0.099] \cdot[-0.013,+0.112]
missForest−0.037-0.037 [−0.102,+0.029]⋅[−0.133,+0.021][-0.102,+0.029] \cdot[-0.133,+0.021]
PiShield-style ordering−0.063-0.063 [−0.120,+0.001]⋅[−0.128,−0.013][-0.120,+0.001] \cdot[-0.128,-0.013]
Error on the whole record, other comparators
No repair−0.166-0.166 [−0.217,−0.107]⋅[−0.215,−0.110][-0.217,-0.107] \cdot[-0.215,-0.110]
Fellegi-Holt−0.114-0.114 [−0.176,−0.042]⋅[−0.163,−0.047][-0.176,-0.042] \cdot[-0.163,-0.047]
MaxSMT−0.108-0.108 [−0.170,−0.035]⋅[−0.175,−0.042][-0.170,-0.035] \cdot[-0.175,-0.042]
MICE, Fellegi-Holt localization−0.151-0.151 [−0.378,−0.001]⋅[−0.497,+0.024][-0.378,-0.001] \cdot[-0.497,+0.024]
Fields hidden at random (AUROC); NeSySpec returns its verdict on the available constraints and lists the unchecked ones
Unseen class, half of the fields hidden
Residual MLP+0.0410+0.0410 [+0.0085,+0.0738]⋅[+0.0074,+0.0734][+0.0085,+0.0738] \cdot[+0.0074,+0.0734]
TabPFN v2, native NaN+0.0382+0.0382 [+0.0047,+0.0736]⋅[+0.0060,+0.0735][+0.0047,+0.0736] \cdot[+0.0060,+0.0735]
LightGBM trained with masks+0.0113+0.0113 [−0.0366,+0.0655]⋅[−0.0387,+0.0704][-0.0366,+0.0655] \cdot[-0.0387,+0.0704]
10% of the fields hidden−0.0425-0.0425 [−0.0705,−0.0168]⋅[−0.0627,−0.0038][-0.0705,-0.0168] \cdot[-0.0627,-0.0038]
MLP trained with masks, test−0.0925-0.0925 [−0.1266,−0.0635]⋅[−0.1320,−0.0507][-0.1266,-0.0635] \cdot[-0.1320,-0.0507]
Satellite images hidden or from another sensor (AUROC), test b; NeSySpec returns the fused verdict, the record verdict bit for bit when the image is hidden
30% of the images hidden
CatBoost on knowledge-base truths−0.031-0.031 [−0.043,−0.020]⋅[−0.042,−0.015][-0.043,-0.020] \cdot[-0.042,-0.015]
Read-out trained with modality dropout−0.026-0.026 [−0.036,−0.018]⋅[−0.036,−0.012][-0.036,-0.018] \cdot[-0.036,-0.012]
Visual stratum trained on ground photographs, scoring satellite crops
Record verdict alone−0.071-0.071 [−0.094,−0.052]⋅[−0.103,−0.039][-0.094,-0.052] \cdot[-0.103,-0.039]

Table G.2. Contrasts behind the body results: field localization, repair and missing evidence.

a Abduction with the largest-feasibility rule, a sensitivity not selected on validation; with the nearest threshold of the selected rule, both intervals of the difference from the class-I residual stay above zero.

b The comparators were not retrained or retuned, and those on knowledge-base truths keep the truths of the saturating-envelope variant of the remote-sensing stratum they were fitted on (Appendix G.5).

families, and ahead of global means at scoring on every split (+0.147+0.147, +0.121+0.121 and +0.164+0.164). With fields hidden on unseen families, MICE at scoring ranks higher, with differences of −0.055-0.055 [−0.081,−0.029]⋅[−0.088,−0.030][-0.081,-0.029] \cdot[-0.088,-0.030], −0.103-0.103 [−0.130,−0.078]⋅[−0.139,−0.084][-0.130,-0.078] \cdot[-0.139,-0.084] and −0.113-0.113 [−0.140,−0.087]⋅[−0.155,−0.096][-0.140,-0.087] \cdot[-0.155,-0.096] with 10, 20 and 30% of the fields hidden; MICE fills the values that the masked verdict leaves unread, and the report lists the constraints that remain checkable. With MICE imputation enabled, an optional setting of NeSySpec in place of exact masking (§ 4.5), the verdict is on par with the MLP trained with masks given the same imputer, +0.0089+0.0089 [−0.0039,+0.0230]⋅[−0.0037,+0.0349][-0.0039,+0.0230] \cdot[-0.0037,+0.0349] on test with 10% of the fields hidden.

Record Coherence

NeSySpec’s record verdict reaches a test AUROC of 0.979±0.0020.979 \pm0.002 on generator labels, from 0.9370.937 on cruise to 1.0001.000 on geometric corruptions by corruption type, each type scored against the 48 clean-labeled test records (16 clean records and their 32 noisy-but-coherent copies; means of 8 seeds), and each of its flags names the violated constraint, the altered field and a repair proposal. Table G.7 groups the detectors of Section 4.4 by the knowledge they receive, with what each returns. On test the

ComparatorDifference and intervals
Record coherence (AUROC); NeSySpec returns its verdict, each flag with the violated constraint, field and repair
Test, learners on the raw fields
CatBoost+0.187 [+0.114, +0.259] · [+0.094, +0.335]
TabPFN v2+0.197 [+0.118, +0.266] · [+0.105, +0.320]
XGBoost+0.205 [+0.119, +0.280] · [+0.109, +0.334]
LightGBM+0.231 [+0.136, +0.315] · [+0.119, +0.395]
Test, other detectors
Rules with pooling+0.075 [+0.039, +0.115] · [+0.041, +0.132]
Train-fitted rule checker+0.151 [+0.101, +0.172] · [+0.083, +0.165]
Mahalanobis+0.186 [+0.132, +0.241] · [+0.136, +0.269]
DL2 method+0.276 [+0.223, +0.322] · [+0.224, +0.353]
Qwen3-8B+0.359 [+0.275, +0.437] · [+0.296, +0.427]
Test, learners on the residuals
MLP−0.010 [−0.022, +0.002] · [−0.017, +0.002]
TabPFN v2+0.021 [−0.008, +0.069] · [−0.011, +0.037]
One-class SVM+0.022 [+0.0003, +0.039] · [−0.0001, +0.043]
LightGBM+0.023 [+0.0003, +0.046] · [−0.0004, +0.034]
Unseen families
Train-fitted rule checker+0.090 [+0.043, +0.121] · [+0.014, +0.109]
DL2 method+0.296 [+0.244, +0.345] · [+0.241, +0.395]
Qwen3-8B+0.254 [+0.204, +0.305] · [+0.188, +0.332]
MLP−0.008 [−0.019, +0.0002] · [−0.017, +0.001]
TabPFN v2, fields and residuals−0.009 [−0.021, +0.0001] · [−0.019, +0.0002]
Unseen class, other detectors
DL2 method+0.355 [+0.312, +0.394] · [+0.326, +0.383]
Qwen3-8B+0.266 [+0.181, +0.356] · [+0.176, +0.347]
Unseen class, learners on the residuals
MLP−0.045 [−0.074, −0.005] · [−0.075, −0.004]
TabPFN v2−0.050 [−0.080, −0.015] · [−0.083, −0.013]
TabPFN v2, native−0.051 [−0.075, −0.021] · [−0.077, −0.019]
TabICL−0.046 [−0.078, −0.011] · [−0.080, −0.009]
TabPFN v2, fields and residuals−0.044 [−0.075, −0.007] · [−0.079, −0.005]
NeSySpec and the comparators retrained on intervention labels (AUROC), test; NeSySpec (0.807) returns its verdict with the per-constraint degrees
Residual MLP−0.053 [−0.084, −0.028] · [−0.105, −0.033]
TabPFN v2, native NaNᵃ−0.078 [−0.114, −0.047] · [−0.119, −0.062]
TabPFN v2, imputedᵃ−0.081 [−0.121, −0.048] · [−0.145, −0.060]

Table G.3. Contrasts behind the body results: record coherence.

ComparatorDifference and intervals
False alarms on the 32 controls at a TPR of 0.90, testᵇ; each alarm of NeSySpec names the constraint that raised it or, with the alert, the undeclared critical field
NeSySpec’s verdict
Mahalanobis−0.570 [−0.844, −0.384] · [−0.792, −0.385]
Rules with pooling−0.244 [−0.500, −0.031] · [−0.620, −0.056]
Z3 edit count−0.244 [−0.491, −0.062] · [−0.544, −0.093]
Fellegi-Holt−0.244 [−0.482, −0.008] · [−0.569, −0.050]
Residual MLP+0.078 [0.000, +0.188] · [0.000, +0.113]
NeSySpec with the critical-field alertᶜ
NeSySpec’s verdict+0.062 [0.000, +0.188] · [0.000, +0.250]
Mahalanobis−0.508 [−0.812, −0.306] · [−0.767, −0.264]
Z3 edit count−0.181 [−0.444, −0.006] · [−0.492, −0.009]
Rules with pooling−0.181 [−0.444, +0.062] · [−0.545, +0.111]
Fellegi-Holt−0.181 [−0.437, +0.033] · [−0.486, +0.008]
Residual MLP+0.141 [0.000, +0.301] · [0.000, +0.278]
Satellite pairs (AUROC)ᵈ; NeSySpec returns the fused verdict and names the cross-modal axiom the image contradicts
NeSySpec’s fused verdict, ResNet-50
AutoGluon-MM, test+0.165 [+0.137, +0.194] · [+0.132, +0.197]
AutoGluon-MM, unseen sites+0.110 [+0.090, +0.132] · [+0.098, +0.144]
TIP-style, test+0.067 [+0.046, +0.086] · [+0.055, +0.081]
TIP-style, unseen sites+0.048 [+0.032, +0.064] · [+0.035, +0.086]
NeSySpec’s multimodal verifier and Qwen3-VL-8B given the rules
ConvNeXt-T, test+0.247 [+0.208, +0.286] · [+0.201, +0.283]
ConvNeXt-T, unseen sites+0.324 [+0.287, +0.362] · [+0.200, +0.356]
ResNet-50, test+0.241 [+0.202, +0.280] · [+0.196, +0.279]
ViT-B/16, test+0.242 [+0.204, +0.281] · [+0.197, +0.277]
NeSySpec’s fused verdict, test image swaps
Late fusion trained with swaps−0.012 [−0.026, −0.003] · [−0.018, −0.004]
Record verdict alone and Qwen3-VL-8B given the rules
Test+0.048 [−0.009, +0.103] · [−0.009, +0.094]
Photographs (AUROC), cross-modal stratum; NeSySpec returns the contradicted axiom with the part map of its evidence
Qwen3-VL-8B, test+0.025 [−0.010, +0.058] · [−0.046, +0.098]
InternVL3.5-8B, test+0.032 [−0.002, +0.067] · [−0.033, +0.086]
Qwen3-VL-32B, test−0.020 [−0.055, +0.016] · [−0.073, +0.042]
Qwen3-VL-32B, unseen families−0.094 [−0.131, −0.058] · [−0.154, −0.056]

Table 8.

Difference, intervals and notation as in Table G.1; Table G.8 gives the ablation and the same residuals in other models.

Its preprocessing statistics include the scored rows.

ᵇ Ties at the threshold interpolated; counting every tie, NeSySpec with the critical-field alert differs by −0.852 from the pooled rules [−0.992, +0.062] · [−0.955, +0.111], Fellegi-Holt [−0.992, +0.031] · [−0.955, 0.000] and the Z3 count [−0.992, −0.039] · [−0.955, −0.067].

ᶜ NeSySpec’s optional critical-field alert: a record is flagged when the verdict or the alert fires (Table G.7, note g).

ᵈ The comparators were not retrained or retuned, and those on knowledge-base truths keep the truths of the saturating-envelope variant of the remote-sensing stratum they were fitted on (Appendix G.5).

ComparatorDifference and intervals
Black-box attacks (evasion); NeSySpec returns its verdict, each flag with the field found by abduction and a repair proposal
Cover-ups, up to five further edits
Residual MLP−0.064 [−0.073, −0.055] · [−0.075, −0.053]
Residual TabPFN v2−0.059 [−0.071, −0.046] · [−0.072, −0.043]
Residual one-class SVM−0.062 [−0.077, −0.048] · [−0.081, −0.043]
Raw-field LightGBM−0.065 [−0.075, −0.055] · [−0.076, −0.055]
Isolation Forest−0.049 [−0.064, −0.035] · [−0.064, −0.028]
Rules with pooling+0.004 [−0.004, +0.013] · [−0.005, +0.013]
Mahalanobis+0.010 [−0.0033, +0.025] ·
[−0.005, +0.028]
Bare lies
Rules with pooling−0.113 [−0.143, −0.084] · [−0.149, −0.064]
Raw-field LightGBM−0.169 [−0.208, −0.130] · [−0.205, −0.121]
Residual MLP−0.016 [−0.052, −0.023] · [−0.064, −0.052]
Residual LightGBM+0.052 [+0.009, +0.096] · [+0.005, +0.115]
Residual TabPFN v2+0.105 [+0.058, +0.155] · [+0.056, +0.176]

Table G.4. Contrasts behind the body results: deliberate falsification.

ComparatorDifference and intervals
Omissions of up to two fields (evasion); NeSySpec returns its verdict and lists each undeclared field with the constraints it leaves unchecked
Residual MLP+0.026 [+0.014, +0.039] · [+0.012, +0.044]
Residual one-class SVM+0.143 [+0.103, +0.184] · [+0.103, +0.200]
Mahalanobis+0.119 [+0.071, +0.178] · [+0.069, +0.196]
Omissions of up to two fields, attacker aware of the alert, NeSySpec with the critical-field alertᵃ; each flag names the undeclared critical field
Comparators with the same alert, all splits
Residual MLP−0.027 [−0.064, +0.014] · [−0.073, +0.046]
Residual one-class SVM+0.019 [−0.035, +0.073] · [−0.058, +0.104]
Residual MLP with the same alert, per split
Unseen families−0.074 [−0.103, −0.043] · [−0.099, −0.008]
Unseen class+0.125 [+0.060, +0.197] · [+0.060, +0.197]

Table 9.

Difference, intervals and notation as in Table G.1.

ᵃ NeSySpec’s optional critical-field alert: a record is flagged when the verdict or the alert fires (Table G.7, note g).

ReadingGenerator-oracle labelsIntervention labels
Differentiable logic: a probability per constraint
Network with the DL2 loss on the same residuals0.474/0.661/0.0200.222/0.426/0.019
same network, thresholds tuned on validation0.436/0.746/0.0560.218/0.541/0.056
DL2 method on the declared fields0.106/0.425/0.1400.048/0.259/0.141
same method, thresholds tuned on validation0.053/0.484/0.2160.015/0.319/0.214
Crisp rules and edits: a crisp violated set
Crisp edits (Fellegi-Holt, Z3), small classes pooled0.569/0.829/0.0360.212/0.505/0.036
Rule checker, per-class bands, small classes not pooled0.103/0.691/0.2430.049/0.494/0.252
Residual statistics: a z-score per residual
Class-standardized residual, threshold on specification validation0.446/0.714/0.0690.194/0.480/0.078
same residual, threshold on intervention validation-0.138/0.560/0.174
Knowledge in words: a judgment with the constraints it lists
Language model given the constraints in words0.113/0.153/0.140-
same model, read only when it calls a record incoherent0.235/0.065/0.000-
NeSySpec, graded degree and held or violated verdict per constraint0.504/0.795/0.0740.283/0.575/0.084

Table G.5. Constraint verdicts against per-constraint labels on test.

Test split. Generator-oracle labels follow the axioms’ relations and were the per-constraint training targets; intervention labels, set from the edit alone, are independent of them. Each cell: exact-set agreement / macro-F1 / false-violation rate (lower is better); - not measured. Intervention labels mark every available constraint whose scope contains a field moved beyond tolerance; their false-violation rate is computed on unaltered records and their noisy-but-coherent copies; on records edited only within tolerance, which these labels also count as unaltered, it is 0.119 for NeSySpec, 0.063 for the DL2-loss network and 0.087 for the crisp edits. The ablation trained with the binary record label only, without per-constraint targets, reaches 0.081/0.634/0.194 with generator-oracle labels (§ 4.8).

record verdict is on par with TabPFN v2 and close to the residual MLP, LightGBM and the one-class SVM on the residuals and ahead of the learners on the raw fields, the rule checkers, the Mahalanobis distance, the DL2 method and the language model (Table G.3). On the unseen class five learners on the residuals rank higher in record-level detection (residual MLP 0.978, TabPFN v2 up to 0.984); there, with NeSySpec’s optional rank-then-explain setting, the residual MLP raises the alarm and NeSySpec explains it with the violated constraint, the altered field and a repair, flagging and correctly diagnosing 0.849±0.0430.849 \pm0.043 of the corrupted unseen-class records (Table G.6).

Against intervention labels the record verdict reaches 0.701, 0.750 and 0.719 on test, unseen families and the unseen class, without retraining, while the generator oracle itself, with its bands on all 107 aircraft, reaches 0.676, 0.709 and 0.714 on the same labels. These labels count as incoherent the 613 altered rows that break no constraint under those bands, and as coherent the edits within tolerance, some of which do break one. With only the clean records and their noisy copies as negatives, the verdict reaches 0.840, 0.847 and 0.811. On the altered rows that break no constraint, scored against all clean rows, it stays below chance (0.394, 0.449 and 0.439), as the comparators that use the physics do on the pooled held-out splits.

Records with Images

Without an image, NeSySpec’s fused verdict equals the record verdict bit for bit in 9 of 9 satellite cells, against 0 of 207 learned methods and cell rows, and its second head with ConvNeXt-T (8 seeds) reaches 0.998±0.0010.998 \pm0.001 on test and 0.991±0.0030.991 \pm0.003 on unseen sites over all pair types. On the satellite pairs of § 4.4, the best learned comparators rank the pairs higher after learning from labeled pairs: CatBoost on knowledge-base truths on test swaps, TabPFN on visual posteriors and image embeddings on unseen-site swaps, and late fusions on knowledge-base truths over all pair types on unseen sites (nine runs of three backbones). Learned heads also rank the pairs higher in the contrasts of Tables G.2 and G.3, where NeSySpec’s fused verdict differs by −0.012-0.012 from the late fusion trained with swaps on test swaps and by −0.031-0.031 from CatBoost on knowledge-base truths with 30% of the images hidden. The fused verdict, instead, aggregates NeSySpec’s strata without labels and names the contradicted axiom; on photographs, Qwen3-VL-32B ranks unseen-family pairs higher than the cross-modal stratum (−0.094-0.094). With 30% of satellite images hidden, the fused verdict (0.947) keeps the exact reduction; the read-out trained with modality dropout ranks the pairs at 0.973 without keeping it. When a visual

Constraint diagnosis, top-1 on corrupted recordsTestUnseen familiesUnseen class
MLP-SHAP on residuals0.9420.8950.970
Class-standardized residual0.9290.9550.667
LightGBM-SHAP on residuals0.8710.8560.930
Rule diagnosis, rules ranked by exceedance0.8570.8630.815
Z3, first unsatisfiable core0.8250.7990.778
Fellegi-Holt, complete violated set0.7950.7990.670
DL2 method, declared fields0.4430.3770.298
Language model, constraints in words0.1280.2180.163
Chance0.1770.1660.152
NeSySpec, second head (secondary key)0.940±0.0050.940 \pm0.0050.9730.778±0.0640.778 \pm0.064
NeSySpec (ours), largest-violation key0.9420.9730.897±0.0070.897 \pm0.007
Field localization, top-1 on single-field corruptionsTestUnseen familiesUnseen class
Minimum cardinality, oracle tie-break0.6290.6700.481
Minimum cardinality, random tie-break0.3670.3770.284
Minimum cardinality, worst tie-break0.2100.2050.156
Largest class-I residual0.5970.6930.119
Class-standardized residual with Ochiai0.4030.5570.300
Chance0.0770.0760.079
NeSySpec (ours), abduction0.742±0.0110.742 \pm0.0110.736±0.0100.736 \pm0.0100.644±0.0140.644 \pm0.014
Repair on test records, lower is betterAltered fieldRecordClean records changed
MICE, class-I localization0.1200.1610.917
MICE, class-I localization and detection gate0.1550.1620.271
Class-I regression, class-I localization0.1600.2821.000
missForest, class-I localization0.1610.2381.000
MICE, Fellegi-Holt localization0.2110.3520.312
Class-I PiShield-style ordering0.2180.2640.250
Fellegi-Holt, all optimal solutions0.2410.3140.250
No repair0.3660.3660.000
NeSySpec (ours), repair proposal0.133±0.0020.133 \pm0.0020.200±0.0020.200 \pm0.0020.562±0.0330.562 \pm0.033
Flagged and correctly diagnosed, corrupted recordsTestUnseen familiesUnseen class
Residual-MLP alarm, explained by (with NeSySpec’s key: its optional rank-then-explain setting)
MLP-SHAP0.9100.8580.890
Class-standardized residual0.8950.8780.661
Rule diagnosis, rules ranked by exceedance0.8320.8060.791
Z30.8000.7430.759
Fellegi-Holt0.7700.7380.648
NeSySpec, second head (secondary key)0.900±0.0110.900 \pm0.0110.875±0.0150.875 \pm0.0150.732±0.0530.732 \pm0.053
NeSySpec (ours), largest-violation key0.901±0.0130.901 \pm0.0130.875±0.0150.875 \pm0.0150.849±0.0430.849 \pm0.043
NeSySpec’s own alarm, explained by its largest-violation key
NeSySpec with the critical-field alert0.9290.925±0.0160.925 \pm0.0160.871±0.0070.871 \pm0.007
NeSySpec’s verdict (ours)0.9290.925±0.0160.925 \pm0.0160.864±0.0080.864 \pm0.008

Table G.6. Diagnosis, localization and repair.

Generator-oracle labels, train prior; comparators as in Table F.1; top-1 rates count tied candidates at their expected value under random tie-breaking. Rows of NeSySpec: mean ±\pm sd over 8 seeds (in the last block 5 seed pairs, the seeds 0 to 4 for which MLP-SHAP was computed), without ±\pm where every degree agrees; comparator rows: mean over their seeds. Every row of NeSySpec reads the same degrees, which also give the held or violated verdict per constraint and the report.

Largest-violation key: the available constraint with the largest violation degree, selected on held-out training classes. Second head: the monotone read-out on the degrees, kept as the secondary key. SHAP: grouped exact Shapley values of the residual model, one group per constraint. Oracle and worst tie-break: ties among the optimal localizations broken toward and away from the altered field. Repair errors, on single-field corruptions: log-space error of the altered field, plus the change of the correct fields for the record; clean records changed: share of the 48 clean and control test records. Class-I PiShield-style ordering: sequential projection onto the crisp constraints, fields in ascending order of their class-I residual. Detection gate: imputation only on the records that the class-I residual flags, a residual outside its 95% prediction interval. Residual-MLP alarm and own alarm: the residual MLP or the verdict at its validation threshold; with the alert, the verdict or NeSySpec’s optional critical-field alert.

stratum trained on ground photographs scores satellite crops, the record verdict alone (0.796) is the fallback across sensors without labels: the fused verdict reaches 0.724 and an out-of-domain abstention restores the record level, while the fusion selected with satellite labels reaches 0.786 and a refit trained on satellite labels, a reference with privileged access to them, reaches 0.979. Fitted on specification records and applied without satellite training through the shared axioms R2 to R4 (Appendix § 12.§ 1), the knowledge base reaches 0.767±0.0070.767 \pm0.007 on satellite test annotations and 0.764±0.0080.764 \pm0.008 on unseen sites, against 0.796 and 0.812 for the remote-sensing record verdict trained on these annotations; fitted on satellite annotations and applied to specification records, it reaches 0.541±0.0030.541 \pm0.003 (8 seeds, no interval); the military roles, absent from the records, keep their prior bands. Comparators on satellite pairs

DetectorTestUnseen familiesUnseen classFPR, controls
Learners on the physical residuals: score; the network with the DL2 loss also a probability per constraint
MLP0.990 ±\pm 0.0030.999 ±\pm 0.0010.978 ±\pm 0.0110.008
TabPFN v20.958 ±\pm 0.0060.999 ±\pm 0.0010.983 ±\pm 0.006-
TabPFN v2, native missing values0.957 ±\pm 0.0090.999 ±\pm 0.0010.984 ±\pm 0.006-
TabPFN v2, raw fields and residuals10.965 ±\pm 0.0071.000 ±\pm 0.0000.978 ±\pm 0.006-
TabICL0.953 ±\pm 0.0030.996 ±\pm 0.0010.979 ±\pm 0.005-
LightGBM0.957 ±\pm 0.0040.993 ±\pm 0.0020.904 ±\pm 0.006-
XGBoost, CatBoost and logistic regression0.893–0.9580.988–0.9920.876–0.930-
Learners on raw fields and residuals10.897–0.9550.975–0.9970.881–0.905-
Network with the DL2 loss0.965 ±\pm 0.021-0.921 ±\pm 0.018-
One-class SVM, label-free0.9580.9690.901-
Local outlier factor and autoencoder, label-free0.893–0.9400.919–0.9520.462–0.917-
Crisp rules on the knowledge base: score and crisp violated set
Rules with hierarchical pooling30.9040.9330.92420.3304
Z3 violated-edit count30.8670.8680.8250.3304
Fellegi-Holt30.8560.8670.7570.3304
Rule checker, train-fitted bands0.8280.9010.9242-
Knowledge in other forms: score with a probability per constraint (DL2 method) or a judgment (language model)
DL2 method, declared fields0.703 ±\pm 0.030-0.579 ±\pm 0.027-
Language model (Qwen3-8B), constraints in words0.6200.7370.667-
Knowledge-free: error score
Mahalanobis distance0.7930.7390.6160.656
Learners on raw fields10.748–0.7920.834–0.8630.505–0.641-
MLP on normalized fields0.711 ±\pm 0.0400.713 ±\pm 0.0370.537 ±\pm 0.021-
Isolation Forest0.576 ±\pm 0.0220.542 ±\pm 0.0160.525 ±\pm 0.028-
NeSySpec, Logic Tensor Network: score, verdict per constraint, key, altered field, repair and report
Saturating-envelope ablation80.821 ±\pm 0.0080.883 ±\pm 0.0050.898 ±\pm 0.0040.363
Textbook prior (sensitivity)90.977 ±\pm 0.0030.988 ±\pm 0.0010.929 ±\pm 0.0020.062
NeSySpec, second head0.976 ±\pm 0.0020.993 ±\pm 0.0020.822 ±\pm 0.043-
NeSySpec with the critical-field alert10---0.148
NeSySpec’s verdict (ours)0.979 ±\pm 0.0020.991 ±\pm 0.0020.934 ±\pm 0.0010.086

Table G.7. Detection.

AUROC on generator-oracle labels, mean ±\pm sd over seeds where a method has several; a range gives the lowest and highest mean of the detectors of its row. FPR, controls: false-positive rate on the 32 noisy-but-coherent test controls at a true-positive rate of 0.90, mean over seeds. A cell marked - is not reported; in the alert row, the AUROC is the verdict’s (note g).

were not retrained or retuned, and those that read knowledge-base truths (CatBoost and TabPFN on knowledge-base truths, the best fusion and the fusion selected without satellite labels) keep the truths of the saturating-envelope variant of the remote-sensing stratum they were fitted on (the specification-record row of this ablation is in Table G.8). NeSySpec’s graded remote-sensing stratum was selected on validation among eight candidate configurations; it trains with per-constraint targets that the end-to-end, fusion and vision-language comparators do not receive, and its validation split serves both early stopping and the choice of configuration.

Ablation or modelTest AUROCTest DifferenceUnseen families AUROCUnseen families DifferenceUnseen class AUROCUnseen class Difference
Ablations of NeSySpec on specification records, generator-oracle labels, train prior; intervals [aircraft] · [family]
Saturating envelopes (bounded envelope truths)0.821 [+$0.073,+, +0.223][+] [+0.022,+, +0.196$]+0.1580.883 [+$0.031,+, +0.163][+] [+0.014,+, +0.123$]+0.1080.898 [+$0.0031,+, +0.062][+] [+0.005,+, +0.067$]+0.035
Generalized mean, p=4p = 4, instead of the mean degree0.983 [−$0.020,+, +0.013][−] [-0.008,+, +0.004$]−0.0040.980 [−$0.004,+, +0.041][−] [-0.004,+, +0.065$]+0.0110.940 [−$0.016,+, +0.006][−] [-0.015,+, +0.006$]−0.006
Without in-band grading0.970 [+$0.002,+, +0.017][+] [+0.0003,+, +0.015$]+0.0090.977 [+$0.0012,+, +0.039][+] [+0.0010,+, +0.052$]+0.0140.908 [+$0.014,+, +0.036][+] [+0.014,+, +0.036$]+0.025
Flat banks instead of hierarchical banks0.965 [+$0.004,+, +0.026][+] [+0.0031,+, +0.023$]+0.0150.960 [+$0.006,+, +0.065][+] [+0.009,+, +0.090$]+0.0310.915 [+$0.008,+, +0.030][+] [+0.008,+, +0.031$]+0.019
Binary label alone, without per-constraint targets0.964 [+$0.005,+, +0.026][+] [+0.0028,+, +0.023$]+0.0150.974 [+$0.0019,+, +0.046][+] [+0.0028,+, +0.060$]+0.0170.921 [+$0.0024,+, +0.023][+] [+0.0025,+, +0.024$]+0.012
Textbook prior instead of the train prior0.977 [−$0.004,+, +0.009][−] [-0.009,+, +0.007$]+0.0020.988 [−$0.003,+, +0.016][−] [-0.0019,+, +0.010$]+0.0030.929 [−$0.018,+, +0.027][−] [-0.018,+, +0.025$]+0.004
Knowledge base at its initial values, untrained0.907 [+$0.045,+, +0.091][+] [+0.035,+, +0.089$]+0.0730.930 [+$0.015,+, +0.106][+] [+0.009,+, +0.118$]+0.0610.845 [+$0.058,+, +0.109][+] [+0.056,+, +0.111$]+0.088
Neural predicates, learned monotone functions0.984 [−$0.022,+, +0.010][−] [-0.011,+, +0.0018$]−0.0050.991 [−$0.008,+, +0.012][−] [-0.0028,+, +0.017$]+0.00040.958 [−0.0430.043, −0.00090.0009] [−0.0440.044, −0.00180.0018]−0.024
Learners on the same physical residuals, generator-oracle labels; intervals [aircraft] · [family]
Monotone model on the residual magnitudes, without LTN0.966 [−$0.0019,+, +0.029][−] [-0.007,+, +0.023$]+0.0130.993 [−$0.013,+, +0.006][−] [-0.011,+, +0.006$]−0.0020.921 [−$0.019,+, +0.042][−] [-0.023,+, +0.042$]+0.012
Network with the DL2 loss on the residuals0.965 [+$0.0028,+, +0.026][+] [+0.004,+, +0.025$]+0.014--0.921 [−$0.010,+, +0.039][−] [-0.011,+, +0.039$]+0.013
TabPFN v20.958 [−$0.008,+, +0.069][−] [-0.011,+, +0.037$]+0.0210.999 [−$0.020,+, +0.0003][−] [-0.017,+, +0.0002$]−0.0080.983 [−0.0800.080, −0.0150.015] [−0.0830.083, −0.0130.013]−0.050
MLP0.990 [−$0.022,+, +0.002][−] [-0.017,+, +0.002$]−0.0100.999 [−$0.0185,+, +0.0002][−] [-0.0170,+, +0.0014$]−0.00760.978 [−0.0740.074, −0.0050.005] [−0.0750.075, −0.0040.004]−0.045
NeSySpec’s verdict (ours), full model0.9790.9910.934
Satellite pairs, ablations of NeSySpec’s fused verdict; intervals [annotated aircraft] · [site]
Single masked quantifier, 30% of images withheld-−0.002 [−$0.0064,+, +0.0014][−] [-0.0050,+, +0.0035$]-−0.008 [−0.01170.0117, −0.00460.0046] [−0.00860.0086, −0.00450.0045]
Single masked quantifier, all images0.995 [−0.00970.0097, −0.00020.0002] [−0.00680.0068, +0.00020.0002]−0.0040.992 [−0.02010.0201, −0.00730.0073] [−0.01470.0147, −0.00580.0058]−0.013
Kleene-Dienes implication, max⁡(1−a,b)\max(1-a,b) [21], instead of Reichenbach0.991 [−0.00001370.0000137, 0] [−0.00001180.0000118, 0]−0.0000320.979 [−0.00003470.0000347, −0.00000080.0000008] [−0.00003380.0000338, 0]−0.0000158
NeSySpec’s fused verdict (ours), all images0.9910.979

Table G.8. Ablation study.

AUROC: mean over 8 seeds, one model for the knowledge base at its initial values and for the monotone model; on satellite pairs nine runs, three backbones with three seeds each; with 30% of images withheld, differences only, from the three ResNet-50 runs with 20 random image masks each, masks that differ from those behind the 30% levels of Section 4.5. Difference: NeSySpec’s verdict, on satellite pairs its fused verdict on the same images, minus the row, so a positive difference favors NeSySpec; under it, its 95% cluster-bootstrap intervals at the two levels of the block heading, one per line; not reported. Values near 0 are printed with more decimals, seven in the Kleene-Dienes cells. The ablations with p=4p = 4, without in-band grading and with flat banks are trained models, and the textbook prior is a sensitivity. The knowledge base at its initial values starts from the train prior and is a single deterministic model. Other detectors are in Table G.7.

Grounding

On the FGVC pseudo-masks the grounding axiom raises test pointing over the network without a localization term on every backbone, by +0.664 with ConvNeXt-T, +0.699 with ResNet-50 at 512 pixels, +0.615 with ViT token-CAM and +0.677 with ResNet-50 at 448 pixels (8 against 3 seeds), each with an exact seed-bootstrap interval above zero. Figure G.1 gives its pointing levels against the controls (panel a, over its 8 seeds on FGVC-Aircraft and its 3 runs at weight 1 on PASCAL-Part; the location prior, a reference without learning, always points to the grid cell that the part covers most often in other images: the training images for FGVC-Aircraft and the other half of the images for PASCAL-Part) and its comparison with the localization and explanation-supervision methods (panel b, 3 runs per method at the weights selected on validation, where the axiom points to the part in 0.790 of test pseudo-masks). At the same loss weight the auxiliary loss puts about 4.3 times the axiom’s localization weight on each conjunct (§ 3.3), so the two are compared at their weights selected on validation (Appendix § 16).

Image not extracted

Figure G.1. Grounding of visual parts.

On satellite crops (ConvNeXt-T, seed intervals over 8 paired seeds) the axiom keeps attribute and head AUROC on par with the network without a localization term.

Deliberate Falsification

Protocol. Each of the 736 falsification problems inflates one capacity of a genuine held-out record, the range, the cruise speed, the maximum take-off mass or the ceiling, by 5, 10, 20 or 40% (46 records: the 16 clean test records, 11 of unseen families and 19 of the unseen class). A bare lie submits the inflated record; a cover-up also edits up to five further declared fields within the ranges of the fleet, found by a black-box search that reads only the detector’s score; an omission withholds up to two declared fields other than the inflated one. A lie evades a detector when the submitted record scores below the detector’s validation threshold, and evasion is the share of evading lies among the problems whose genuine record the detector accepts; the smallest number of further edits that covers a flagged lie is censored at six.

NeSySpec with the critical-field alert, an optional setting, flags a record when the verdict or the alert fires. Under black-box falsification, a lie flagged by NeSySpec’s record verdict is covered less often than one flagged by the residual MLP: with up to five further edits 0.936 of cover-ups pass against 1.000 (Table G.4), and 0.247 of its flagged bare lies cannot be covered, against 0.000. The smallest cover of one of its flagged lies has 2.69 further edited fields on average (2.68 with the critical-field alert), against 1.01 to 1.63 for the learned detectors (on the residuals, MLP 1.38, LightGBM 1.37 and TabPFN v2 1.63) and more for the Mahalanobis distance and the pooled rules (3.45 and 3.62; point estimates, censored at six). On the 72 problems that the verdict and the residual MLP flag on every seed, 0.413 of the verdict’s flagged lies cannot be covered, against 0.000, with 3.76 edits per cover against 1.58. On omissions of up to two fields and on bare lies some comparators are evaded less often (Table G.4: on omissions the residual MLP +0.026, the residual one-class SVM +0.143 and the Mahalanobis distance +0.119; on bare lies residual LightGBM +0.052 and residual TabPFN v2 +0.105). A withheld field masks the axioms that read it (Proposition 1); with the optional critical-field alert, which names the undeclared field and the constraints it leaves unchecked, NeSySpec is evaded less than the residual MLP with the same alert on unseen families (−0.074) and more on the unseen class (+0.125). On this fleet a rule without the knowledge base (an alert on any undeclared field that the record’s class, or its engine type for classes with fewer than five training records, declares in at least 95% of the training records, whether or not an applicable axiom reads it) gives the alert’s protection with the same false alerts on the genuine records; NeSySpec’s report also names the constraints that each withheld field leaves unchecked.

Ablation and Other Forms of the Same Knowledge

Training the knowledge base through Real Logic is ahead of the same knowledge base at its initial values on every split (+0.073, +0.061 and +0.088), and the full model is ahead of the saturating-envelope ablation and of the ablation with flat banks on every split; Table G.8 gives each ablation with its difference and both intervals, § 4.8 states the reading, and the textbook prior, a sensitivity, is on par with the full model on test and the unseen class and close to it on unseen families. On satellite pairs, a single masked quantifier in place of the strata ranks unseen-site pairs higher (differences −0.008 with 30% of the images withheld and −0.013 with all images) and is close to the fused verdict on test, while NeSySpec’s strata keep one verdict per evidence source, so the report says whether the record or the image raised the flag.

The knowledge encoded. To measure what each constraint contributes, NeSySpec was retrained with subsets of its 12 specification constraints. A removed constraint is unavailable for every record in training and scoring, while the record labels of training stay unchanged. The record verdict was then scored on intervention labels, which no constraint defines, and on generator labels, which the same constraints define, so that a removal hides the corruptions of its constraint by construction (Figure 10 in § 4.8, all panels on intervention labels; Table G.9). Over 96 subsets of 1 to 11 constraints, all 12 of sizes 1 and 11 and 8 random ones of each size from 2 to 10, with 3 seeds each, and the full knowledge base, the intervention-label AUROC averaged over test, unseen families and the unseen class has a mean per size that rises from one size to the next, from 0.535 with one constraint to 0.723 with all twelve (Spearman 0.93 [0.90, 0.95]), by steps whose intervals include zero at 5 of the 11 steps. The returns diminish: a logarithmic trend fits better than a linear one (R2R^2 0.87 against 0.84; on the unseen class alone the two fit equally), the gain is about 0.028 per constraint up to six and 0.008 beyond, and the twelfth still adds a small gain (0.009 [0.003, 0.015]). The AUROC grows linearly with the share of edits that alter a field read by some active constraint (R2R^2 0.88, against 0.74 for a logarithmic trend), a share that goes from 0.22 with one constraint to all edits with twelve, while on the edits of fields the constraints read it stays between 0.70 and 0.75 at every size: the gain follows the coverage of the edits. The residual MLP on the same subsets gains from the same knowledge (0.540 to 0.706), with no trend in its gap to NeSySpec. Removing one constraint from the full knowledge base lowers the intervention-label AUROC for A5 and A2, slightly for A4, A7 and A8 and for A4 with A4P together, and leaves it on par for A1, A4P, A9 and A10 and close for A3, A6 and A11; removing A1 lowers it on the unseen class and raises it slightly on test, and no removal raises it averaged over the three splits. Stall speed, engine count and fuselage length, the fields that only A6, A9 and A11 read, are never edited alone in the intervention records, and stall speed is never edited at all; A3, A4P and A10 read only fields that other constraints also read, as do A2, A4, A7 and A8, whose removal still lowers the AUROC, slightly for A4, A7 and A8. On generator labels the removal of A1, A2, A4, A4P, A5 or A8 lowers the AUROC, that of A7 or A10 slightly, and that of A3 raises it slightly (0.001); abduction is lower without A1 (0.187), A5 (0.077), A3, A4, A4P, A8 and A11, slightly lower without A2, A7 and A10, and on par without A6 and A9. In Figure 10c the darker line gives the aircraft interval and the lighter the family interval, with filled points where both exclude zero.

Selected Components and Sensitivity Analyses

Selected components. The diagnosis key was selected on held-out training classes: with each of the six training classes left out in turn, the verifier retrained and every statistic, prior and head recomputed without it, the largest-violation key ranked a violated constraint first in 0.802 of the held-out corrupted records (mean over the six classes), against 0.630 for the second head, with a higher mean on each held-out class (differences from 0.006 to 0.432); on validation records of the seen classes the two keys differ by 0.0008, and the second head is kept as the secondary key. NeSySpec’s optional critical-field alert was selected because, on validation, it lowered evasion by an attacker who knows the alert from 0.949 to 0.739 and fired on 2 of the 17 genuine validation records, and because, with each training class held out in turn, it fired on 0.028 of that class’s genuine records (mean over six classes; limit 0.25; largest rate 0.091, against 0.263 on the unseen class). Validation selected the abduction rule, the smallest-change rule of Table F.2, and its feasibility threshold 0.9, also chosen in 7 of 8 leave-one-seed-out selections. With threshold 0.8, abduction reaches 0.750 on single-field test corruptions, its readings against minimum-cardinality localization unchanged and still ahead of the Class I residual on test. The largest-feasibility rule of Table G.2, which ranks every field by the lowest verdict it reaches, gives 0.692 on test, 0.747 on unseen families and 0.660 on the unseen class, on par with the Class I residual on test. On intervention labels every reading holds under both alternatives except the margin over the oracle tie-break (+0.112 and +0.095). For a class without training aircraft NeSySpec reads fleet statistics; five alternative reference statistics (engine-type or declared-mass pools with the union or weighted mean of class bands, and the nearest training class), compared on held-out training classes, met no adoption rule, and on the business jets each flags every clean record (1.000 against 0.322 with fleet statistics) with a detection AUROC of 0.836 to 0.906 against 0.934; under the mass pools and the nearest class a withheld field changes the reference class of 16.0, 21.7 and 1.8% of masked held-out records.

RemovedDetection AUROC, intervention labels: DropDetection AUROC, intervention labels: IntervalsDetection AUROC, generator labels: DropDetection AUROC, generator labels: IntervalsAbduction top-1, intervention labels: DropAbduction top-1, intervention labels: Intervals
None (level)0.7230.9680.542
A5+0.033[+0.016, +0.053] [+0.017, +0.060]+0.059[+0.042, +0.079] [+0.043, +0.078]+0.077[+0.054, +0.100] [+0.049, +0.098]
A2+0.022[+0.011, +0.034] [+0.003, +0.035]+0.041[+0.031, +0.053] [+0.032, +0.056]+0.035[−0.000, +0.071] [+0.006, +0.075]
A1+0.017[−0.004, +0.039] [−0.006, +0.038]+0.136[+0.120, +0.150] [+0.119, +0.153]+0.187[+0.161, +0.214] [+0.164, +0.212]
A4 and A4P+0.014[+0.003, +0.026] [+0.001, +0.029]+0.032[+0.021, +0.044] [+0.022, +0.049]+0.052[+0.024, +0.078] [+0.023, +0.081]
A4+0.013[+0.004, +0.023] [+0.003, +0.025]+0.019[+0.011, +0.029] [+0.009, +0.030]+0.034[+0.015, +0.055] [+0.011, +0.054]
A8+0.007[+0.000, +0.014] [−0.002, +0.015]+0.022[+0.013, +0.032] [+0.011, +0.030]+0.030[+0.012, +0.050] [+0.014, +0.052]
A10+0.003[−0.003, +0.008] [−0.005, +0.007]+0.007[+0.002, +0.013] [+0.002, +0.013]+0.017[+0.001, +0.035] [+0.000, +0.033]
A7+0.002[+0.001, +0.004] [+0.001, +0.004]+0.002[+0.001, +0.004] [+0.001, +0.004]+0.011[+0.003, +0.021] [+0.000, +0.021]
A9+0.001[−0.003, +0.005] [−0.004, +0.005]−0.003[−0.008, +0.003] [−0.008, +0.003]+0.001[−0.006, +0.009] [−0.008, +0.008]
A6+0.000[−0.000, +0.001] [−0.000, +0.001]−0.000[−0.001, +0.000] [−0.001, +0.000]−0.000[−0.006, +0.005] [−0.006, +0.005]
A11−0.000[−0.001, +0.001] [−0.001, +0.002]−0.001[−0.002, +0.001] [−0.002, +0.000]+0.032[+0.021, +0.043] [+0.021, +0.044]
A4P−0.001[−0.006, +0.005] [−0.006, +0.007]+0.017[+0.010, +0.024] [+0.011, +0.028]+0.024[+0.005, +0.044] [+0.006, +0.045]
A3−0.001[−0.002, +0.001] [−0.002, +0.001]−0.001[−0.003, −0.000] [−0.002, −0.000]+0.010[+0.004, +0.017] [+0.004, +0.015]

Table G.9. Specification constraints removed from the knowledge base. Drop: the full knowledge base minus the knowledge base without the constraint, 8 seeds each, paired on the same records; detection averaged over test, unseen families and the unseen class, abduction over the 695 single-field intervention records of the three splits. Intervals: [aircraft] above [family], 95% cluster-bootstrap percentiles, 2,000 draws. Generator labels are defined by the same constraints, so a removal hides the corruptions of its constraint by construction.

Sensitivity analyses. On generator labels, every band alternative that places more of NeSySpec’s learned bands inside the training fleet range widened by 12% [0.88 min, 1.12 max], lowers validation detection by more than 0.005: the learned bands act as tolerances learned from the fleet, 45.7% of them with both edges inside that range. The alternatives project the band edges onto that range after every step, or pull them toward it with a penalty of weight 0.01, 0.1 or 1.0 (eight seeds each). Retrained on intervention labels, the four alternatives hold 68.5, 86.7, 96.5 and 100% of the 46 counted bands per seed (those with a training fleet range) inside the range and stay within the validation margin; the projection reaches 0.804 on test, against 0.807 for NeSySpec retrained on the same labels. The penalty of weight 0.01, the alternative selected on validation, keeps its share at 45.7% and was not adopted; it reaches on generator-label test a detection AUROC of 0.977, on par with 0.979, the same diagnosis top-1 (0.942) against 0.942 and a localization top-1 of 0.728 against 0.742 and a false-positive rate on the controls of 0.082 against 0.086, and on the unseen class a detection AUROC slightly lower, 0.932 against 0.934; with weight 1.0 (53.8% inside) unseen-class detection is lower, 0.924 against 0.934. These alternatives are sensitivity analyses of NeSySpec.

Oracle bands fitted on the training aircraft. With the class bands of the generator oracle fitted on the 44 clean training aircraft alone (business jets, which have no training aircraft, on the band of all training aircraft), and the generator, its seed and the family splits unchanged, the benchmark holds 1,239 instances instead of 1,312. These bands flag 38 of the 63 clean held-out aircraft, 15 of the 16 in test, mostly on A1, A9 and A11; controls must stay clean under the oracle, so the test controls fall from 32 to 4. NeSySpec was retrained with its selected configuration on 8 seeds, as were the residual MLP and TabPFN v2 with their full selection protocol and the DL2-loss network with its selected hyperparameters, whose search was not repeated; the crisp edits and minimum-cardinality localization were recomputed, and the rule diagnosis, TabPFN v2 on intervention labels and the alternative bootstrap streams were not rerun (Tables G.10 and G.11). The validation rule of the crisp edits now selects per-class bands without pooling (validation AUROC 0.919 against 0.915), the bands of the new label oracle itself, with which the crisp edits lead NeSySpec on generator labels in key and macro-F1 on every split; the tables keep the pooled bands of the paper, and on intervention labels NeSySpec is on par with the unpooled crisp edits in macro-F1 on test (−0.006) and ahead on the other two splits. On intervention labels, whose records are the same under both oracles, NeSySpec stays ahead on every split of the DL2-loss network in macro-F1 (+0.045 [+0.012, +0.142] · [+0.012, +0.163] on test), of Fellegi-Holt and Z3 in diagnosis (+0.126 and +0.092 on test) and of minimum-cardinality localization with random tie-break (+0.226 on test); on test it is on par with the oracle tie-break (+0.079) and with the crisp edits in macro-F1 (−0.016), and the DL2-loss network has the higher exact-set agreement (−0.149) and fewer false violations. NeSySpec’s own test levels there are lower, with more false violations, every paired interval excluding zero: macro-F1 0.488 against 0.575, exact-set agreement 0.070 against 0.283, false-violation rate 0.219 against 0.084, key 0.732 against 0.786 and abduction 0.532 against 0.593, while detection is on par (0.695 against 0.701). On unseen families key, abduction and detection are on par and macro-F1 comparable (0.666 against 0.694), exact-set agreement is lower (0.255 against 0.373) and the false-violation rate slightly higher (0.088 against 0.028); on the unseen class the verdicts, abduction and detection are on par and the key is lower (0.743 against 0.778). Trained on the flags of these bands through its per-constraint targets, NeSySpec learns narrower bands where the oracle’s bands are narrow. Over the 46 counted bands, the median ratio of its learned widths to those learned under the paper’s oracle is 0.903 (seed-bootstrap interval [0.897, 0.911]), and 64% of the bands narrow, with a moderate rank correlation with the oracle’s width ratios over 45 class bands (Spearman 0.43). The narrowing is largest for the thrust bands of A9 and the passenger-density bands of A11 (median 0.71), which carry the largest rises in false violations on the 16 clean test aircraft (+0.35 and +0.33; 0.061 to 0.208 over all constraints), followed by A2 (+0.26), whose learned bands shift. Seven of its eight seeds reached their best epoch by epoch 22, against 80 to 100 for the paper’s seeds; the seed whose best epoch is 93 shows a similar narrowing on the bands of A3 and the thrust bands of A9 (0.78 and 0.74) and a smaller one on the passenger-density bands of A11 (0.78). On generator labels the records differ between the two benchmarks: the held-out corrupted records keep the violations their clean origin already has under the narrower bands, and the clean record itself stays labeled clean. There the residual MLP is slightly higher in detection on test (0.950 against 0.910, −0.040 [−0.075, −0.010] · [−0.071, +0.001]) and on unseen families (−0.013), as is TabPFN v2 on unseen families (−0.020), and stays slightly ahead on the unseen class (0.986 against 0.959), where TabPFN v2 is now on par (−0.008). The key reaches 0.944 on test and 0.931 on unseen families (0.973 before), slightly ahead of Fellegi-Holt and Z3 on test (+0.102) and on par with them on unseen families (+0.094); on the unseen class, where the pooled crisp bands equal those of the label oracle, Fellegi-Holt and Z3 lead (−0.094). The verdicts stay ahead of the DL2-loss network in macro-F1 on every split (+0.288 on test), are on par with the crisp edits on test and unseen families and below them on the unseen class (−0.125), with more false violations than the crisp edits on every split. Abduction is now ahead of the oracle tie-break on test (+0.199 [+0.042, +0.370] · [+0.052, +0.528]) and stays ahead of random tie-breaking on every split. The repair still lowers the error on the altered field on every split (0.126 against 0.236 without repair on test); as the verifier now rates almost every clean and control test record as violating, its target is reached on 0.036 of single-field test records (0.555 before) and it proposes a change for 0.988 of the clean and control test records (0.588 on unseen families and 0.707 on the unseen class); the repair rule re-selected on the new validation split (feasibility threshold 0.8 instead of 0.9) reaches the target on 0.190 and changes 0.894 of them. Bands fitted on all 107 aircraft cover the range of the fleet the records describe, which bands fitted on 44 aircraft do not.

Oracle fitted on training and validation aircraft, tolerances chosen out of family. Fitted on the 61 clean training and validation aircraft, the oracle had each of its three tolerances set, by a rule declared before any result, to the smallest value of a grid that flags at most 5% of the clean aircraft when their family is held out in turn: the range margin, the relative widening of each class band ([0.88 min, 1.12 max] at 0.12), becomes 0.50 instead of 0.12 (2 of 61 aircraft flagged, against 24 at 0.12); the equality factor, which multiplies the largest absolute log-residual of the clean records of each class for the identities A1, A5 and A6, becomes 1.25 instead of 1.15 (3 of 60, at the limit of the rule); and the mass-balance margin of A7, subtracted from the smallest clean mass-balance margin, stays at 0.05; with these values 5 of the 61 aircraft are flagged by some tolerance. This oracle flags 14 of the 46 clean test and out-of-distribution aircraft: 11 of the 16 in test, 10 of them narrowbodies on A1, whose class tolerance rests on 3 aircraft of 2 families, 3 business jets on A9, judged by the band fitted on all 61 aircraft, and none of the unseen families; its wider bands let the generator escalate further (median magnitude 0.8 against 0.4), and the benchmark holds 1,260 instances with 10 test controls. Retrained on its labels as above (Tables G.10 and G.11), NeSySpec on intervention labels keeps its false violations at the paper’s level on test (0.073 against 0.084, on par), with fewer on the unseen class (0.087 against 0.128), and its exact-set agreement on par on test and unseen families and slightly higher on the unseen class (0.206 against 0.155); its macro-F1 is lower on test (0.537 against 0.575) and unseen families (0.636 against 0.694), its abduction on test (0.491 against 0.593) and unseen families (0.508 against 0.594), and its key on the unseen class (0.735 against 0.778) and slightly on test (0.738 against 0.786), while detection is on par on test and unseen families and close on the unseen class (0.711 against 0.719). Against the comparators on intervention labels it stays ahead on every split of Fellegi-Holt and Z3 in diagnosis and of minimum-cardinality localization with random tie-break, ahead of the DL2-loss network in macro-F1 on unseen families, slightly on test (+0.037) and on par on the unseen class, with the network keeping fewer false violations on test and the unseen class. In macro-F1 it is on par with the crisp edits on test and unseen families and slightly ahead on the unseen class (+0.029), and, against the bands with a 25% margin, small classes pooled, that the validation rule of the crisp edits now selects (validation AUROC 0.943 against 0.942), on par on test and ahead on the other two splits. In abduction it is on par with the oracle tie-break on every split, and against the Class I residual on par on test, lower on unseen families (−0.096) and ahead on the unseen class. On generator labels, with larger corruptions, NeSySpec reaches a detection AUROC of 0.976 on test, slightly below the residual MLP (0.994), and on the unseen class slightly below the residual MLP and TabPFN v2 (0.988 against 0.999 for both); its macro-F1 is on par with the DL2-loss network on test and the unseen class and ahead on unseen families, ahead of the crisp edits on test, slightly ahead on unseen families and below them on the unseen class; its key, 0.955 on test, is ahead of Fellegi-Holt on every split and of Z3 on test and unseen families, and on par with Z3 on the unseen class; abduction is on par with the oracle tie-break on every split and ahead of random tie-breaking; the repair lowers the error on the altered field on every split, reaches its target on 0.570 of single-field test records and changes 0.418 of the clean and control test records; and 109 of the 154 corrupted test records carry a violation their clean origin already has. Under these tolerances the bands widen, the training corruptions grow and training stops earlier (best epochs 15 to 27, against 80 to 100), so their effects on the key and abduction levels are not separated.

107 aircraft44 aircraft61 aircraft
Benchmark
Instances1,3121,2391,260
Test controls32410
Clean test aircraft flagged by the oracle, of 1601511
Intervention labels, same records: NeSySpec
Constraint verdicts, macro-F1, test0.5750.4880.537
unseen families0.6940.6660.636
unseen class0.4310.4440.400
Constraint verdicts, exact-set, test0.2830.0700.223
unseen families0.3730.2550.348
unseen class0.1550.1530.206
Constraint verdicts, false-violation rate, test0.0840.2190.073
unseen families0.0280.0880.015
unseen class0.1280.1200.087
Largest-violation key, top-1, test0.7860.7320.738
unseen families0.8280.8080.795
unseen class0.7780.7430.735
Abduction, top-1, test0.5930.5320.491
unseen families0.5940.5800.508
unseen class0.4650.4530.441
Detection AUROC, test0.7010.6950.696
unseen families0.7500.7470.737
unseen class0.7190.7160.711
Intervention labels, test: NeSySpec minus the comparator
DL2-loss network, macro-F1+0.149+0.045+0.037
DL2-loss network, exact-set+0.061−0.149−0.058
DL2-loss network, false-violation rate+0.065+0.194+0.059
Crisp edits, small classes pooled, macro-F1+0.071−0.016+0.032
Fellegi-Holt, key top-1+0.180+0.126+0.132
Z3, key top-1+0.146+0.092+0.098
Minimum cardinality, random tie-break, abduction+0.287+0.226+0.186
Minimum cardinality, oracle tie-break, abduction+0.140+0.079+0.038
Class I sizing-regression residual, abduction+0.140+0.079+0.038
Generator labels, test and unseen class: different records under each oracle
Detection AUROC, residual MLP0.9900.9500.994
Detection AUROC, TabPFN v2 on the residuals0.9580.9320.983
Detection AUROC, NeSySpec0.9790.9100.976
Detection AUROC, unseen class, residual MLP0.9780.9860.999
Detection AUROC, unseen class, TabPFN v2 on the residuals0.9830.9670.999
Detection AUROC, unseen class, NeSySpec0.9340.9590.988
Constraint verdicts, DL2-loss network0.474/0.661/0.0200.145/0.456/0.0220.431/0.760/0.012
Constraint verdicts, crisp edits, small classes pooled0.569/0.829/0.0360.421/0.664/0.0300.256/0.662/0.059
Constraint verdicts, NeSySpec0.504/0.795/0.0740.176/0.745/0.1870.360/0.773/0.059
Key top-1, chance0.1770.3730.243
Key top-1, Fellegi-Holt0.7950.8420.733
Key top-1, Z30.8250.8420.822
Key top-1, NeSySpec0.9420.9440.955
Abduction top-1, minimum cardinality, random tie-break0.3670.1920.423
Abduction top-1, minimum cardinality, oracle tie-break0.6290.4210.590
Abduction top-1, NeSySpec0.7420.6200.706
Repair, log error on the altered field, no repair0.3660.2360.511
Repair, log error on the altered field, NeSySpec0.1330.1260.169
Repair, target reached on single-field records, NeSySpec0.5550.0360.570
Repair, clean and control records changed, NeSySpec0.5620.9880.418

Table G.10. Generator oracles: levels of NeSySpec and its comparators.

Oracle fitted on all 107 aircraft (the paper), on the 44 training aircraft with the paper’s tolerances, and on the 61 training and validation aircraft with tolerances chosen by leaving one family out (range margin 0.50, equality factor 1.25, mass-balance margin 0.05). Learned methods: means over 8 seeds. Intervention labels, set from the edit alone, are the same records under every oracle; generator labels differ between the three benchmarks. Constraint verdicts on generator labels: exact-set agreement / macro-F1 / false-violation rate. On intervention labels only NeSySpec and the DL2-loss network change; the crisp edits, Fellegi-Holt, Z3, minimum cardinality and the Class I residual are the same under every oracle, and since the oracle tie-break and the Class I residual reach the same intervention-label test level (0.453), their differences from NeSySpec coincide. Intervals of the intervention-label rows in Table G.11; those of the differences under the oracle on 107 aircraft in the DL2-loss macro-F1, the key and abduction are in Tables G.1 to G.4 and Appendix § 15.§ 1.

ReadingOracle on 44 aircraft: ValueOracle on 44 aircraft: IntervalsOracle on 61 aircraft: ValueOracle on 61 aircraft: Intervals
Intervention labels, same records: NeSySpec, change from the oracle on 107 aircraft
Constraint verdicts, macro-F1, test−0.087[−0.173, −0.022]·[−0.146, −0.029]−0.039[−0.109, −0.007]·[−0.098, −0.0034]
unseen families−0.028[−0.054, +0.017]·[−0.061, +0.003]−0.058[−0.105, −0.022]·[−0.116, −0.026]
unseen class+0.013[−0.010, +0.041]·[−0.011, +0.039]−0.032[−0.059, +0.003]·[−0.060, +0.002]
Constraint verdicts, exact-set, test−0.213[−0.309, −0.125]·[−0.279, −0.117]−0.060[−0.164, +0.032]·[−0.187, +0.043]
unseen families−0.118[−0.226, −0.005]·[−0.188, −0.008]−0.026[−0.083, +0.027]·[−0.108, +0.032]
unseen class−0.002[−0.040, +0.044]·[−0.041, +0.041]+0.050[+0.001, +0.109]·[−0.007, +0.118]
Constraint verdicts, false-violation rate, test+0.135[+0.092, +0.178]·[+0.068, +0.168]−0.011[−0.044, +0.025]·[−0.049, +0.030]
unseen families+0.061[+0.011, +0.111]·[−0.011, +0.099]−0.013[−0.032, +0.002]·[−0.042, +0.003]
unseen class−0.007[−0.024, +0.010]·[−0.024, +0.010]−0.041[−0.059, −0.023]·[−0.061, −0.021]
Largest-violation key, top-1, test−0.054[−0.094, −0.019]·[−0.109, −0.023]−0.048[−0.091, −0.007]·[−0.101, −0.002]
unseen families−0.020[−0.059, +0.016]·[−0.055, +0.045]−0.033[−0.063, +0.004]·[−0.060, +0.035]
unseen class−0.035[−0.066, −0.004]·[−0.065, −0.009]−0.043[−0.072, −0.018]·[−0.070, −0.017]
Abduction, top-1, test−0.061[−0.101, −0.024]·[−0.102, −0.030]−0.102[−0.151, −0.059]·[−0.173, −0.063]
unseen families−0.014[−0.048, +0.021]·[−0.036, +0.043]−0.086[−0.136, −0.043]·[−0.129, −0.060]
unseen class−0.012[−0.045, +0.025]·[−0.044, +0.025]−0.024[−0.077, +0.033]·[−0.077, +0.035]
Detection AUROC, test−0.006[−0.022, +0.008]·[−0.026, +0.007]−0.005[−0.022, +0.011]·[−0.030, +0.009]
unseen families−0.003[−0.031, +0.025]·[−0.025, +0.030]−0.013[−0.035, +0.005]·[−0.043, +0.017]
unseen class−0.003[−0.016, +0.005]·[−0.015, +0.005]−0.008[−0.020, −0.000]·[−0.020, +0.000]
Intervention labels: NeSySpec minus the comparator under each oracle
DL2-loss network, macro-F1, test+0.045[+0.012, +0.142]·[+0.012, +0.163]+0.037[+0.002, +0.113]·[+0.010, +0.143]
unseen families+0.220[+0.184, +0.277]·[+0.209, +0.267]+0.129[+0.094, +0.168]·[+0.101, +0.172]
unseen class+0.141[+0.106, +0.185]·[+0.111, +0.182]+0.000[−0.029, +0.040]·[−0.028, +0.038]
DL2-loss network, exact-set, test−0.149[−0.203, −0.095]·[−0.207, −0.077]−0.058[−0.148, +0.026]·[−0.199, +0.050]
unseen families+0.041[−0.065, +0.143]·[−0.016, +0.134]+0.081[+0.023, +0.133]·[+0.033, +0.152]
unseen class−0.093[−0.166, −0.016]·[−0.163, −0.013]−0.033[−0.101, +0.037]·[−0.105, +0.034]
DL2-loss network, false-violation rate, test+0.194[+0.147, +0.242]·[+0.126, +0.228]+0.059[+0.022, +0.100]·[+0.021, +0.101]
unseen families+0.070[+0.031, +0.112]·[+0.017, +0.102]+0.010[−0.004, +0.028]·[−0.009, +0.032]
unseen class+0.102[+0.052, +0.152]·[+0.053, +0.152]+0.064[+0.020, +0.109]·[+0.023, +0.112]
Crisp edits, small classes pooled, macro-F1, test−0.016[−0.061, +0.053]·[−0.072, +0.045]+0.032[−0.025, +0.098]·[−0.036, +0.088]
unseen families+0.097[+0.025, +0.178]·[+0.006, +0.177]+0.067[−0.007, +0.142]·[−0.039, +0.148]
unseen class+0.073[+0.033, +0.103]·[+0.035, +0.103]+0.029[+0.001, +0.057]·[−0.002, +0.056]
Fellegi-Holt, key top-1, test+0.126[+0.086, +0.170]·[+0.097, +0.193]+0.132[+0.084, +0.186]·[+0.092, +0.227]
unseen families+0.183[+0.114, +0.256]·[+0.139, +0.280]+0.170[+0.103, +0.244]·[+0.118, +0.268]
unseen class+0.231[+0.173, +0.292]·[+0.175, +0.298]+0.223[+0.159, +0.289]·[+0.161, +0.296]
Z3, key top-1, test+0.092[+0.047, +0.153]·[+0.038, +0.164]+0.098[+0.046, +0.168]·[+0.040, +0.187]
unseen families+0.179[+0.101, +0.279]·[+0.129, +0.250]+0.166[+0.093, +0.266]·[+0.101, +0.264]
unseen class+0.145[+0.107, +0.186]·[+0.107, +0.186]+0.137[+0.094, +0.181]·[+0.095, +0.183]
Minimum cardinality, random tie-break, abduction, test+0.226[+0.160, +0.295]·[+0.176, +0.351]+0.186[+0.119, +0.256]·[+0.125, +0.302]
unseen families+0.269[+0.164, +0.389]·[+0.181, +0.471]+0.197[+0.063, +0.336]·[+0.066, +0.402]
unseen class+0.288[+0.215, +0.359]·[+0.219, +0.364]+0.276[+0.185, +0.363]·[+0.191, +0.371]
Minimum cardinality, oracle tie-break, abduction, test+0.079[−0.013, +0.185]·[−0.017, +0.299]+0.038[−0.052, +0.142]·[−0.048, +0.248]
unseen families+0.120[−0.033, +0.290]·[−0.003, +0.440]+0.048[−0.123, +0.230]·[−0.084, +0.350]
unseen class+0.145[+0.015, +0.273]·[+0.022, +0.280]+0.133[−0.013, +0.277]·[−0.003, +0.286]
Class I sizing-regression residual, abduction, test+0.079[+0.022, +0.131]·[+0.016, +0.115]+0.038[−0.016, +0.095]·[−0.020, +0.064]
unseen families−0.024[−0.098, +0.049]·[−0.071, +0.098]−0.096[−0.171, −0.033]·[−0.144, −0.022]
unseen class+0.362[+0.291, +0.433]·[+0.292, +0.432]+0.350[+0.282, +0.424]·[+0.283, +0.423]

Table G.11. Generator oracles fitted without test or out-of-distribution aircraft: paired changes and differences with their intervals. Intervals: [aircraft]·[family], 95% cluster-bootstrap percentiles; the first panel gives the paired change of NeSySpec on the same records, the second the difference at each oracle (Table G.10 gives the levels and the differences under the oracle on 107 aircraft).

Training Checkpoints

Figure 9 in § 4.8 shows the training curves of the axioms; two readings complete it. At the frozen checkpoint, restored at the best validation epoch, the mean truth of each specification constraint is lower on corrupted than on clean-labeled records in 46 of 46 split and constraint pairs with available evidence, by as little as 1.0×10−51.0 \times10^{-5} on the unseen class. With the train prior (8 seeds), the best epoch, selected by early stopping on the validation AUROC (Table F.2), reaches the declared cap of 100 epochs in three of eight seeds.

Image not extracted

Figure 9. Training dynamics of the axioms.

Explanation-Supervision Comparison

This appendix gives the results and the protocol of the comparison with explanation supervision summarized in § 4.6. Under the protocol described at the end of this appendix, the grounding axiom localizes the annotated parts more than RRR [57], GradMask [58] and Pukdee et al. [61], with every cluster-bootstrap interval of the difference above zero on the FGVC pseudo-masks, on PASCAL-Part human masks (levels in Figure G.1b) and on two further human-mask datasets. Against RRR, GradMask and Pukdee et al., in this order, its pointing exceeds theirs by +0.725 [+0.700, +0.750], +0.779 and +0.618 on the FGVC test pseudo-masks, by +0.594 [+0.559, +0.630], +0.702 and +0.496 on PASCAL-Part, by +0.523 [+0.475, +0.571], +0.631 and +0.420 on PartImageNet and by +0.483 [+0.359, +0.595], +0.636 and +0.446 on the 40 items of UDA-Part, with wider intervals on the last two; Pukdee et al. is run at the calibration of the protocol, which flattened their teacher toward the uniform prediction. The intervals of all 27 differences, nine mask configurations by three baselines, lie above zero, also under an independent bootstrap seed. Across the weights 0.3, 1 and 3 the axiom keeps at most one collapsed head, a head whose F1 is at most 0.05, against up to 5.7 on average for the auxiliary loss. At weight 1 it keeps an out-of-distribution accuracy lead of +0.016 [+0.012, +0.020] over the auxiliary loss at its validation weight 0.3; test accuracy, by contrast, is degenerate (a constant predictor scores 0.926).

Protocol. A first set of runs of RRR, GradMask, RES [59] (its RES-L variant, adapted to these part masks) and Pukdee et al. used λ=1\lambda= 1 and penalties coupled across a batch through batch normalization [94] in training mode. The comparison retrains RRR, GradMask and Pukdee et al. with per-example penalties, the normalization constants held fixed, selects λ∈{0.1,1,10}\lambda\in\{0.1, 1, 10\} times a calibration constant on validation with one seed per value, and evaluates three seeds at the selected value. RES-L is not retrained: on these masks its adapted objective does not reward localization, so its pointing does not measure what RES can localize. A second arm of Pukdee et al., added after the results, measures its calibration constant at the first projection step instead of at initialization; it avoids the flattened teacher and weights the constraint about three orders of magnitude less. It points to the part in 0.179 of PASCAL-Part human masks, where the axiom’s lead over it is +0.558 [+0.524, +0.591], and the intervals of the axiom’s differences from it also lie above zero on the FGVC pseudo-masks and on every other human-mask set. Holding the normalization constants fixed makes each penalty per-example and leaves the network in inference mode unconstrained by it, a gap that a diagnostic measures for RRR.

References

  1. [1]Dominik Wienand and Heiko Paulheim. Detecting incorrect numerical data in DBpedia. In The Semantic Web: Trends and Challenges (ESWC 2014), volume 8465 of Lecture Notes in Computer Science, pages 504–518. Springer, 2014.DOI
  2. [2]Junzi Sun, Jacco M. Hoekstra, and Joost Ellerbroek. OpenAP: An open-source aircraft performance model for air transportation studies and simulations. Aerospace, 7(8):104, 2020.DOI
  3. [3]Eckhard Lichtenthaler. Technology intelligence processes in leading European and North American multinationals. R&D Management, 34(2):121–135, 2004.DOI
  4. [4]Yi Zhang, Douglas K. R. Robinson, Alan L. Porter, Donghua Zhu, Guangguan Zhang, and Jie Lu. Technology roadmapping for competitive technical intelligence. Technological Forecasting and Social Change, 110:175–186, 2016.
  5. [5]Michael Glassman and Min Ju Kang. Intelligence in the internet age: The emergence and evolution of open source intelligence (OSINT). Computers in Human Behavior, 28(2):673–682, 2012.DOI
  6. [6]Javier Pastor-Galindo, Pantaleone Nespoli, Félix Gómez Mármol, and Gregorio Martínez Pérez. The not yet exploited goldmine of OSINT: Opportunities, open challenges and future trends. IEEE Access, 8:10282–10304, 2020.
  7. [7]Subhransu Maji, Esa Rahtu, Juho Kannala, Matthew Blaschko, and Andrea Vedaldi. Fine-grained visual classification of aircraft. arXiv:1306.5151, 2013.arxiv.org/abs/1306.5151
  8. [8]Jacob Shermeyer, Thomas Hossler, Adam Van Etten, Daniel Hogan, Ryan Lewis, and Daeil Kim. RarePlanes: Synthetic data takes flight. In Proceedings of the IEEE Winter Conference on Applications of Computer Vision (WACV 2021), pages 207–217, 2021.arxiv.org/abs/2006.02963
  9. [9]Songqiao Han, Xiyang Hu, Hailiang Huang, Minqi Jiang, and Yue Zhao. ADBench: Anomaly detection benchmark. In Advances in Neural Information Processing Systems 35 (NeurIPS 2022), Datasets and Benchmarks Track, pages 32142–32159, 2022.
  10. [10]Noah Hollmann, Samuel Müller, Lennart Puruсker, Arjun Krishnakumar, Max Körfer, Shi Bin Hoo, Robin Tibor Schirrmeister, and Frank Hutter. Accurate predictions on small data with a tabular foundation model. Nature, 637(8045):319–326, 2025.DOI
  11. [11]Che-Ping Tsai, Ganyu Teng, Philipp Wallis, and Wei Ding. AnoLLM: Large language models for tabular anomaly detection. In Proceedings of the 13th International Conference on Learning Representations (ICLR 2025), pages 7562–7592, 2025.
  12. [12]Scott M. Lundberg and Su-In Lee. A unified approach to interpreting model predictions. In Advances in Neural Information Processing Systems 30 (NIPS 2017), pages 4765–4774, 2017.arxiv.org/abs/1705.07874
  13. [13]I. P. Fellegi and D. Holt. A systematic approach to automatic edit and imputation. Journal of the American Statistical Association, 71(353):17–35, 1976.
  14. [14]Raymond Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57–95, 1987.
  15. [15]Artur d’Avila Garcez and Luís C. Lamb. Neurosymbolic AI: The 3rd wave. Artificial Intelligence Review, 56(11):12387–12406, 2023.
  16. [16]Laura von Rueden, Sebastian Mayer, Katharina Beckh, Bogdan Georgiev, Sven Giesselbach, Raoul Heese, Birgit Kirsch, Julius Frommer, Annika Pick, Rajkumar Ramamurthy, Michal Walczak, Jochen Garcke, Christian Bauckhage, and Jannis Schuecker. Informed machine learning: A taxonomy and survey of integrating prior knowledge into learning systems. IEEE Transactions on Knowledge and Data Engineering, 35(1):614–633, 2023.
  17. [17]Kamal Acharya, Iman Sharifi, Mehul Lad, Liang Sun, and Houbing Song. Integrating neurosymbolic AI in advanced air mobility: A comprehensive survey. In Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2025), Survey Track, pages 10362–10370, 2025.
  18. [18]Semanto Mondal, Antonino Ferraro, Fabiano Pecorelli, and Giuseppe De Pietro. A Logic Tensor Network-based neurosymbolic framework for explainable diabetes prediction. Applied Sciences, 15(21):11806, 2025.
  19. [19]Samy Badreddine, Artur d’Avila Garcez, Luciano Serafini, and Michael Spranger. Logic Tensor Networks. Artificial Intelligence, 303:103649, 2022.DOI
  20. [20]Marc Fischer, Mislav Balunović, Dana Drachsler-Cohen, Timon Gehr, Ce Zhang, and Martin Vechev. DL2: Training and querying neural networks with logic. In Proceedings of the 36th International Conference on Machine Learning (ICML 2019), volume 97 of Proceedings of Machine Learning Research, pages 1931–1941. PMLR, 2019.
  21. [21]Emile van Krieken, Erman Acar, and Frank van Harmelen. Analyzing differentiable fuzzy logic operators. Artificial Intelligence, 302:103602, 2022.DOI
  22. [22]Ruiyuan Kang, Tingting Mu, Panagiotis Liatsis, and Dimitrios Kyritsis. Physics-driven ML-based modelling for correcting inverse estimation. In Advances in Neural Information Processing Systems 36 (NeurIPS 2023), pages 15639–15659, 2023.
  23. [23]Mark P. J. van der Loo and Edwin de Jonge. Data validation infrastructure for R. Journal of Statistical Software, 97(10):1–31, 2021.
  24. [24]Wei Ni, Xiaoye Miao, Xiangyu Zhao, Yangyang Wu, Shuwei Liang, and Jianwei Yin. Automatic data repair: Are we ready to deploy? Proceedings of the VLDB Endowment, 17(10):2617–2630, 2024.
  25. [25]Theodoros Rekatsinas, Xu Chu, Ihab F. Ilyas, and Christopher Ré. HoloClean: Holistic data repairs with probabilistic inference. Proceedings of the VLDB Endowment, 10(11):1190–1201, 2017.
  26. [26]Mohammad Mahdavi and Ziawasch Abedjan. Baran: Effective error correction via a unified context representation and transfer learning. Proceedings of the VLDB Endowment, 13(12):1948–1961, 2020.
  27. [27]Leonardo de Moura and Nikolaj Bjørner. Z3: An efficient SMT solver. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2008), volume 4963 of Lecture Notes in Computer Science, pages 337–340. Springer, 2008.
  28. [28]Nikolaj Bjørner, Anh-Dung Phan, and Lars Fleckenstein. vZ: An optimizing SMT solver. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2015), volume 9035 of Lecture Notes in Computer Science, pages 194–199. Springer, 2015.DOI
  29. [29]C. Eastman, Jae-min Lee, Yeon-suk Jeong, and Jin-kook Lee. Automatic rule-based checking of building designs. Automation in Construction, 18(8):1011–1033, 2009.
  30. [30]Odin Iversen and Lizhen Huang. Leveraging large language models for BIM-based automated compliance checking. Automation in Construction, 182:106707, 2026.
  31. [31]Sebastian Schelter, Dustin Lange, Philipp Schmidt, Meltem Celikel, Felix Biessmann, and Andreas Grafberger. Automating large-scale data quality verification. Proceedings of the VLDB Endowment, 11(12):1781–1794, 2018.
  32. [32]Xin Chen and Kai Cheng. AI-assisted auditing review of mechanical engineering drawings: A Perception-Cognition-Collaboration reference architecture and its implementation perspectives. International Journal of Computer Integrated Manufacturing, pages 1–22, 2026. Published online, doi:10.1080/0951192X.2026.2714117.
  33. [33]Daniel Jung, Kok Yew Ng, Erik Frisk, and Mattias Kry­sander. Combining model-based diagnosis and data-driven anomaly classifiers for fault isolation. Control Engineering Practice, 80:146–156, 2018.DOI
  34. [34]Arman Mohammadi, Mattias Krysander, and Daniel Jung. Consistency-based diagnosis using data-driven residuals and limited training data. Control Engineering Practice, 159:106283, 2025.
  35. [35]Tim Bohne, Anne-Kathrin Patricia Windler, and Martin Atzmueller. A domain-agnostic neuro-symbolic architecture for multimodal human-in-the-loop anomaly detection and complex fault diagnosis. IEEE Access, 13:210201–210236, 2025.DOI
  36. [36]Haoliang Huang, Zhuang Cai, Zhuo Tang, Yifan Liu, Chen Tian, Kenli Li, and Changjian Chen. Integrating data validation with large language models for regulation-guided tabular anomaly detection. In Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 6559–6581. Association for Computational Linguistics, 2026.
  37. [37]Mengyi Yan, Yaoshu Wang, Yue Wang, Xiaoye Miao, and Jianxin Li. GIDCL: A graph-enhanced interpretable data cleaning framework with large language model. Proceedings of the ACM on Management of Data, 2(6):236:1–236:29, 2024.DOI
  38. [38]Wei Ni, Kaihang Zhang, Xiaoye Miao, Xiangyu Zhao, Yangyang Wu, Yaoshu Wang, and Jianwei Yin. ZeroED: Hybrid zero-shot error detection through large language model reasoning. In 2025 IEEE 41st International Conference on Data Engineering (ICDE), pages 3126–3139, 2025.arxiv.org/abs/2504.05345
  39. [39]Ivan Donadello, Luciano Serafini, and Artur D’Avila Garcez. Logic Tensor Networks for semantic image interpretation. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 1596–1602, 2017.arxiv.org/abs/1705.08968
  40. [40]Eduard Hogea, Darian M. Onchis, Ruqiang Yan, and Zheng Zhou. LogicLSTM: Logically-driven long short-term memory model for fault diagnosis in gearboxes. Journal of Manufacturing Systems, 77:892–902, 2024.DOI
  41. [41]Eduard Hogea, Darian M. Onchis, Ruqiang Yan, and Zheng Zhou. Rule guided transformers for dynamic knowledge adaptation in rotating machinery fault diagnosis. Advanced Engineering Informatics, 72:104444, 2026.DOI
  42. [42]Robin Manhaeve, Sebastijan Dumančić, Angelika Kimmig, Thomas Demeester, and Luc De Raedt. Neural probabilistic logic programming in DeepProbLog. Artificial Intelligence, 298:103504, 2021.arxiv.org/abs/1907.08194
  43. [43]Ziyang Li, Jiani Huang, and Mayur Naik. Scallop: A language for neurosymbolic programming. Proceedings of the ACM on Programming Languages, 7(PLDI):1463–1487, 2023.arxiv.org/abs/2304.04812
  44. [44]Zhun Yang, Adam Ishay, and Joohyung Lee. NeurASP: Embracing neural networks into answer set programming. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI 2020), pages 1755–1762, 2020.arxiv.org/abs/2307.07700
  45. [45]Wen-Chao Hu, Wang-Zhou Dai, Yuan Jiang, and Zhi-Hua Zhou. Efficient rectification of neuro-symbolic reasoning inconsistencies by abductive reflection. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 39, pages 17333–17341, 2025.arxiv.org/abs/2412.08457
  46. [46]Jingyi Xu, Zilu Zhang, Tal Friedman, Yitao Liang, and Guy Van den Broeck. A semantic loss function for deep learning with symbolic knowledge. In Proceedings of the 35th International Conference on Machine Learning (ICML 2018), volume 80 of Proceedings of Machine Learning Research, pages 5502–5511. PMLR, 2018.arxiv.org/abs/1711.11157
  47. [47]Mihaela Cătălina Stoian, Alex Tatomir, Thomas Lukasiewicz, and Eleonora Giunchiglia. PiShield: A PyTorch package for learning with requirements. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (IJCAI 2024), Demo Track, pages 8805–8809, 2024.arxiv.org/abs/2402.18285
  48. [48]Alessandro Daniele and Luciano Serafini. Knowledge enhanced neural networks. In PRICAI 2019: Trends in Artificial Intelligence, volume 11670 of Lecture Notes in Computer Science, pages 542–554. Springer, 2019.
  49. [49]Gabriele Ciravegna, Pietro Barbiero, Francesco Giannini, Marco Gori, Pietro Liò, Marco Maggini, and Stefano Melacci. Logic explained networks. Artificial Intelligence, 314:103822, 2023.
  50. [50]Stephen H. Bach, Matthias Broecheler, Bert Huang, and Lise Getoor. Hinge-loss Markov random fields and probabilistic soft logic. Journal of Machine Learning Research, 18(109):1–67, 2017.
  51. [51]Yung-Shen Hsia, Fang Yu, and Jie-Hong Roland Jiang. Neuro-symbolic compliance: Integrating LLMs and SMT solvers for automated financial legal analysis. In 2025 2nd IEEE/ACM International Conference on AI-powered Software (AIware), pages 1–10. IEEE, 2025.
  52. [52]An Yang et al. Qwen3 technical report. arXiv:2505.09388, 2025.arxiv.org/abs/2505.09388
  53. [53]Shuai Bai et al. Qwen3-VL technical report. arXiv:2511.21631, 2025.arxiv.org/abs/2511.21631
  54. [54]Anna C. Doris, Daniele Grandi, Ryan Tomich, Md Ferdous Alam, Mohammadmehdi Ataei, Hyunmin Cheong, and Faez Ahmed. DesignQA: A multimodal benchmark for evaluating large language models’ understanding of engineering documentation. Journal of Computing and Information Science in Engineering, 25(2):021009, 2025.arxiv.org/abs/2404.07917
  55. [55]Vito Barbara, Massimo Guarascio, Nicola Leone, Giuseppe Manco, Alessandro Quarta, Francesco Ricca, and Ettore Ritacco. Neuro-symbolic AI for compliance checking of electrical control panels. Theory and Practice of Logic Programming, 23(4):748–764, 2023.arxiv.org/abs/2305.10113
  56. [56]Jisoo Kim, TaeYoon Kwack, Jinwoo Jang, and Honguk Woo. Visual compliance via executable safety rule entailment. arXiv:2609.18328, 2026. Accepted to EMNLP 2026.arxiv.org/abs/2609.18328
  57. [57]Andrew Slavin Ross, Michael C. Hughes, and Finale Doshi-Velez. Right for the right reasons: Training differentiable models by constraining their explanations. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 2662–2670, 2017.arxiv.org/abs/1703.03717
  58. [58]Becks Simpson, Francis Dutil, Yoshua Bengio, and Joseph Paul Cohen. GradMask: Reduce overfitting by regularizing saliency. arXiv:1904.07478, 2019.arxiv.org/abs/1904.07478
  59. [59]Yuyang Gao, Tong Steven Sun, Guangji Bai, Siyi Gu, Sungsoo Ray Hong, and Liang Zhao. RES: A robust framework for guiding visual explanation. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 432–442. ACM, 2022.DOI
  60. [60]Sukrut Rao, Moritz Böhle, Amin Parchami-Araghi, and Bernt Schiele. Studying how to efficiently and effectively guide models with explanations. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV 2023), pages 1922–1933, 2023.
  61. [61]Rattana Pukdee, Dylan Sam, J. Zico Kolter, Maria-Florina Balcan, and Pradeep Ravikumar. Learning with explanation constraints. In Advances in Neural Information Processing Systems 36 (NeurIPS 2023), pages 49883–49926, 2023.
  62. [62]Siyi Du, Shaoming Zheng, Yinsong Wang, Wenjia Bai, Declan P. O’Regan, and Chen Qin. TIP: Tabular-image pre-training for multimodal classification with incomplete data. In Computer Vision – ECCV 2024, volume 15073 of Lecture Notes in Computer Science, pages 478–496. Springer, 2024.arxiv.org/abs/2407.07582
  63. [63]Zhiqiang Tang, Haoyang Fang, Su Zhou, Taojiannan Yang, Zihan Zhong, Cuixiong Hu, Katrin Kirchhoff, and George Karypis. AutoGluon-Multimodal (AutoMM): Supercharging multimodal AutoML with foundation models. In Proceedings of the Third International Conference on Automated Machine Learning (AutoML 2024), volume 256 of Proceedings of Machine Learning Research, pages 15/1–35. PMLR, 2024.arxiv.org/abs/2404.16233
  64. [64]Mihaela Cătălina Stoian, Salijona Dyrmishi, Maxime Cordy, Thomas Lukaszewicz, and Eleonora Giunchiglia. How realistic is your synthetic data? Constraining deep generative models for tabular data. In Proceedings of the 12th International Conference on Learning Representations (ICLR 2024), pages 32167–32204, 2024.
  65. [65]Maximilian-Peter Radtke and Jürgen Bock. Expert knowledge induced Logic Tensor Networks: A bearing fault diagnosis case study. PHM Society European Conference, 7(1):421–431, 2022.DOI
  66. [66]Devashish Gaikwad, Wil M. P. van der Aalst, and G yunam Park. Neuro-symbolic process anomaly detection. In Advanced Information Systems Engineering (CAiSE 2026), volume 16559 of Lecture Notes in Computer Science, pages 240–255. Springer, 2026.
  67. [67]Yuyang Gao, Siyi Gu, Junji Jiang, Sungsoo Ray Hong, Dazhou Yu, and Liang Zhao. Going beyond XAI: A systematic survey for explanation-guided learning. ACM Computing Surveys, 56(7):188:1–188:39, 2024.DOI
  68. [68]Pang Wei Koh, Thao Nguyen, Yew Siang Tang, Stephen Mussmann, Emma Pierson, Been Kim, and Percy Liang. Concept bottleneck models. In Proceedings of the 37th International Conference on Machine Learning (ICML 2020), volume 119 of Proceedings of Machine Learning Research, pages 5338–5348. PMLR, 2020.
  69. [69]Weiyun Wang et al. InternVL3.5: Advancing open-source multimodal models in versatility, reasoning, and efficiency. arXiv:2508.18265, 2025.arxiv.org/abs/2508.18265
  70. [70]Tommaso Carraro, Luciano Serafini, and Fabio Aiolli. LTNtorch: PyTorch implementation of Logic Tensor Networks. arXiv:2409.16045, 2024.arxiv.org/abs/2409.16045
  71. [71]Daniel Raymer. Aircraft Design: A Conceptual Approach. American Institute of Aeronautics and Astronautics, Inc., sixth edition, 2018.
  72. [72]Ilya Loshchilov and Frank Hutter. Decoupled weight decay regularization. In Proceedings of the 7th International Conference on Learning Representations (ICLR 2019), 2019. OpenReview Bkg6RiCqY7.
  73. [73]Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2016), pages 770–778, 2016.arxiv.org/abs/1512.03385
  74. [74]Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. ImageNet: A large-scale hierarchical image database. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2009), pages 248–255, 2009.
  75. [75]Bolei Zhou, Aditya Khosla, Agata Lapedriza, Aude Oliva, and Antonio Torralba. Learning deep features for discriminative localization. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2016), pages 2921–2929, 2016.arxiv.org/abs/1512.04150
  76. [76]Matthias Minderer, Alexey Gritsenko, and Neil Houlsby. Scaling open-vocabulary object detection. In Advances in Neural Information Processing Systems 36 (NeurIPS 2023), pages 72983–73007, 2023.arxiv.org/abs/2306.09683
  77. [77]Alexander Kirillov, Eric Mintun, Nikhila Ravi, Hanzi Mao, Chloe Rolland, Laura Gustafson, Tete Xiao, Spencer Whitehead, Alexander C. Berg, Wan-Yen Lo, Piotr Dollár, and Ross Girshick. Segment anything. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV 2023), pages 3992–4003, 2023.arxiv.org/abs/2304.02643
  78. [78]W. J. Youden. Index for rating diagnostic tests. Cancer, 3(1):32–35, 1950.pubmed.ncbi.nlm.nih.gov/15405679
  79. [79]Richard H. Byrd, Peihuang Lu, Jorge Nocedal, and Ciyou Zhu. A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific Computing, 16(5):1190–1208, 1995.
  80. [80]Riccardo Guidotti. Counterfactual explanations and how to find them: Literature review and benchmarking. Data Mining and Knowledge Discovery, 38(5):2770–2824, 2024.
  81. [81]Jorge Nocedal and Stephen J. Wright. Numerical Optimization. Springer Series in Operations Research and Financial Engineering. Springer, New York, second edition, 2006.
  82. [82]Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In Proceedings of the 3rd International Conference on Learning Representations (ICLR 2015), San Diego, 2015. arXiv:1412.6980.arxiv.org/abs/1412.6980
  83. [83]Stef van Buuren and Karin Groothuis-Oudshoorn. mice: Multivariate imputation by chained equations in R. Journal of Statistical Software, 45(3):1–67, 2011.
  84. [84]Xianjie Chen, Roozbeh Mottaghi, Xiaobai Liu, Sanja Fidler, Raquel Urtasun, and Alan Yuille. Detect what you can: Detecting and representing objects using holistic models and body parts. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2014), pages 1979–1986, 2014.arxiv.org/abs/1406.2031
  85. [85]Ju He, Shuo Yang, Shaokang Yang, Adam Kortylewski, Xiaoding Yuan, Jie-Neng Chen, Shuai Liu, Cheng Yang, Qihang Yu, and Alan Yuille. PartImageNet: A large, high-quality dataset of parts. In Computer Vision – ECCV 2022, volume 13668 of Lecture Notes in Computer Science, pages 128–145. Springer, 2022.arxiv.org/abs/2112.00933
  86. [86]Qing Liu, Adam Kortylewski, Zhishuai Zhang, Zizhang Li, Mengqi Guo, Qihao Liu, Xiaoding Yuan, Jiteng Mu, Weichao Qiu, and Alan Yuille. Learning part segmentation through unsupervised domain adaptation from synthetic vehicles. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR 2022), pages 19118–19129, 2022.arxiv.org/abs/2103.14098
  87. [87]C. A. Field and A. H. Welsh. Bootstrapping clustered data. Journal of the Royal Statistical Society Series B: Statistical Methodology, 69(3):369–390, 2007.DOI
  88. [88]Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. LightGBM: A highly efficient gradient boosting decision tree. In Advances in Neural Information Processing Systems 30 (NIPS 2017), pages 3146–3154, 2017.
  89. [89]Jianming Zhang, Sarah Adel Bargal, Zhe Lin, Jonathan Brandt, Xiaohui Shen, and Stan Sclaroff. Top-down neural attention by excitation backprop. International Journal of Computer Vision, 126(10):1084–1102, 2018.
  90. [90]Zhuang Liu, Hanzi Mao, Chao-Yuan Wu, Christoph Feichtenhofer, Trevor Darrell, and Saining Xie. A ConvNet for the 2020s. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR 2022), pages 11966–11976, 2022.
  91. [91]Donald B. Rubin. Inference and missing data. Biometrika, 63(3):581–592, 1976.
  92. [92]Natalia Neverova, Christian Wolf, Graham Taylor, and Florian Nebout. ModDrop: Adaptive multi-modal gesture recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38(8):1692–1706, 2016.arxiv.org/abs/1501.00102
  93. [93]Miles Brundage et al. The malicious use of artificial intelligence: Forecasting, prevention, and mitigation. arXiv:1802.07228, 2018.arxiv.org/abs/1802.07228
  94. [94]Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. In Proceedings of the 32nd International Conference on Machine Learning (ICML 2015), volume 37 of Proceedings of Machine Learning Research, pages 448–456. PMLR, 2015.

Paper details

vlnc:W_cubbcerd
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

AI tools

View statement
Looking for related papers…
Contents