Capstractcscapstract:2611.00030

Computer Science > Machine Learning

Title:Predicting Proof Search Cost from Care Labels on Stitched Premise Graphs

Abstract:

A static estimate of proof cost is useful when a collection of goals competes for a fixed search budget. We study the information retained by a garment care label assigned to the premises of a goal. Each premise set is sewn onto linen, with a free span of thread for each occurrence of an antecedent. Three textile conservators examine the reverse of the panel and independently specify how it may be washed, dried and pressed. They receive no logical notation. We fit a linear predictor of capped log expansion count to the resulting labels. On 144 goals from 24 held-out rule families it has a mean absolute error of 0.81 bits, compared with 1.08 for a predictor using syntax counts and 0.68 for a graph kernel with access to the original premises. The paired reduction relative to syntax counts is 0.27 bits (95% family bootstrap interval 0.12 to 0.41). Removing the drying instruction costs 0.14 bits. On a paired set of 48 goals, securing the reverse threads changes 31 drying instructions and leaves the proof search itself invariant. The experiment localizes part of the signal to the unsupported span of an antecedent. Several of the most expensive proofs nevertheless admit unrestricted tumble drying.

Comments:3 figures, 3 tables. Includes the textile encoding and inspection form.
Subjects:Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
Cite as:capstract:2611.00030 [cs.LG]
 (or capstract:2611.00030v1 [cs.LG] for this version)

Submission history

From: Ailsa Verdon-Kato
[v1] Mon, 16 Nov 2026 00:56:10 UTC (156 KB)

Current browse context:

cs.LG
Change to browse by:

Export citation